Abstract is missing.
- The Synchronous Condition-Based Consensus HierarchyAchour Mostéfaoui, Sergio Rajsbaum, Michel Raynal. 1-15 [doi]
- Synchronous Condition-Based Consensus Adapting to Input-Vector LegalityTaisuke Izumi, Toshimitsu Masuzawa. 16-29 [doi]
- Group-SolvabilityEli Gafni. 30-40 [doi]
- The Notion of Veto Number and the Respective Power of OP and OS to Solve One-Shot Agreement ProblemsRoy Friedman, Achour Mostéfaoui, Michel Raynal. 41-55 [doi]
- The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO AlgorithmsGadi Taubenfeld. 56-70 [doi]
- Local-Spin Group Mutual Exclusion AlgorithmsRobert Danek, Vassos Hadzilacos. 71-85 [doi]
- On Quorum Systems for Group Resources with Bounded CapacityYuh-Jzer Joung. 86-101 [doi]
- Bounded Version VectorsJosé Bacelar Almeida, Paulo Sérgio Almeida, Carlos Baquero. 102-116 [doi]
- An Optimistic Approach to Lock-Free FIFO QueuesEdya Ladan-Mozes, Nir Shavit. 117-131 [doi]
- A Single-Enqueuer Wait-Free Queue ImplementationMatei David. 132-143 [doi]
- Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CASMaged M. Michael. 144-158 [doi]
- Efficient Adaptive Collect Using RandomizationHagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer. 159-173 [doi]
- Nonblocking Concurrent Data Structures with Condition SynchronizationWilliam N. Scherer III, Michael L. Scott. 174-187 [doi]
- Dynamic Memory ABP Work-StealingDanny Hendler, Yossi Lev, Nir Shavit. 188-200 [doi]
- Coupling and Self-stabilization.Laurent Fribourg, Stéphane Messika, Claudine Picaronny. 201-215 [doi]
- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous RingsPhilippe Duchon, Nicolas Hanusse, Sébastien Tixeuil. 216-229 [doi]
- Virtual Mobile Nodes for Mobile Ad Hoc NetworksShlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch. 230-244 [doi]
- Contention-Free MAC Protocols for Wireless Sensor NetworksCostas Busch, Malik Magdon-Ismail, Fikret Sivrikaya, Bülent Yener. 245-259 [doi]
- Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed SystemsJames Aspnes, Faith Ellen Fich, Eric Ruppert. 260-274 [doi]
- A Local Algorithm for Ad Hoc Majority Voting via Charge FusionYitzhak Birk, Liran Liss, Assaf Schuster, Ran Wolff. 275-289 [doi]
- Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary TopologiesNeeraj Mittal, Subbarayan Venkatesan, Sathya Peri. 290-304 [doi]
- Routing with Improved Communication-Space Trade-OffIttai Abraham, Cyril Gavoille, Dahlia Malkhi. 305-319 [doi]
- Active and Concurrent Topology MaintenanceXiaozhou Li, Jayadev Misra, C. Greg Plaxton. 320-334 [doi]
- Distributed Weighted MatchingMirjam Wattenhofer, Roger Wattenhofer. 335-348 [doi]
- Exploiting Content Localities for Efficient Search in P2P SystemsLei Guo, Song Jiang, Li Xiao, Xiaodong Zhang. 349-364 [doi]
- Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal GraphsYon Dourisboure. 365-378 [doi]
- Towards a Theory of Consistency PrimitivesUeli M. Maurer. 379-389 [doi]
- Fault-Tolerant Storage in a Dynamic EnvironmentUri Nadav, Moni Naor. 390-404 [doi]
- Non-skipping Timestamps for Byzantine Data Storage SystemsRida A. Bazzi, Yin Ding. 405-419 [doi]
- Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are FaultyRida A. Bazzi, Goran Konjevod. 420-434 [doi]
- Optimal Dispersal of Certificate ChainsEunjin Jung, Ehab S. Elmallah, Mohamed G. Gouda. 435-449 [doi]
- On Byzantine Agreement over (2, 3)-Uniform HypergraphsD. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan. 450-464 [doi]