Abstract is missing.
- CBTree: A Practical Concurrent Self-Adjusting Search TreeYehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan. 1-15 [doi]
- Efficient Fetch-and-IncrementFaith Ellen, Vijaya Ramachandran, Philipp Woelfel. 16-30 [doi]
- Show No Weakness: Sequentially Consistent Specifications of TSO LibrariesAlexey Gotsman, Madanlal Musuvathi, Hongseok Yang. 31-45 [doi]
- Collecting Information by Power-Aware Mobile AgentsJulian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès. 46-60 [doi]
- Memory Lower Bounds for Randomized Collaborative Search and Implications for BiologyOfer Feinerman, Amos Korman. 61-75 [doi]
- A Generalized Algorithm for Publish/Subscribe Overlay Design and Its Fast ImplementationChen Chen, Roman Vitenberg, Hans-Arno Jacobsen. 76-90 [doi]
- Bounded-Contention Coding for Wireless Networks in the High SNR RegimeKeren Censor Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard. 91-105 [doi]
- Distributed Backbone Structure for Algorithms in the SINR Model of Wireless NetworksTomasz Jurdzinski, Dariusz R. Kowalski. 106-120 [doi]
- Distributed Online and Stochastic Queuing on a Multiple Access ChannelMarcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski. 121-135 [doi]
- Fast Distributed Computation in Dynamic Networks via Random WalksAtish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan. 136-150 [doi]
- Dense Subgraphs on Dynamic NetworksAtish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan. 151-165 [doi]
- Lower Bounds on Information Dissemination in Dynamic NetworksBernhard Haeupler, Fabian Kuhn. 166-180 [doi]
- No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex CoverMika Göös, Jukka Suomela. 181-194 [doi]
- "Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract)Danny Dolev, Christoph Lenzen, Shir Peled. 195-209 [doi]
- Distributed 2-Approximation Algorithm for the Semi-matching ProblemAndrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak. 210-222 [doi]
- Bounds on Contention Management in Radio NetworksMohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, Calvin C. Newport. 223-237 [doi]
- Efficient Symmetry Breaking in Multi-Channel Radio NetworksSebastian Daum, Fabian Kuhn, Calvin C. Newport. 238-252 [doi]
- On Byzantine Broadcast in Loosely Connected NetworksAlexandre Maurer, Sébastien Tixeuil. 253-266 [doi]
- RMR-Efficient Randomized Abortable Mutual Exclusion - (Extended Abstract)Abhijeet Pareek, Philipp Woelfel. 267-281 [doi]
- Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex LocksPrasad Jayanti, Zhiyu Liu. 282-296 [doi]
- Pessimistic Software Lock-ElisionYehuda Afek, Alexander Matveev, Nir Shavit. 297-311 [doi]
- Asynchronous Pattern Formation by Anonymous Oblivious Mobile RobotsNao Fujinaga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita. 312-325 [doi]
- How to Gather Asynchronous Oblivious Robots on Anonymous RingsGianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra. 326-340 [doi]
- Position Discovery for a System of Bouncing RobotsJurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales Ponce, Eduardo Pacheco. 341-355 [doi]
- Counting-Based Impossibility Proofs for Renaming and Set AgreementHagit Attiya, Ami Paz. 356-370 [doi]
- Randomized Distributed DecisionPierre Fraigniaud, Amos Korman, Merav Parter, David Peleg. 371-385 [doi]
- The Strong At-Most-Once ProblemSotiris Kentros, Chadi Kari, Aggelos Kiayias. 386-400 [doi]
- Brief Announcement: Wait-Free Gathering of Mobile RobotsZohir Bouzid, Shantanu Das 0001, Sébastien Tixeuil. 401-402 [doi]
- Brief Announcement: Distributed Exclusive and Perpetual Tree SearchingLélia Blin, Janna Burman, Nicolas Nisse. 403-404 [doi]
- Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile NetworksChuanyou Li, Michel Hurfin, Yun Wang. 405-406 [doi]
- Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference ModelGuanhong Pei, Anil Kumar S. Vullikanti. 407-408 [doi]
- Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR ModelMaleq Khan, Gopal Pandurangan, Guanhong Pei, Anil Kumar S. Vullikanti. 409-410 [doi]
- Brief Announcement: Deterministic Protocol for the Membership Problem in Beeping ChannelsBojun Huang. 411-412 [doi]
- Brief Announcement: Probabilistic Stabilization under Probabilistic SchedulersYukiko Yamauchi, Sébastien Tixeuil, Shuji Kijima, Masafumi Yamashita. 413-414 [doi]
- Brief Announcement: An Analysis Framework for Distributed Hierarchical DirectoriesGokarna Sharma, Costas Busch. 415-416 [doi]
- Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree SequenceHervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud. 417-418 [doi]
- Brief Announcement: Node Sampling Using Centrifugal Random WalksAndrés Sevilla, Alberto Mozo, Antonio Fernández Anta. 419-420 [doi]
- Brief Announcement: Concurrent Wait-Free Red-Black TreesAravind Natarajan, Lee Savoie, Neeraj Mittal. 421-422 [doi]
- Brief Announcement: A Contention-Friendly, Non-blocking Skip ListTyler Crain, Vincent Gramoli, Michel Raynal. 423-424 [doi]
- Brief Announcement: Consensus and Efficient Passive ReplicationFlavio Junqueira, Marco Serafini. 425-426 [doi]
- Brief Announcement: Anonymity, Failures, Detectors and ConsensusZohir Bouzid, Corentin Travers. 427-428 [doi]
- Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology?Yvonne Anne Pignolet, Stefan Schmid, Gilles Trédan. 429-430 [doi]
- Brief Announcement: Efficient Private Distributed Computation on Unbounded Input StreamsShlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky. 431-432 [doi]
- Brief Announcement: Fast Travellers: Infrastructure-Independent Deadlock Resolution in Resource-restricted Distributed SystemsSebastian Ertel, Christof Fetzer, Michael J. Beckerle. 433-434 [doi]
- Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer SystemsSebastian Kniesburges, Christian Scheideler. 435-436 [doi]
- Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic NetworksOthon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis. 437-438 [doi]
- Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data StructuresStefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler, Zvi Lotker. 439-440 [doi]
- Brief Announcement: Semantics of Eventually Consistent Replicated SetsAnnette Bieniusa, Marek Zawirski, Nuno M. Preguiça, Marc Shapiro, Carlos Baquero, Valter Balegas, Sérgio Duarte. 441-442 [doi]
- Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant StorageEduardo Adílio Pelinson Alchieri, Alysson Neves Bessani, Fabíola Greve, Joni da Silva Fraga. 443-444 [doi]
- Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value StoresCosmin Arad, Tallat M. Shafaat, Seif Haridi. 445-446 [doi]
- Brief Announcement: Weighted Partial Message Matching for Implicit Multicast SystemsWilliam Culhane, K. R. Jayaram, Patrick Eugster. 447-448 [doi]