Abstract is missing.
- Fast Two-Robot Disk Evacuation with Wireless CommunicationIoannis Lamprou, Russell Martin, Sven Schewe. 1-15 [doi]
- Deterministic Leader Election in O(D+\log n) Time with Messages of Size O(1)Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari. 16-28 [doi]
- Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse NetworksAmir Abboud, Keren Censor Hillel, Seri Khoury. 29-42 [doi]
- Fast Distributed Algorithms for Testing Graph PropertiesKeren Censor Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev. 43-56 [doi]
- Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic ProblemsFrançois Le Gall. 57-70 [doi]
- Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay NetworksChristian Scheideler, Alexander Setzer, Thim Strothmann. 71-84 [doi]
- Asynchronous Embedded Pattern Formation Without OrientationSerafino Cicerone, Gabriele Di Stefano, Alfredo Navarra. 85-98 [doi]
- Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL ModelDan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger. 99-113 [doi]
- Optimal Consistent Network Updates in Polynomial TimePavol Cerný, Nate Foster, Nilesh Jagnik, Jedidiah McClurg. 114-128 [doi]
- Distributed Construction of Purely Additive SpannersKeren Censor Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff. 129-142 [doi]
- Optimal Fair ComputationRachid Guerraoui, Jingjing Wang. 143-157 [doi]
- Near-Optimal Low-Congestion Shortcuts on Bounded Parameter GraphsBernhard Haeupler, Taisuke Izumi, Goran Zuzic. 158-172 [doi]
- Anonymity-Preserving Failure DetectorsZohir Bouzid, Corentin Travers. 173-186 [doi]
- Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile RobotsPierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain. 187-200 [doi]
- Non-local Probes Do Not Help with Many Graph ProblemsMika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela. 201-214 [doi]
- Are Byzantine Failures Really Different from Crash Failures?Damien Imbs, Michel Raynal, Julien Stainer. 215-229 [doi]
- Sublinear-Space Distance Labeling Using HubsPawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski. 230-242 [doi]
- Online Balanced RepartitioningChen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid. 243-256 [doi]
- Lower Bound on the Step Complexity of Anonymous Binary ConsensusHagit Attiya, Ohad Ben-Baruch, Danny Hendler. 257-268 [doi]
- Opacity vs TMS2: Expectations and RealitySandeep Hans, Ahmed Hassan, Roberto Palmieri, Sebastiano Peluso, Binoy Ravindran. 269-283 [doi]
- On Composition and Implementation of Sequential ConsistencyMatthieu Perrin, Matoula Petrolia, Achour Mostéfaoui, Claude Jard. 284-297 [doi]
- k-Abortable Objects: Progress Under High ContentionNaama Ben-David, David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg. 298-312 [doi]
- Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure ModelJoseph Izraelevitz, Hammurabi Mendes, Michael L. Scott. 313-327 [doi]
- Buffer Size for Routing Limited-Rate Adversarial TrafficAvery Miller, Boaz Patt-Shamir. 328-341 [doi]
- Distributed Testing of Excluded SubgraphsPierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca. 342-356 [doi]
- How to Discreetly Spread a Rumor in a CrowdMohsen Ghaffari, Calvin C. Newport. 357-370 [doi]
- Depth of a Random Binary Search Tree with Concurrent InsertionsJames Aspnes, Eric Ruppert. 371-384 [doi]
- Priority Mutual Exclusion: Specification and AlgorithmChien-Chung Huang, Prasad Jayanti. 385-398 [doi]
- Information Spreading in Dynamic Networks Under Oblivious AdversariesJohn Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman. 399-413 [doi]
- Non-Bayesian Learning in the Presence of Byzantine AgentsLili Su, Nitin H. Vaidya. 414-427 [doi]
- Asynchronous Computability Theorems for t-Resilient SystemsVikram Saraph, Maurice Herlihy, Eli Gafni. 428-441 [doi]
- Upper Bounds for Boundless Tagging with Bounded ObjectsZahra Aghazadeh, Philipp Woelfel. 442-457 [doi]