Regular Papers

• New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
  Yuval Gil and Merav Parter
  
• Robust predicate and function computation in continuous chemical reaction networks
  Kim Calabrese, David Doty, and Mina Latifi
  
• Byzantine Consensus in the Random Asynchronous Model
  George Danezis, Jovan Komatovic, Lefteris Kokoris-Kogias, Alberto Sonnino, and Igor Zablotchi
  
• Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection
  Krishnendu Chatterjee, Jan Matyáš Křišťan, Stefan Schmid, Jakub Svoboda, and Michelle Yeo
  
• pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer
  Orestis Alpos, Bernardo David, Jakov Mitrovski, Odysseas Sofikitis, and Dionysis Zindros
  
• PIPQ: Strict Insert-Optimized Concurrent Priority Queue
  Olivia Grimes, Ahmed Hassan, Panagiota Fatourou, and Roberto Palmieri
  
• Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
  Emilio Cruciani, Sebastian Forster, and Tijn de Vos
  
• On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits
  Matthias Artmann, Andreas Padalkin, and Christian Scheideler
  
• Natural Calamities Demand More Rescuers: Exploring Connectivity Time Dynamic Graphs
  Ashish Saxena and Kaushik Mondal
  
• Compact routing schemes in undirected and directed graphs
  Avi Kadria and Liam Roditty
  
• On the Efficiency of Dynamic Transaction Scheduling in Blockchain Sharding
  Ramesh Adhikari, Costas Busch, and Miroslav Popovic
  
• The Complexity Landscape of Dynamic Distributed Subgraph Finding
  Yi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, and Mingyang Yang
  
• Towards Fully Automatic Distributed Lower Bounds
  Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, and Joonatan Saarhelo
  
• Towards Optimal Distributed Edge Coloring with Fewer Colors
  Manuel Jakob, Yannic Maus, and Florian Schager
  
• Team Formation and Applications
  Yuval Emek, Shay Kutten, Ido Rafael, and Gadi Taubenfeld
  
• DAG it off: Latency Prefers No Common Coins
  Ignacio Amores-Sesar, Viktor Grøndal, Adam Holmgård, and Mads Ottendal
  
• Amnesiac Flooding: Easy to Break, Hard to Escape
  Henry Austin, Maximillien Gadouleau, George B. Mertzios, and Amitabh Trehan
  
• TEE is not a Healer: Rollback-Resistant Reliable Storage
  Sadegh Keshavarzi and Gregory Chockler and Alexey Gotsman
  
• Model-Agnostic Approximation of Constrained Forest Problems
  Corinna Coupette, Alipasha Montaseri, and Christoph Lenzen
  
• Distributed Computation with Local Advice
  Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, and Jukka Suomela
  
• Energy-Efficient Maximal Independent Sets in Radio Networks
  Dominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, and Gopal Pandurangan
  
• Strong Linearizability without Compare&Swap: The Case of Bags
  Faith Ellen and Gal Sela
  
• On the h-Majority Dynamics with Many Opinions
  Francesco d’Amore, Niccolò D’Archivio, George Giakkoupis, and Emanuele Natale
  
• On the Randomized Locality of Matching Problems in Regular Graphs
  Seri Khoury, Manish Purohit, Aaron Schild, and Joshua R. Wang
  
• An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention
  Dan Alistarh, Faith Ellen, and Alexander Fedorov
  
• Complexity landscape for local certification
  Nicolas Bousquet, Laurent Feuilloley, and Sébastien Zeitoun
  
• New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
  Alkida Balliu, Corinna Coupette, Antonio Cruciani, Francesco d’Amore, Massimo Equi, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, and Jukka Suomela
  
• Approach of Agents with Restricted Fuel Tanks
  Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc, and Grzegorz Stachowiak
  
• Validity in Network-Agnostic Byzantine Agreement
  Andrei Constantinescu, Marc Dufay, Diana Ghinea, and Roger Wattenhofer
  
• Auditable Shared Objects: From Registers to Synchronization Primitives
  Hagit Attiya, Antonio Fernández Anta, Alessia Milani, Alexandre Rapetti, and Corentin Travers
  
• Weight reduction in distributed protocols: new algorithms and analysis
  Anatoliy Zinovyev
  
• Distributed Download from an External Data Source in Byzantine Majority Settings
  John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, and David Peleg
  
• Hierarchical Consensus: Scalability through Optimism and Weak Liveness
  Pedro Antonino, Antoine Durand, and A. W. Roscoe
  
• Asynchronous Latency and Fast Atomic Snapshot
  João Paulo Bezerra, Luciano Freitas, and Petr Kuznetsov
  
• Perpetual exploration in anonymous synchronous networks with a Byzantine black hole
  Adri Bhattacharya, Pritam Goswami, Evangelos Bampas, and Partha Sarathi Mandal
  
• Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
  Keren Censor-Hillel, Orr Fischer, Ran Gelles, and Pedro Soto
  
• Lower Bounds for k-Set Agreement in Fault-Prone Networks
  Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz, Ulrich Schmid, and Hugo Rincon-Galeana
  
• Kudzu: Fast and Simple High-Throughput BFT
  Victor Shoup, Jakub Sliwinski, and Yann Vonlanthen
  
• LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics
  Martin Hilgendorf and Marina Papatriantafilou
  
• Coordination Through Stochastic Channels
  Pierre Fraigniaud, Boaz Patt-Shamir, and Sergio Rajsbaum
  
• ABEL: Perfect Asynchronous Byzantine Extension from List-Decoding
  Ittai Abraham and Gilad Asharov
  
• Deterministic Synchronous Self-Stabilizing BFS Construction with Constant Space Complexity
  Lélia Blin, Franck Petit, and Sébastien Tixeuil
  
• Content-Oblivious Leader Election in 2-Edge-Connected Networks
  Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, and Haoran Zhou

Brief Announcements

• Brief Announcement: Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks
  Antonio Cruciani
  
• Brief Announcement: Weaker Assumptions for Asymmetric Trust
  Christian Cachin and Juan Villacis
  
• Brief Announcement: Universal Dancing by Luminous Robots under Sequential Schedulers
  Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, and Nicola Santoro
  
• Brief Announcement: The Virtue of Self-Consistency
  Fabian Frei and Koichi Wada
  
• Brief Announcement: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication
  Andrei Constantinescu, Marc Dufay, Anton Paramonov, and Roger Wattenhofer
  
• Brief Announcement: Highly Dynamic and Fully Distributed Data Structures
  John Augustine, Antonio Cruciani, and Iqra Altaf Gillani
  
• Brief Announcement: Distributed Sparsest Cut via Eigenvalue Estimation
  Yannic Maus and Tijn de Vos
  
• Brief Announcement: Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
  Salwa Faour and Fabian Kuhn
  
• Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings
  John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, and David Peleg
  
• Brief Announcement: Incrementally Verifiable Distributed Computation
  Eden Aldema Tshuva and Rotem Oshman
  
• Brief Announcement: Carry the Tail in Consensus Protocols
  Suyash Gupta, Dakai Kang, Dahlia Malkhi, and Mohammad Sadoghi
  
• Brief Announcement: Asynchronous Approximate Agreement with Quadratic Communication
  Mose Mizrahi Erbes and Roger Wattenhofer
  
• Brief Announcement: Congested Clique Counting for Local Gibbs Distributions
  Joshua Z. Sobel
  
• Brief Announcement: Proximal Byzantine Agreement: Improved accuracy for fault-tolerant replicated datastreams
  Roy Shadmon and Owen Arden
  
• Brief Announcement: DAGs for the Masses
  Michael Anoprenko, Andrei Tonkikh, Alexander Spiegelman, and Petr Kuznetsov
  
• Brief Announcement: Concurrent Double-Ended Priority Queues
  Panagiota Fatourou, Eric Ruppert, and Ioannis Xiradakis
  
• Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics
  Rida Bazzi, Anya Chaturvedi, Andréa W. Richa, and Peter Vargas
  
• Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks
  Adam Ganczorz, Tomasz Jurdzinski, and Andrzej Pelc
  
• Brief Announcement: Single-Round Broadcast: Impossibility, Feasibility, and More
  Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, and Kui Ren
  
• Brief Announcement: Optimal Dispersion Under Asynchrony
  Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, and Gokarna Sharma
  
• Brief Announcement: Communication Patterns for Optimal Resilience
  Hagit Attiya, Itay Flam, and Jennifer L. Welch
  
• Brief Annoucement: Time, Fences and the Ordering of Events in TSO
  Raïssa Nataf and Yoram Moses
  
• Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
  Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna, and Haoran Zhou