Abstract is missing.
- Exploring Gafni s Reduction Land: From ::::Omega:::::::::::k::::::: to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set AgreementAchour Mostéfaoui, Michel Raynal, Corentin Travers. 1-15 [doi]
- Renaming in Message Passing Systems with Byzantine FailuresMichael Okun, Amnon Barak. 16-30 [doi]
- Built-In Coloring for Highly-Concurrent Doubly-Linked ListsHagit Attiya, Eshcar Hillel. 31-45 [doi]
- Fault-Tolerant and Self-stabilizing Mobile Robots GatheringXavier Défago, Maria Gradinariu, Stéphane Messika, Philippe Raipin Parvédy. 46-60 [doi]
- Fast Computation by Population Protocols with a LeaderDana Angluin, James Aspnes, David Eisenstat. 61-75 [doi]
- On Self-stabilizing Search TreesDoina Bein, Ajoy Kumar Datta, Lawrence L. Larmore. 76-89 [doi]
- Efficient Dynamic AggregationYitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster. 90-104 [doi]
- Groupings and Pairings in Anonymous NetworksJérémie Chalopin, Shantanu Das, Nicola Santoro. 105-119 [doi]
- A New Proof of the GHS Minimum Spanning Tree AlgorithmYoram Moses, Benny Shimony. 120-135 [doi]
- A Knowledge-Based Analysis of Global Function ComputationJoseph Y. Halpern, Sabina Petride. 136-150 [doi]
- Checking a Multithreaded Algorithm with :::+:::CALLeslie Lamport. 151-163 [doi]
- Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium ArchitectureLisa Higham, LillAnne Jackson, Jalal Kawash. 164-178 [doi]
- Conflict Detection and Validation Strategies for Software Transactional MemoryMichael F. Spear, Virendra J. Marathe, William N. Scherer III, Michael L. Scott. 179-193 [doi]
- Transactional Locking IIDavid Dice, Ori Shalev, Nir Shavit. 194-208 [doi]
- Less Is More: Consensus Gaps Between Restricted and Unrestricted ObjectsYehuda Afek, Eran Shalom. 209-223 [doi]
- One-Step Consensus SolvabilityTaisuke Izumi, Toshimitsu Masuzawa. 224-237 [doi]
- Time-Bounded Task-PIOAs: A Framework for Analyzing Security ProtocolsRan Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala. 238-253 [doi]
- On Consistency of Encrypted FilesAlina Oprea, Michael K. Reiter. 254-268 [doi]
- Agreeing to Agree: Conflict Resolution for Optimistically Replicated DataMichael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt. 269-283 [doi]
- A Lazy Snapshot Algorithm with Eager ValidationTorvald Riegel, Pascal Felber, Christof Fetzer. 284-298 [doi]
- Bounded Wait-Free ::::f::::-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of ClientsRida A. Bazzi, Yin Ding. 299-313 [doi]
- Time and Communication Efficient Consensus for Crash FailuresBogdan S. Chlebus, Dariusz R. Kowalski. 314-328 [doi]
- Subconsensus Tasks: Renaming Is Weaker Than Set AgreementEli Gafni, Sergio Rajsbaum, Maurice Herlihy. 329-338 [doi]
- Exact Distance Labelings Yield Additive-Stretch Compact Routing SchemesArthur Brady, Lenore Cowen. 339-354 [doi]
- A Fast Distributed Approximation Algorithm for Minimum Spanning TreesMaleq Khan, Gopal Pandurangan. 355-369 [doi]
- On Randomized Broadcasting in Power Law NetworksRobert Elsässer. 370-384 [doi]
- Distributed Approximation Algorithms in Unit-Disk GraphsAndrzej Czygrinow, Michal Hanckowiak. 385-398 [doi]
- The Weakest Failure Detectors to Boost Obstruction-FreedomRachid Guerraoui, Michal Kapalka, Petr Kouznetsov. 399-412 [doi]
- Fully-Adaptive Algorithms for Long-Lived RenamingAlex Brodsky, Faith Ellen, Philipp Woelfel. 413-427 [doi]
- Constructing Shared Objects That Are Both Robust and High-ThroughputDanny Hendler, Shay Kutten. 428-442 [doi]
- Byzantine and Multi-writer K-QuorumsAmitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi. 443-458 [doi]
- On Minimizing the Number of ADMs in a General Topology Optical NetworkMichele Flammini, Mordechai Shalom, Shmuel Zaks. 459-473 [doi]
- Robust Network Supercomputing with Malicious ProcessesKishori M. Konwar, Sanguthevar Rajasekaran, Alexander A. Shvartsman. 474-488 [doi]
- Distributed Resource Allocation in Stream Processing SystemsCathy H. Xia, James Broberg, Zhen Liu, Li Zhang. 489-504 [doi]
- Low-latency Atomic Broadcast in the presence of contentionPiotr Zielinski. 505-519 [doi]
- Oblivious Gradient Clock SynchronizationThomas Locher, Roger Wattenhofer. 520-533 [doi]
- Brief Announcement: Abortable and Query-Abortable ObjectsMarcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg. 534-536 [doi]
- Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write RegistersChryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman. 537-539 [doi]
- Brief Announcement: Convergence Analysis of Scalable Gossip ProtocolsStacy Patterson, Bassam Bamieh, Amr El Abbadi. 540-542 [doi]
- Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best SchedulesJoffroy Beauquier, Colette Johnen, Stéphane Messika. 543-547 [doi]
- Brief Announcement: Many Slices Are Better Than OneVinit A. Ogale, Vijay K. Garg. 548-550 [doi]
- Brief Announcement: On Augmented Graph NavigabilityPierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker. 551-553 [doi]
- Brief Announcement: Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed SystemsAlysson Neves Bessani, Miguel Correia, Joni da Silva Fraga, Lau Cheuk Lung. 554-556 [doi]
- Brief Announcement: Optimistic Algorithms for Partial Database ReplicationNicolas Schiper, Rodrigo Schmidt, Fernando Pedone. 557-559 [doi]
- Brief Announcement: Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P OverlaysFrançois Bonnet, Frederic Tronel, Spyros Voulgaris. 560-562 [doi]
- Brief Announcement: Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay MaintenanceYu Chen, Wei Chen. 563-565 [doi]
- Brief Announcement Monitoring of Linear Distributed ComputationsAnton Esin, Rostislav Yavorskiy, Nikolay Zemtsov. 566-568 [doi]
- Brief Announcement: Communication-Optimal Implementation of Failure Detector Class à::::P::::Mikel Larrea, Alberto Lafuente, Joachim Wieland. 569-571 [doi]
- Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio NetworksSrinivasan Krishnamurthy, R. Chandrasekaran, Neeraj Mittal, Subbarayan Venkatesan. 572-574 [doi]