Abstract is missing.
- New Opportunities for PODC?: Massive, Volatile, but Highly Predictable ResourcesAndrew A. Chien. 1 [doi]
- A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) RoundsReuven Bar-Yehuda, Keren Censor Hillel, Gregory Schwartzman. 3-8 [doi]
- The Greedy Spanner is Existentially OptimalArnold Filtser, Shay Solomon. 9-17 [doi]
- MST in Log-Star Rounds of Congested CliqueMohsen Ghaffari, Merav Parter. 19-28 [doi]
- Distributed Algorithms for Planar Networks I: Planar EmbeddingMohsen Ghaffari, Bernhard Haeupler. 29-38 [doi]
- Brief Announcement: Labeling Schemes for Power-Law GraphsCasper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen. 39-41 [doi]
- Brief Announcement: Sublinear-Space Distance Labeling Using HubsPawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski. 43-45 [doi]
- Brief Announcement: Optimal Leader Election in Multi-Hop Radio NetworksArtur Czumaj, Peter Davies. 47-49 [doi]
- Brief Announcement: The Small World of Curious BeingsSoroush Alamdari. 51-53 [doi]
- Analysing Snapshot IsolationAndrea Cerone, Alexey Gotsman. 55-64 [doi]
- Recoverable Mutual Exclusion: [Extended Abstract]Wojciech M. Golab, Aditya Ramaraju. 65-74 [doi]
- A Randomized Concurrent Algorithm for Disjoint Set UnionSiddhartha V. Jayanti, Robert E. Tarjan. 75-82 [doi]
- Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Christopher Wastell. 83-92 [doi]
- Brief Announcement: Local Independent Set ApproximationMarijke H. L. Bodlaender, Magnús M. Halldórsson, Christian Konrad, Fabian Kuhn. 93-95 [doi]
- Deterministic Objects: Life Beyond ConsensusYehuda Afek, Faith Ellen, Eli Gafni. 97-106 [doi]
- Unbeatable Set Consensus via Topological and Combinatorial ReasoningArmando Castañeda, Yannai A. Gonczarowski, Yoram Moses. 107-116 [doi]
- A Polylogarithmic Gossip Algorithm for Plurality ConsensusMohsen Ghaffari, Merav Parter. 117-126 [doi]
- Noisy Rumor Spreading and Plurality ConsensusPierre Fraigniaud, Emanuele Natale. 127-136 [doi]
- Rational Consensus: Extended AbstractJoseph Y. Halpern, Xavier Vilaça. 137-146 [doi]
- Brief Announcement: A Tight Space Bound for ConsensusLeqi Zhu. 147-149 [doi]
- Concurrent Data StructuresFaith Ellen, Trevor Brown 0001. 151-153 [doi]
- Contention Resolution on a Fading ChannelJeremy T. Fineman, Seth Gilbert, Fabian Kuhn, Calvin C. Newport. 155-164 [doi]
- Reliable Communication over Highly Connected Noisy NetworksNoga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler. 165-173 [doi]
- Contention Resolution on Multiple Channels with Collision DetectionJeremy T. Fineman, Calvin Newport, Tonghe Wang. 175-184 [doi]
- How Asynchrony Affects Rumor Spreading TimeGeorge Giakkoupis, Yasamin Nazari, Philipp Woelfel. 185-194 [doi]
- Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL ModelYi-Jun Chang, Tsvi Kopelowitz, Seth Pettie. 195-197 [doi]
- Brief Announcement: Data Dissemination in Unified Dynamic Wireless NetworksMagnús M. Halldórsson, Tigran Tonoyan, Yuexuan Wang, Dongxiao Yu. 199-201 [doi]
- Brief Announcement: Reliable Message Transmission under Partial Knowledge and General AdversariesAris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas. 203-205 [doi]
- Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit MessagesLucas Boczkowski, Amos Korman, Emanuele Natale. 207-209 [doi]
- Distributed Strong Diameter Network Decomposition: Extended AbstractMichael Elkin, Ofer Neiman. 211-216 [doi]
- Optimal Dynamic Distributed MISKeren Censor Hillel, Elad Haramaty, Zohar S. Karnin. 217-226 [doi]
- A Local Constant Factor MDS Approximation for Bounded Genus GraphsSaeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz. 227-233 [doi]
- On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended AbstractMichael Elkin, Ofer Neiman. 235-244 [doi]
- Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested CliquePedro Montealegre, Ioan Todinca. 245-247 [doi]
- Space Bounds for Reliable Storage: Fundamental Limits of CodingAlexander Spiegelman, Yuval Cassuto, Gregory V. Chockler, Idit Keidar. 249-258 [doi]
- Specification and Complexity of Collaborative Text EditingHagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski. 259-268 [doi]
- Optimal Mobile Byzantine Fault Tolerant Distributed Storage: Extended AbstractSilvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil. 269-278 [doi]
- A Markov Chain Algorithm for Compression in Self-Organizing Particle SystemsSarah Cannon, Joshua J. Daymude, Dana Randall, Andréa W. Richa. 279-288 [doi]
- A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu. 289-298 [doi]
- Brief Announcement: Asynchronous Coordination with Constraints and PreferencesArmando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy. 299-301 [doi]
- How Emerging Memory Technologies Will Have You Rethinking Algorithm DesignPhillip B. Gibbons. 303 [doi]
- Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory EmulationViveck R. Cadambe, Zhiying Wang, Nancy A. Lynch. 305-313 [doi]
- On the Complexity of Reader-Writer Locks: Extended AbstractDanny Hendler. 315-324 [doi]
- An Algorithm for Replicated Objects with Efficient ReadsTushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg. 325-334 [doi]
- Are Shared Objects Composable under an Oblivious Adversary?Oksana Denysyuk, Philipp Woelfel. 335-344 [doi]
- Brief Announcement: A Family of Leaderless Generalized-Consensus AlgorithmsGiuliano Losa, Sebastiano Peluso, Binoy Ravindran. 345-347 [doi]
- Brief Announcement: Computing in the Presence of Weak Crash FailuresGadi Taubenfeld. 349-351 [doi]
- Brief Announcement: Oh-RAM! One and a Half Round Read/Write Atomic MemoryTheophanis Hadjistasi, Nicolas C. Nicolaou, Alexander A. Schwarzmann. 353-355 [doi]
- Brief Announcement: Space-Time Tradeoffs for Distributed VerificationMor Baruch, Rafail Ostrovsky, Will Rosenbaum. 357-359 [doi]
- A Faster Distributed Radio Broadcast Primitive: Extended AbstractBernhard Haeupler, David Wajc. 361-370 [doi]
- Broadcast Extensions with Optimal Communication and Round ComplexityChaya Ganesh, Arpita Patra. 371-380 [doi]
- Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone SystemsAchour Mostéfaoui, Michel Raynal. 381-389 [doi]
- How Proofs are Prepared at Camelot: Extended AbstractAndreas Björklund, Petteri Kaski. 391-400 [doi]
- Brief Announcement: Proactive Secret Sharing with a Dishonest MajorityShlomi Dolev, Karim Eldefrawy, Joshua Lampkins, Rafail Ostrovsky, Moti Yung. 401-403 [doi]
- Search on a Line with Faulty RobotsJurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny. 405-414 [doi]
- Uniform Deployment of Mobile Agents in Asynchronous RingsMasahiro Shibata, Toshiya Mega, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa. 415-424 [doi]
- Fault-Tolerant Multi-Agent Optimization: Optimal Iterative Distributed AlgorithmsLili Su, Nitin H. Vaidya. 425-434 [doi]
- Brief Announcement: Active Information Spread in NetworksGennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro. 435-437 [doi]
- 2 for Oblivious Mobile RobotsPierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain. 439-441 [doi]
- Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern FormationQuentin Bramas, Sébastien Tixeuil. 443-445 [doi]
- Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean SpaceYukiko Yamauchi, Taichi Uehara, Masafumi Yamashita. 447-449 [doi]
- Low-Congestion Shortcuts without EmbeddingBernhard Haeupler, Taisuke Izumi, Goran Zuzic. 451-460 [doi]
- The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic ProcessColin Cooper, Tomasz Radzik, Nicolas Rivera. 461-467 [doi]
- Ant-Inspired Density Estimation via Random Walks: Extended AbstractCameron Musco, Hsin-Hao Su, Nancy A. Lynch. 469-478 [doi]
- Brief Announcement: Multi-Broadcasting under the SINR ModelSai Praneeth Reddy, Shailesh Vaya. 479-481 [doi]
- Brief Announcement: Using Read-k Inequalities to Analyze a Distributed MIS AlgorithmSriram V. Pemmaraju, Talal Riaz. 483-485 [doi]
- Brief Announcement: A Key-Value Map for Massive Real-Time AnalyticsDmitry Basin, Edward Bortnikov, Anastasia Braginsky, Guy Golan-Gueta, Eshcar Hillel, Idit Keidar, Moshe Sulamy. 487-489 [doi]