PODC 2001:  Accepted Papers

Regular Papers

• An Efficient Distributed Algorithm for Constructing Small Dominating Sets by Lujun Jia, Rajmohan Rajaraman, and Torsten Suel
  Lujun Jia is the winner of the best student paper award!!!
• Lock-Free Reference Counting by David Detlefs, Paul Martin, Mark Moir, and Guy Steele
• Distributed Multi-Broadcast in Unknown Radio Networks by Andrea E. F. Clementi, Angelo Monti, and Riccardo Silvestri
• The Concurrency Hierarchy, and Algorithms for Unbounded Concurrency by Eli Gafni, Michael Merritt, Gadi Taubenfeld
• Computing Almost Shortest Paths by Michael Elkin
• Restoration by Path Concatenation: Fast Recovery of MPLS Paths by Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
• Average Probe Complexity in Quorum Systems by Yehuda Hassin and David Peleg
• An Improved Lower Bound for the Time Complexity of Mutual Exclusion by James H. Anderson and Yong-Jik Kim
• Detecting Distributed Cycles of Garbage in Large-Scale Systems by Fabrice le Fessant
• Compressed Bloom Filters by Michael Mitzenmacher
• A note on group mutual exclusion by Vassos Hadzilacos
• Nearly Optimal Perfectly-Periodic Schedules by Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir
• Replicated condition monitoring by Yongqiang Huang and Hector Garcia-Molina
• The Do-All Problem in Broadcast Networks by Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas
• The IceCube approach to the reconciliation of divergent replicas by Anne-Marie Kermarrec, Antony Rowstron, Marc Shapiro, Peter Druschel
• Exploiting Event Stream Interpretation in Publish-Subscribe Systems by Yuanyuan Zhao and Rob Strom
• Distributed MST for Constant Diameter Graphs by Zvi Lotker, Boaz Patt-Shamir and David Peleg
• String Realizers of Posets with Applications to Distributed Computing by Vijay K. Garg and Chakarat Skawratananond
• The Bandwidth Constrained Placement Problem by Arun Venkataramani, Mike Dahlin, Phoebe Wiedmann
• On Scalable and Efficient Distributed Failure Detectors by Indranil Gupta, Tushar D. Chandra, German S. Goldszmidt
• Analysis of Distributed Topology Control Algorithms for Wireless Multi-hop Networks by Yi-Min Wang
• Computing Property-Preserving Behaviour Abstractions from Trace Reductions by Simon St. James and Ulrich Ultes-Nitsche
• Reliability and Performance of Hierarchical RAID with Multiple Controllers by Sung Hoon Baek, Bong Wan Kim, Eui Joung Joung, and Chong Won Park
• On the generalized dining philosophers problem by Oltea Mihaela Herescu and Catuscia Palamidessi
• A Hierarchy of Conditions for Consensus Solvability by Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy
• Private function evaluation with sublinear communication by Ran Canetti, Yuval Ishai, Ravi Kumar, Michael Reiter, Ronitt Rubinfeld, and Rebecca Wright
• Competitive Concurrent Distributed Queuing by Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer
• An Optimally Robust Hybrid Mix Network by Markus Jakobsson and Ari Juels
• Practical Multi-Candidate Election System by Olivier Baudron, Pierre-Alain Fouque David Pointcheval, Guillaume Poupard, and Jacques Stern

Brief Announcements

• Randomized Shared Queues by Hyunyoung Lee and Jennifer L. Welch
• Optimal Scheduling for Distributed Cooperation Without Communication by Grzegorz Greg Malewicz, Alexander Russell, Alex A. Shvartsman
• Dynamic Input/Output Automata: a Formal Model for Dynamic Systems by Paul Attie and Nancy Lynch
• A Framework for Semantic Reasoning about Byzantine Quorum Systems by Evelyn Pierce and Lorenzo Alvisi
• Self-Organizing Ad-Hoc Mobile Networks:  The problem of end-to-end communication by I. Chatzigiannakis, S. Nikoletseas and P. Spirakis
• Adding Networks by Panagiota Fatourou and Maurice Herlihy

---

This page is maintained by Gil Neiger (gilATacm.org)