Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th PODC 2001: Newport, Rhode Island, USA
- Ajay D. Kshemkalyani, Nir Shavit:
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001. ACM 2001, ISBN 1-58113-383-9 - James H. Anderson:
Lamport on mutual exclusion: 27 years of planting seeds. 3-12 - Butler W. Lampson:
The ABCD's of Paxos. 13 - Amir Pnueli:
Sticks and stones: a coding scheme for parameterized verification. 14 - Martín Abadi:
Leslie Lamport's properties and actions. 15 - Nancy A. Lynch:
Implementing atomic objects in a dynamic environment. 16 - Chris Rowley:
The LATEX legacy: 2.09 and all that. 17-25 - Maurice Herlihy:
On beyond registers: wait-free readable objects. 26-42 - Anat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt:
Restoration by path concatenation: fast recovery of MPLS paths. 43-52 - Michael Elkin:
Computing almost shortest paths. 53-62 - Zvi Lotker, Boaz Patt-Shamir, David Peleg:
Distributed MST for constant diameter graphs. 63-71 - Vijay K. Garg, Chakarat Skawratananond:
String realizers of posets with applications to distributed computing. 72-80 - Oltea Mihaela Herescu, Catuscia Palamidessi
:
On the generalized dining philosophers problem. 81-89 - James H. Anderson, Yong-Jik Kim:
An improved lower bound for the time complexity of mutual exclusion. 90-99 - Vassos Hadzilacos:
A note on group mutual exclusion. 100-106 - Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir:
Nearly optimal perfectly-periodic schedules. 107-116 - Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas:
The do-all problem in broadcast networks. 117-127 - Maurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer:
Competitive concurrent distributed queuing. 127-133 - Arun Venkataramani, Phoebe Weidmann, Michael Dahlin:
Bandwidth constrained placement in a WAN. 134-143 - Michael Mitzenmacher:
Compressed bloom filters. 144-150 - Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy:
A hierarchy of conditions for consensus solvability. 151-160 - Eli Gafni, Michael Merritt, Gadi Taubenfeld:
The concurrency hierarchy, and algorithms for unbounded concurrency. 161-169 - Indranil Gupta, Tushar Deepak Chandra, Germán S. Goldszmidt:
On scalable and efficient distributed failure detectors. 170-179 - Yehuda Hassin, David Peleg:
Average probe complexity in quorum systems. 180-189 - David Detlefs, Paul Alan Martin, Mark Moir, Guy L. Steele Jr.:
Lock-free reference counting. 190-199 - Fabrice Le Fessant:
Detecting distributed cycles of garbage in large-scale systems. 200-209 - Anne-Marie Kermarrec, Antony I. T. Rowstron, Marc Shapiro, Peter Druschel:
The IceCube approach to the reconciliation of divergent replicas. 210-218 - Yuanyuan Zhao, Robert E. Strom:
Exploitng event stream interpretation in publish-subscribe systems. 219-228 - Yongqiang Huang, Hector Garcia-Molina:
Replicated condition monitoring. 229-237 - Simon St. James, Ulrich Ultes-Nitsche:
Computing property-preserving behaviour abstractions from trace reductions: abstraction-based verification of linear-time properties under fairness. 238-245 - Sung Hoon Baek, Bong Wan Kim, Eui Joung Joung, Chong-Won Park:
Reliability and performance of hierarchical RAID with multiple controllers. 246-254 - Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Distributed multi-broadcast in unknown radio networks. 255-264 - Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer:
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. 264-273 - Olivier Baudron, Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Guillaume Poupard:
Practical multi-candidate election system. 274-283 - Markus Jakobsson, Ari Juels:
An optimally robust hybrid mix network. 284-292 - Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright:
Selective private function evaluation with applications to private statistics. 293-304 - Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman:
Optimal scheduling for disconnected cooperation. 305-307 - Panagiota Fatourou, Maurice Herlihy:
Adding networks. 308-310 - Hyunyoung Lee, Jennifer L. Welch:
Randomized shared queues. 311-313 - Paul C. Attie, Nancy A. Lynch:
Dynamic input/output automata, a formal model for dynamic systems. 314-316 - Evelyn Tumlin Pierce, Lorenzo Alvisi:
A framework for semantic reasoning about Byzantine quorum systems. 317-319 - Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
An efficient communication strategy for ad-hoc mobile networks. 320-322 - Mark Moir:
Correction: practical implementations of non-blocking synchronization primitives. 323
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
