Table of Contents

• An Adaptive Approach to Recoverable Mutual ExclusionSahil Dhoked, Neeraj Mittal. 1-10 [doi]
• Upper and Lower Bounds on the Space Complexity of Detectable ObjectsOhad Ben-Baruch, Danny Hendler, Matan Rusanovsky. 11-20 [doi]
• Extending the Wait-free Hierarchy to Multi-Threaded SystemsMatthieu Perrin, Achour Mostéfaoui, Grégoire Bonin. 21-30 [doi]
• Long-Lived Snapshots with Polylogarithmic Amortized Step ComplexityMirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers. 31-40 [doi]
• From Bezout's Identity to Space-Optimal Election in Anonymous Memory SystemsEmmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld. 41-50 [doi]
• Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice AgreementHagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch. 51-53 [doi]
• Brief Announcement: Why Extension-Based Proofs FailDan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu. 54-56 [doi]
• Brief Announcement: The Only Undoable CRDTs are CountersStephen Dolan. 57-58 [doi]
• Exponentially Faster Shortest Paths in the Congested CliqueMichal Dory, Merav Parter. 59-68 [doi]
• Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and VariantsSebastian Brandt 0002, Dennis Olivetti. 69-78 [doi]
• Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent SetsSepehr Assadi, Gillat Kol, Rotem Oshman. 79-88 [doi]
• Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph ProblemsWill Rosenbaum, Jukka Suomela. 89-98 [doi]
• O(1)-rounds Node-averaged Awake ComplexitySoumyottam Chatterjee, Robert Gmyr, Gopal Pandurangan. 99-108 [doi]
• Computing Shortest Paths and Diameter in the Hybrid Network ModelFabian Kuhn, Philipp Schneider. 109-118 [doi]
• Massively Parallel Algorithms for Minimum CutMohsen Ghaffari, Krzysztof Nowicki 0002. 119-128 [doi]
• Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, RevisitedYuan Lu, Zhenliang Lu, Qiang Tang 0005, Guiling Wang. 129-138 [doi]
• Revisiting Asynchronous Fault Tolerant Computation with Optimal ResilienceIttai Abraham, Danny Dolev, Gilad Stern. 139-148 [doi]
• Asynchronous Byzantine Approximate Consensus in Directed NetworksDimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya. 149-158 [doi]
• On the Subject of Non-Equivocation: Defining Non-Equivocation in Synchronous Agreement SystemsMads Frederik Madsen, Søren Debois. 159-168 [doi]
• Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running TimeAshish Choudhury. 169-171 [doi]
• Brief Announcement: On the Significance of Consecutive Ballots in PaxosEli Goldweber, Nuda Zhang, Manos Kapritsos. 172-174 [doi]
• Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHPShir Cohen, Idit Keidar, Alexander Spiegelman. 175-177 [doi]
• Brief Announcement: Byzantine Agreement with Unknown Participants and FailuresPankaj Khanchandani, Roger Wattenhofer. 178-180 [doi]
• Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard PrimitivesDavid Yu Cheng Chan, Philipp Woelfel. 181-190 [doi]
• n) StatesStav Ben Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat. 191-199 [doi]
• Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic RegistersKaile Huang, Yu Huang 0002, Hengfeng Wei. 200-209 [doi]
• Self-Stabilizing Leader Election in Regular GraphsHsueh-Ping Chen, Ho-Lin Chen. 210-217 [doi]
• Brief Announcement: Optimal Time and Space Leader Election in Population ProtocolsPetra Berenbrink, George Giakkoupis, Peter Kling. 218-220 [doi]
• Brief Announcement: Intermediate Value Linearizability: A Quantitative Correctness CriterionArik Rinberg, Idit Keidar. 221-223 [doi]
• Brief Announcement: On Implementing Software Transactional Memory in the C++ Memory ModelMatthew Rodriguez, Michael Spear. 224-226 [doi]
• Brief Announcement: Self-stabilizing Systems in Spite of High DynamicsKarine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit. 227-229 [doi]
• Brief Announcement: Hazard Pointer Protection of Structures with Immutable LinksMaged M. Michael. 230-232 [doi]
• Distance-2 Coloring in the CONGEST ModelMagnús M. Halldórsson, Fabian Kuhn, Yannic Maus. 233-242 [doi]
• Efficient Deterministic Distributed Coloring with Small BandwidthPhilipp Bamberger, Fabian Kuhn, Yannic Maus. 243-252 [doi]
• Want to Gather? No Need to Chatter!Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc. 253-262 [doi]
• Tight Analysis of Asynchronous Rumor Spreading in Dynamic NetworksAli Pourmiri, Bernard Mans. 263-272 [doi]
• The Energy Complexity of BFS in Radio NetworksYi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie. 273-282 [doi]
• Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent SetKen-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman. 283-285 [doi]
• Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio NetworksHaimin Chen, Chaodong Zheng. 286-288 [doi]
• Distributed Edge Coloring in Time Quasi-Polylogarithmic in DeltaAlkida Balliu, Fabian Kuhn, Dennis Olivetti. 289-298 [doi]
• How much does randomness help with locally checkable problems?Alkida Balliu, Sebastian Brandt 0002, Dennis Olivetti, Jukka Suomela. 299-308 [doi]
• Simple, Deterministic, Constant-Round Coloring in the Congested CliqueArtur Czumaj, Peter Davies, Merav Parter. 309-318 [doi]
• Compact Distributed Certification of Planar GraphsLaurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca. 319-328 [doi]
• Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local LemmaSebastian Brandt 0002, Christoph Grunau, Václav Rozhon. 329-338 [doi]
• Multiple Source Replacement Path ProblemManoj Gupta, Rahul Jain, Nitiksha Modi. 339-348 [doi]
• Brief Announcement: Classification of Distributed Binary Labeling ProblemsAlkida Balliu, Sebastian Brandt 0002, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela. 349-351 [doi]
• Brief Announcement: Round eliminator: a tool for automatic speedup simulationDennis Olivetti. 352-354 [doi]
• Genuinely Distributed Byzantine Machine LearningEl Mahdi El Mhamdi, Rachid Guerraoui, Arsany Guirguis, Lê Nguyên Hoang, Sébastien Rouault. 355-364 [doi]
• Fault-Tolerance in Distributed Optimization: The Case of RedundancyNirupam Gupta, Nitin H. Vaidya. 365-374 [doi]
• Probably Approximately KnowingYoram Moses, Nitzan Zamir. 375-384 [doi]
• Positive Aging Admits Fast Asynchronous Plurality ConsensusGregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc. 385-394 [doi]
• K-set agreement bounds in round-based models through combinatorial topologyAdam Shimi, Armando Castañeda. 395-404 [doi]
• Brief Announcement: On Using Null Messages in a Byzantine SettingGuy Goren, Yoram Moses. 405-407 [doi]
• Can Uncoordinated Beeps tell Stories?Fabien Dufoulon, Janna Burman, Joffroy Beauquier. 408-417 [doi]
• Noisy BeepsKlim Efremenko, Gillat Kol, Raghuvansh R. Saxena. 418-427 [doi]
• Perigee: Efficient Peer-to-Peer Network Design for BlockchainsYifan Mao, Soubhik Deb, Shaileshh Bojja Venkatakrishnan, Sreeram Kannan, Kannan Srinivasan. 428-437 [doi]
• DConstructor: Efficient and Robust Network Construction with Polylogarithmic OverheadSeth Gilbert, Gopal Pandurangan, Peter Robinson 0002, Amitabh Trehan. 438-447 [doi]
• Distributed Computation and Reconfiguration in Actively Dynamic NetworksOthon Michail, George Skretas, Paul G. Spirakis. 448-457 [doi]
• Brief Announcement: Noisy Beeping NetworksYagel Ashkenazi, Ran Gelles, Amir Leshem. 458-460 [doi]
• Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph PartitioningMaciej Pacut, Mahmoud Parham, Stefan Schmid 0001. 461-463 [doi]
• Single-Source Shortest Paths in the CONGEST Model with Improved BoundShiri Chechik, Doron Mukhtar. 464-473 [doi]
• On Distributed Listing of CliquesKeren Censor Hillel, François Le Gall, Dean Leitersdorf. 474-482 [doi]
• Distributed Construction of Light NetworksMichael Elkin, Arnold Filtser, Ofer Neiman. 483-492 [doi]
• Efficient and Simple Algorithms for Fault-Tolerant SpannersMichael Dinitz, Caleb Robelle. 493-500 [doi]
• Distributed Approximation on Power GraphsReuven Bar-Yehuda, Keren Censor Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju. 501-510 [doi]
• Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGESTYuval Efron, Ofer Grossman, Seri Khoury. 511-520 [doi]