Table of Contents

• Amnesiac Flooding: Easy to Break, Hard to EscapeHenry Austin, Maximilien Gadouleau, George B. Mertzios, Amitabh Trehan. [doi]
• Strong Linearizability Without Compare&Swap: The Case of BagsFaith Ellen, Gal Sela 0001. [doi]
• Two for One, One for All: Deterministic LDC-Based Robust Computation in Congested CliqueKeren Censor Hillel, Orr Fischer, Ran Gelles, Pedro Soto 0001. [doi]
• Perpetual Exploration in Anonymous Synchronous Networks with a Byzantine Black HoleAdri Bhattacharya, Pritam Goswami, Evangelos Bampas, Partha Sarathi Mandal 0001. [doi]
• Energy-Efficient Maximal Independent Sets in Radio NetworksDominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, Gopal Pandurangan. [doi]
• Asynchronous Latency and Fast Atomic SnapshotJoão Paulo Bezerra, Luciano Freitas de Souza, Petr Kuznetsov, Matthieu Rambaud. [doi]
• Hierarchical Consensus: Scalability Through Optimism and Weak LivenessPedro Antonino, Antoine Durand, A. W. Roscoe 0001. [doi]
• On the Randomized Locality of Matching Problems in Regular GraphsSeri Khoury, Manish Purohit, Aaron Schild, Joshua R. Wang. [doi]
• Coordination Through Stochastic ChannelsPierre Fraigniaud, Boaz Patt-Shamir, Sergio Rajsbaum. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Complexity Landscape for Local CertificationNicolas Bousquet 0001, Laurent Feuilloley, Sébastien Zeitoun. [doi]
• ABEL: Perfect Asynchronous Byzantine Extension from List-DecodingIttai Abraham, Gilad Asharov. [doi]
• Distributed Download from an External Data Source in Byzantine Majority SettingsJohn Augustine 0001, Soumyottam Chatterjee, Valerie King, Manish Kumar 0014, Shachar Meir, David Peleg. [doi]
• Content-Oblivious Leader Election in 2-Edge-Connected NetworksJérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou. [doi]
• LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online AnalyticsMartin Hilgendorf, Marina Papatriantafilou. [doi]
• Robust Predicate and Function Computation in Continuous Chemical Reaction NetworksKim Calabrese, David Doty, Mina Latifi. [doi]
• Byzantine Consensus in the Random Asynchronous ModelGeorge Danezis, Jovan Komatovic, Lefteris Kokoris-Kogias, Alberto Sonnino, Igor Zablotchi. [doi]
• Brief Announcement: Asynchronous Approximate Agreement with Quadratic CommunicationMose Mizrahi Erbes, Roger Wattenhofer. [doi]
• Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction SelectionKrishnendu Chatterjee, Jan Matyás Kristan, Stefan Schmid 0001, Jakub Svoboda, Michelle Yeo. [doi]
• Brief Announcement: Congested Clique Counting for Local Gibbs DistributionsJoshua Z. Sobel. [doi]
• On the Shape Containment Problem Within the Amoebot Model with Reconfigurable CircuitsMatthias Artmann, Andreas Padalkin, Christian Scheideler. [doi]
• Validity in Network-Agnostic Byzantine AgreementAndrei Constantinescu 0001, Marc Dufay, Diana Ghinea, Roger Wattenhofer. [doi]
• Brief Announcement: Proximal Byzantine Agreement: Improved Accuracy for Fault-Tolerant Replicated DatastreamsRoy Shadmon, Owen Arden. [doi]
• Brief Announcement: Maintaining a Bounded Degree Expander in Dynamic Peer-To-Peer NetworksAntonio Cruciani. [doi]
• Brief Announcement: DAGs for the MassesMichael Anoprenko, Andrei Tonkikh, Alexander Spiegelman, Petr Kuznetsov. [doi]
• Brief Announcement: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal CommunicationAndrei Constantinescu 0001, Marc Dufay, Anton Paramonov, Roger Wattenhofer. [doi]
• Brief Announcement: Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse GraphsSalwa Faour, Fabian Kuhn. [doi]
• New Distributed Interactive Proofs for Planarity: A Matter of Left and RightYuval Gil, Merav Parter. [doi]
• Brief Announcement: Time, Fences and the Ordering of Events in TSORaïssa Nataf, Yoram Moses. [doi]
• pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus LayerOrestis Alpos, Bernardo David, Jakov Mitrovski, Odysseas Sofikitis, Dionysis Zindros. [doi]
• Deterministic Synchronous Self-Stabilizing BFS Construction with Constant Space ComplexityLélia Blin, Franck Petit, Sébastien Tixeuil. [doi]
• TEE Is Not a Healer: Rollback-Resistant Reliable StorageSadegh Keshavarzi, Gregory V. Chockler, Alexey Gotsman. [doi]
• Brief Announcement: Carry the Tail in Consensus ProtocolsSuyash Gupta 0001, Dakai Kang, Dahlia Malkhi, Mohammad Sadoghi. [doi]
• PIPQ: Strict Insert-Optimized Concurrent Priority QueueOlivia Grimes, Ahmed Hassan, Panagiota Fatourou, Roberto Palmieri. [doi]
• Model-Agnostic Approximation of Constrained Forest ProblemsCorinna Coupette, Alipasha Montaseri, Christoph Lenzen 0001. [doi]
• Brief Announcement: Communication Patterns for Optimal ResilienceHagit Attiya, Itay Flam, Jennifer L. Welch. [doi]
• Towards Constant Time Multi-Call Rumor Spreading on Small-Set ExpandersEmilio Cruciani, Sebastian Forster, Tijn de Vos. [doi]
• Distributed Computation with Local AdviceAlkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Krzysztof Nowicki 0002, Dennis Olivetti, Eva Rotenberg, Jukka Suomela. [doi]
• Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous RingsJérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou. [doi]
• Lower Bounds for k-Set Agreement in Fault-Prone NetworksPierre Fraigniaud, Minh-Hang Nguyen, Ami Paz, Ulrich Schmid 0001, Hugo Rincon Galeana. [doi]
• Weight Reduction in Distributed Protocols: New Algorithms and AnalysisAnatoliy Zinovyev. [doi]
• Brief Announcement: Weaker Assumptions for Asymmetric TrustChristian Cachin, Juan Villacis. [doi]
• Brief Announcement: Single-Round Broadcast: Impossibility, Feasibility, and MoreZhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, Kui Ren 0001. [doi]
• Compact Routing Schemes in Undirected and Directed GraphsAvi Kadria, Liam Roditty. [doi]
• Auditable Shared Objects: From Registers to Synchronization PrimitivesHagit Attiya, Antonio Fernández Anta, Alessia Milani, Alexandre Rapetti, Corentin Travers. [doi]
• New Limits on Distributed Quantum Advantage: Dequantizing Linear ProgramsAlkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco D'Amore 0001, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Jukka Suomela. [doi]
• Team Formation and ApplicationsYuval Emek, Shay Kutten, Ido Rafael, Gadi Taubenfeld. [doi]
• Towards Fully Automatic Distributed Lower BoundsAlkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti, Joonatan Saarhelo. [doi]
• An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value ContentionDan Alistarh, Faith Ellen, Alexander Fedorov. [doi]
• Natural Calamities Demand More Rescuers: Exploring Connectivity Time Dynamic GraphsAshish Saxena, Kaushik Mondal 0001. [doi]
• Brief Announcement: Universal Dancing by Luminous Robots Under Sequential SchedulersCaterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, Nicola Santoro. [doi]
• Brief Announcement: Concurrent Double-Ended Priority QueuesPanagiota Fatourou, Eric Ruppert, Ioannis Xiradakis. [doi]
• Brief Announcement: Incrementally Verifiable Distributed ComputationEden Aldema Tshuva, Rotem Oshman. [doi]
• Approach of Agents with Restricted Fuel TanksAdam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc, Grzegorz Stachowiak. [doi]
• Brief Announcement: The Virtue of Self-ConsistencyFabian Frei, Koichi Wada 0001. [doi]
• Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty SettingsJohn Augustine 0001, Soumyottam Chatterjee, Valerie King, Manish Kumar 0014, Shachar Meir, David Peleg. [doi]
• On the h-Majority Dynamics with Many OpinionsFrancesco D'Amore 0001, Niccolò D'Archivio, George Giakkoupis, Emanuele Natale. [doi]
• Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary DynamicsRida A. Bazzi, Anya Chaturvedi, Andréa W. Richa, Peter Vargas. [doi]
• Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio NetworksAdam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc. [doi]
• Brief Announcement: Highly Dynamic and Fully Distributed Data StructuresJohn Augustine 0001, Antonio Cruciani, Iqra Altaf Gillani. [doi]
• Brief Announcement: Distributed Sparsest Cut via Eigenvalue EstimationYannic Maus, Tijn de Vos. [doi]
• DAG It Off: Latency Prefers No Common CoinsIgnacio Amores-Sesar, Viktor Grøndal, Adam Holmgård, Mads Ottendal. [doi]
• The Complexity Landscape of Dynamic Distributed Subgraph FindingYi-Jun Chang, Lyuting Chen, Yanyu Chen 0002, Gopinath Mishra, Mingyang Yang. [doi]
• On the Efficiency of Dynamic Transaction Scheduling in Blockchain ShardingRamesh Adhikari, Costas Busch, Miroslav Popovic. [doi]
• Towards Optimal Distributed Edge Coloring with Fewer ColorsManuel Jakob, Yannic Maus, Florian Schager. [doi]
• Kudzu: Fast and Simple High-Throughput BFTVictor Shoup, Jakub Sliwinski, Yann Vonlanthen. [doi]
• Brief Announcement: Optimal Dispersion Under AsynchronyDebasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar 0014, Anisur Rahaman Molla, Gokarna Sharma. [doi]