Abstract is missing.
- Automatically Adjusting Concurrency to the Level of SynchronyPierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy. 1-15 [doi]
- Speed Faults in Computation by Chemical Reaction NetworksHo-Lin Chen, Rachel Cummings, David Doty, David Soloveichik. 16-30 [doi]
- Fault-Tolerant ANTSTobias Langner, Jara Uitto, David Stolz, Roger Wattenhofer. 31-45 [doi]
- Task Allocation in Ant ColoniesAlejandro Cornejo, Anna R. Dornhaus, Nancy A. Lynch, Radhika Nagpal. 46-60 [doi]
- Communication-Efficient Randomized ConsensusDan Alistarh, James Aspnes, Valerie King, Jared Saia. 61-75 [doi]
- Tight Bound on Mobile Byzantine AgreementFrançois Bonnet, Xavier Défago, Thanh Dang Nguyen, Maria Potop-Butucaru. 76-90 [doi]
- Unbeatable ConsensusArmando Castañeda, Yannai A. Gonczarowski, Yoram Moses. 91-106 [doi]
- Reliable Broadcast with Respect to Topology KnowledgeAris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas. 107-121 [doi]
- Evacuating Robots via Unknown Exit in a DiskJurek Czyzowicz, Leszek Gasieniec, Thomas Gorry, Evangelos Kranakis, Russell Martin, Dominik Pajak. 122-136 [doi]
- Randomized Pattern Formation Algorithm for Asynchronous Oblivious Mobile RobotsYukiko Yamauchi, Masafumi Yamashita. 137-151 [doi]
- A Theoretical Foundation for Scheduling and Designing Heterogeneous Processors for Interactive ApplicationsShaolei Ren, Yuxiong He, Kathryn S. McKinley. 152-166 [doi]
- Vertex Fault Tolerant Additive SpannersMerav Parter. 167-181 [doi]
- Close to Linear Space Routing SchemesLiam Roditty, Roei Tov. 182-196 [doi]
- Near-Optimal Distributed Tree EmbeddingMohsen Ghaffari, Christoph Lenzen. 197-211 [doi]
- Deterministic Leader Election in Multi-hop Beeping Networks - (Extended Abstract)Klaus-Tycho Förster, Jochen Seidel, Roger Wattenhofer. 212-226 [doi]
- Who Are You? Secure Identities in Ad Hoc NetworksSeth Gilbert, Calvin C. Newport, Chaodong Zheng. 227-242 [doi]
- Approximate Local Sums and Their Applications in Radio NetworksZhiyu Liu, Maurice Herlihy. 243-257 [doi]
- Radio Network Lower Bounds Made EasyCalvin C. Newport. 258-272 [doi]
- On Correctness of Data Structures under Reads-Write ConcurrencyKfir Lev-Ari, Gregory Chockler, Idit Keidar. 273-287 [doi]
- Solo-Fast Universal Constructions for Deterministic Abortable ObjectsClaire Capdevielle, Colette Johnen, Alessia Milani. 288-302 [doi]
- Space Bounds for Adaptive RenamingMaryam Helmi, Lisa Higham, Philipp Woelfel. 303-317 [doi]
- Lower Bounds for Structuring Unreliable Radio NetworksCalvin C. Newport. 318-332 [doi]
- Random Walks on Evolving Graphs with Recurring TopologiesOksana Denysyuk, Luís Rodrigues. 333-345 [doi]
- Randomized Rumor Spreading in Poorly Connected Small-World NetworksAbbas Mehrabian, Ali Pourmiri. 346-360 [doi]
- Making Sense of Relativistic Distributed SystemsSeth Gilbert, Wojciech M. Golab. 361-375 [doi]
- Safety of Live Transactions in Transactional Memory: TMS is Necessary and SufficientHagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky. 376-390 [doi]
- Decomposing OpacityMohsen Lesani, Jens Palsberg. 391-405 [doi]
- The Adaptive Priority Queue with Elimination and CombiningIrina Calciu, Hammurabi Mendes, Maurice Herlihy. 406-420 [doi]
- Improving Average Performance by Relaxing Distributed Data StructuresEdward Talmage, Jennifer L. Welch. 421-438 [doi]
- Almost-Tight Distributed Minimum Cut AlgorithmsDanupon Nanongkai, Hsin-Hao Su. 439-453 [doi]
- Distributed Algorithms for Coloring Interval GraphsMagnús M. Halldórsson, Christian Konrad. 454-468 [doi]
- Distributed Symmetry Breaking in HypergraphsShay Kutten, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson 0002. 469-483 [doi]
- On Streaming and Communication Complexity of the Set Cover ProblemErik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian. 484-498 [doi]
- On the Communication Complexity of Linear Algebraic Problems in the Message Passing ModelYi Li, Xiaoming Sun, Chengu Wang, David P. Woodruff. 499-513 [doi]
- Near-Constant-Time Distributed Algorithms on a Congested CliqueJames W. Hegeman, Sriram V. Pemmaraju, Vivek Sardeshmukh. 514-530 [doi]
- Replacement - Handling Failures in a Replicated State MachineLeander Jehl, Tormod Erevik Lea, Hein Meling. 531-532 [doi]
- The Power of Scheduling-Aware SynchronizationPanagiota Fatourou, Nikolaos D. Kallimanis. 533-534 [doi]
- Assignment of Different-Sized Inputs in MapReduceFoto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma 0001, Jeffrey D. Ullman. 536-537 [doi]
- Scheduling Multiple Objects in Distributed Transactional MemoryCostas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma. 538-539 [doi]
- Relaxing Opacity in Pessimistic Transactional MemoryKonrad Siek, Pawel T. Wojciechowski. 540-541 [doi]
- A Practical Transactional Memory InterfaceShahar Timnat, Maurice Herlihy, Erez Petrank. 542-543 [doi]
- On Dynamic and Multi-functional Labeling SchemesSøren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart. 544-545 [doi]
- Update Consistency in Partitionable SystemsMatthieu Perrin, Achour Mostéfaoui, Claude Jard. 546-549 [doi]
- Breaching the Wall of Impossibility Results on Disjoint-Access Parallel TMSebastiano Peluso, Roberto Palmieri, Paolo Romano, Binoy Ravindran, Francesco Quaglia. 548-549 [doi]
- COP Composition Using Transaction Suspension in the CompilerHillel Avni, Adi Suissa-Peleg. 550-552 [doi]
- Non-blocking Monitor Executions for Increased ParallelismWei-Lun Hung, Himanshu Chauhan, Vijay K. Garg. 553-554 [doi]
- Agreement in Partitioned Dynamic NetworksAdam Sealfon, Aikaterini A. Sotiraki. 555-556 [doi]
- The 1-2-3-Toolkit for Building Your Own Balls-into-Bins AlgorithmPierre Bertrand, Christoph Lenzen. 557-558 [doi]
- k-Selection and Sorting in the SINR ModelStephan Holzer, Sebastian Kohler, Roger Wattenhofer. 559-561 [doi]
- Distributed 3/2-Approximation of the DiameterStephan Holzer, David Peleg, Liam Roditty, Roger Wattenhofer. 562-564 [doi]
- Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling SchemesLélia Blin, Pierre Fraigniaud. 565-566 [doi]
- Secure Anonymous BroadcastMahnush Movahedi, Jared Saia, Mahdi Zamani. 567-568 [doi]
- Privacy-Preserving Location-Based ServicesMahnush Movahedi, Mahdi Zamani. 569-571 [doi]