PODC A*

43 papers

YearTitle / Authors
2001A framework for semantic reasoning about Byzantine quorum systems.
Evelyn Tumlin Pierce, Lorenzo Alvisi
2001A hierarchy of conditions for consensus solvability.
Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy
2001A note on group mutual exclusion.
Vassos Hadzilacos
2001Adding networks.
Panagiota Fatourou, Maurice Herlihy
2001An efficient communication strategy for ad-hoc mobile networks.
Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis
2001An improved lower bound for the time complexity of mutual exclusion.
James H. Anderson, Yong-Jik Kim
2001An optimally robust hybrid mix network.
Markus Jakobsson, Ari Juels
2001Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks.
Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer
2001Average probe complexity in quorum systems.
Yehuda Hassin, David Peleg
2001Bandwidth constrained placement in a WAN.
Arun Venkataramani, Phoebe Weidmann, Michael Dahlin
2001Competitive concurrent distributed queuing.
Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer
2001Compressed bloom filters.
Michael Mitzenmacher
2001Computing almost shortest paths.
Michael Elkin
2001Computing property-preserving behaviour abstractions from trace reductions: abstraction-based verification of linear-time properties under fairness.
Simon St. James, Ulrich Ultes-Nitsche
2001Correction: practical implementations of non-blocking synchronization primitives.
Mark Moir
2001Detecting distributed cycles of garbage in large-scale systems.
Fabrice Le Fessant
2001Distributed MST for constant diameter graphs.
Zvi Lotker, Boaz Patt-Shamir, David Peleg
2001Distributed multi-broadcast in unknown radio networks.
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001Dynamic input/output automata, a formal model for dynamic systems.
Paul C. Attie, Nancy A. Lynch
2001Exploitng event stream interpretation in publish-subscribe systems.
Yuanyuan Zhao, Robert E. Strom
2001Implementing atomic objects in a dynamic environment.
Nancy A. Lynch
2001Lamport on mutual exclusion: 27 years of planting seeds.
James H. Anderson
2001Leslie Lamport's properties and actions.
Martín Abadi
2001Lock-free reference counting.
David Detlefs, Paul Alan Martin, Mark Moir, Guy L. Steele Jr.
2001Nearly optimal perfectly-periodic schedules.
Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir
2001On beyond registers: wait-free readable objects.
Maurice Herlihy
2001On scalable and efficient distributed failure detectors.
Indranil Gupta, Tushar Deepak Chandra, Germán S. Goldszmidt
2001On the generalized dining philosophers problem.
Oltea Mihaela Herescu, Catuscia Palamidessi
2001Optimal scheduling for disconnected cooperation.
Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
2001Practical multi-candidate election system.
Olivier Baudron, Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Guillaume Poupard
2001Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001
Ajay D. Kshemkalyani, Nir Shavit
2001Randomized shared queues.
Hyunyoung Lee, Jennifer L. Welch
2001Reliability and performance of hierarchical RAID with multiple controllers.
Sung Hoon Baek, Bong Wan Kim, Eui Joung Joung, Chong-Won Park
2001Replicated condition monitoring.
Yongqiang Huang, Hector Garcia-Molina
2001Restoration by path concatenation: fast recovery of MPLS paths.
Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt
2001Selective private function evaluation with applications to private statistics.
Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright
2001Sticks and stones: a coding scheme for parameterized verification.
Amir Pnueli
2001String realizers of posets with applications to distributed computing.
Vijay K. Garg, Chakarat Skawratananond
2001The ABCD's of Paxos.
Butler W. Lampson
2001The IceCube approach to the reconciliation of divergent replicas.
Anne-Marie Kermarrec, Antony I. T. Rowstron, Marc Shapiro, Peter Druschel
2001The LATEX legacy: 2.09 and all that.
Chris Rowley
2001The concurrency hierarchy, and algorithms for unbounded concurrency.
Eli Gafni, Michael Merritt, Gadi Taubenfeld
2001The do-all problem in broadcast networks.
Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas