Abstract is missing.
- Lamport on mutual exclusion: 27 years of planting seedsJames H. Anderson. 3-12 [doi]
- The ABCD s of PaxosButler W. Lampson. 13 [doi]
- Sticks and stones: a coding scheme for parameterized verificationAmir Pnueli. 14 [doi]
- Leslie Lamport s properties and actionsMartín Abadi. 15 [doi]
- Implementing atomic objects in a dynamic environmentNancy A. Lynch. 16 [doi]
- The LATEX legacy: 2.09 and all thatChris Rowley. 17-25 [doi]
- On beyond registers: wait-free readable objectsMaurice Herlihy. 26-42 [doi]
- Restoration by path concatenation: fast recovery of MPLS pathsAnat Bremler-Barr, Yehuda Afek, Haim Kaplan, Edith Cohen, Michael Merritt. 43-52 [doi]
- Computing almost shortest pathsMichael Elkin. 53-62 [doi]
- Distributed MST for constant diameter graphsZvi Lotker, Boaz Patt-Shamir, David Peleg. 63-71 [doi]
- String realizers of posets with applications to distributed computingVijay K. Garg, Chakarat Skawratananond. 72-80 [doi]
- On the generalized dining philosophers problemOltea Mihaela Herescu, Catuscia Palamidessi. 81-89 [doi]
- An improved lower bound for the time complexity of mutual exclusionJames H. Anderson, Yong-Jik Kim. 90-99 [doi]
- A note on group mutual exclusionVassos Hadzilacos. 100-106 [doi]
- Nearly optimal perfectly-periodic schedulesAmotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir. 107-116 [doi]
- The do-all problem in broadcast networksBogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas. 117-127 [doi]
- Competitive concurrent distributed queuingMaurice Herlihy, Srikanta Tirthapura, Roger Wattenhofer. 127-133 [doi]
- Bandwidth constrained placement in a WANArun Venkataramani, Phoebe Weidmann, Michael Dahlin. 134-143 [doi]
- A hierarchy of conditions for consensus solvabilityAchour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy. 151-160 [doi]
- The concurrency hierarchy, and algorithms for unbounded concurrencyEli Gafni, Michael Merritt, Gadi Taubenfeld. 161-169 [doi]
- On scalable and efficient distributed failure detectorsIndranil Gupta, Tushar Deepak Chandra, Germán S. Goldszmidt. 170-179 [doi]
- Average probe complexity in quorum systemsYehuda Hassin, David Peleg. 180-189 [doi]
- Lock-free reference countingDavid Detlefs, Paul A. Martin, Mark Moir, Guy L. Steele Jr.. 190-199 [doi]
- Detecting distributed cycles of garbage in large-scale systemsFabrice Le Fessant. 200-209 [doi]
- The IceCube approach to the reconciliation of divergent replicasAnne-Marie Kermarrec, Antony I. T. Rowstron, Marc Shapiro, Peter Druschel. 210-218 [doi]
- Exploitng event stream interpretation in publish-subscribe systemsYuanyuan Zhao, Robert E. Strom. 219-228 [doi]
- Replicated condition monitoringYongqiang Huang, Hector Garcia-Molina. 229-237 [doi]
- Computing property-preserving behaviour abstractions from trace reductions: abstraction-based verification of linear-time properties under fairnessSimon St. James, Ulrich Ultes-Nitsche. 238-245 [doi]
- Reliability and performance of hierarchical RAID with multiple controllersSung Hoon Baek, Bong-Wan Kim, Eui Joung Joung, Chong-Won Park. 246-254 [doi]
- Distributed multi-broadcast in unknown radio networksAndrea E. F. Clementi, Angelo Monti, Riccardo Silvestri. 255-264 [doi]
- Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networksErran L. Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer. 264-273 [doi]
- Practical multi-candidate election systemOlivier Baudron, Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Guillaume Poupard. 274-283 [doi]
- An optimally robust hybrid mix networkMarkus Jakobsson, Ari Juels. 284-292 [doi]
- Selective private function evaluation with applications to private statisticsRan Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright. 293-304 [doi]
- Optimal scheduling for disconnected cooperationGrzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman. 305-307 [doi]
- Adding networksPanagiota Fatourou, Maurice Herlihy. 308-310 [doi]
- Randomized shared queuesHyunyoung Lee, Jennifer L. Welch. 311-313 [doi]
- Dynamic input/output automata, a formal model for dynamic systemsPaul C. Attie, Nancy A. Lynch. 314-316 [doi]
- A framework for semantic reasoning about Byzantine quorum systemsEvelyn Tumlin Pierce, Lorenzo Alvisi. 317-319 [doi]
- An efficient communication strategy for ad-hoc mobile networksIoannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis. 320-322 [doi]
- Correction: practical implementations of non-blocking synchronization primitivesMark Moir. 323 [doi]