PODC 2002: Accepted Papers
Regular Papers
-
Nonatomic Mutual Exclusion with Local Spinning
James H. Anderson and Yong-Jik
Kim
Winner of Best Student-Paper Award
-
A BGP-based Mechanism for Lowest-Cost Routing
Joan Feigenbaum, Christos Papadimitriou, Rahul
Sami, Scott Shenker
-
Searching for a Black Hole in Arbitrary Networks:
Optimal Mobile Agent Protocols
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,
Nicola Santoro
-
On Perfectly Secure Communication over Arbitrary
Networks
M V N Ashwin Kumar, Pranava Raja Goundan, K Srinathan,
C Pandu Rangan
-
Nearly Optimal FIFO Buffer Management for DiffServ
Zvi Lotker and Boaz Patt-Shamir
-
Optimal Plans for Aggregation
Andrei Broder and Michael Mitzenmacher
-
Sequential Composition of Protocols without Simultaneous
Termination
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
-
Fault-tolerant Routing in Peer-to-peer Systems
James Aspnes, Zoe Diamadi, Gauri Shah
-
Active Disk Paxos with infinitely many processes
Gregory Chockler, Dahlia Malkhi
-
Space-Optimal Multi-Writer Snapshot Objects Are Slow
Panagiota Fatourou, Faith Fich and Eric Ruppert|
-
Establishing Wireless Conference Calls Under Delay
Constraints
Amotz Bar-Noy, Grzegorz Malewicz
-
The Inherent Price of Indulgence
Partha Dutta and Rachid Guerraoui
-
Efficient algorithms for leader election in radio
networks
Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski
-
Dynamic and Self-Stabilizing Distributed Matching
Subhendu Chattopadhyay, Lisa Higham, Karen Seyffarth
-
Evaluating the Running Time of a Communication Round
over the Internet
Omar Bakr and Idit Keidar
-
Byzantine Agreement Secure Against Faulty Majorities
From Scratch
Matthias Fitzi, Daniel Gottesman, Martin Hirt,
Thomas Holenstein, and Adam Smith
-
Viceroy: A Scalable and Dynamic Emulation of the
Butterfly
Dahlia Malkhi, Moni Naor and David Ratajczak
-
Safe Memory Reclamation for Dynamic Lock-Free Objects
Using Atomic Reads and Writes
Maged M. Michael
-
Minimal Replication Cost for Availability
Haifeng Yu and Amin Vahdat
-
Non-Blocking Timeout in Scalable Queue-Based Spin
Locks
Michael L. Scott
-
Non-Blocking Steal-half Work Queues
Danny Hendler and Nir Shavit
-
Building secure file systems out of Byzantine storage
David Mazières and Dennis Shasha
-
General Perfectly Periodic Scheduling
Zvika Brakerski, Aviv Nisgav, and Boaz Patt-Shamir
-
Optimal Lexicographic Smoothing for Broadband Traffic
Multiplexing
Stergios Anastasiadis, Peter Varman, Jeffrey
Scott Vitter, Ke Yi
-
GS3: Scalable Self-configuration and Self-healing
in Wireless Networks
Hongwei Zhang and Anish Arora
-
Analysis of the Evolution of Peer-to-Peer Systems
Hari Balakrishnan, David Karger, and David Liben-Nowell
-
Tree Theorem and its Applications
Prasad Jayanti
-
Two-Handed Emulation: How to build non-blocking implementations
of complex data-structures using DCAS
Michael B. Greenwald
-
Squirrel: A decentralized peer-to-peer web cache
Sitaram Iyer, Antony Rowstron, and Peter Druschel
Brief Announcements
-
Understanding Perfect Failure Detectors
Mikel Larrea
-
Exploiting Precision vs. Efficiency Tradeoffs in
Symmetric Replication Environments
Ugur Cetintemel, Peter Keleher
-
The Lord of the Rings: Efficient Maintenance of Views
at Data Warehouses
D. Agrawal, A. El Abbadi, A. Mostefaoui, M. Raynal,
M. Roy
-
A highly concurrent group mutual l-exclusion
algorithm
K. Vidyasankar
-
Dynamic-Sized Lock-Free Data Structures
Maurice Herlihy, Victor Luchangco, Paul Martin,
Mark Moir
-
Optimally Work-Competitive Scheduling for Cooperative
Computing with Merging Groups
Chryssis Georgiou, Alexander Russell and Alex
A. Shvartsman
-
Assignment-based Partitioning in a Condition Monitoring
System
Yongqiang Huang and Hector Garcia-Molina
-
Asynchronous Interactive Consistency and its Relation
with Error-Correcting Codes
Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal
-
Selective Anti-Entropy
Weihbin Zhao and Henning Schulzrinne
-
Compact Routing for Average-Case Networks
Kazuo Iwama and Masaki Okita
-
How to wait when you are not going to block
Michael Greenwald
-
Building Responsive TMR-Based Servers in Presence
of Timing Constraints
Paul Ezhilchelvan, Jean-Michel Helary and Michel
Raynal
-
Early Stopping in Global Data Computation
C. Delporte-Gallet, H. Fauconnier, J.-M. Helary,
and M. Raynal
-
Random Walk for Self-Stabilizing Group Communication
in Ad-Hoc Networks
Shlomi Dolev, Elad Schiller, and Jennifer Welch
This page is maintained by Gil Neiger (gilATacm.org)