Alcalá de Henares, Spain, June 5-9, 2023




Stefan Schmid, Jakub Svoboda and Michelle YeoWeighted. Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation

Cameron Matsui and Will Rosenbaum. Packet Forwarding with Swaps

Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro and Frederic. Simard Cops & Robber on Periodic Temporal Graphs : Characterization and Improved Bounds

Duncan Adamson, Magnús M. Halldórsson and Alexandre Nolin. Distributed Coloring of Hypergraphs

Pierre Fraigniaud, Maël Luce and Ioan Todinca. On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST model

Tijn de Vos. Minimum Cost Flow in the CONGEST Model

Luisa Gargano and Adele A. Rescigno. Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity

Zeta Avarikioti, Lefteris Kokoris-Kogias, Antoine Desjardins and Roger Wattenhofer. Divide & Scale: Formalization and Roadmap to Robust Sharding

Sriram Pemmaraju and Joshua Sobel. Exact Distributed Sampling

Zeta Avarikioti, Lioba Heimbach, Roland Schmid, Laurent Vanbever, Roger Wattenhofer and Patrick Wintermeyer. FnF-BFT: A BFT protocol with provable performance under attack

Abir Islam, Jared Saia and Varsha Dani. Boundary Sketching With Asymptotically Optimal Distance and Rotation

Konstantinos Georgiou, Nikolaos Giachoudis and Evangelos Kranakis. Overcoming Probabilistic Faults in Disoriented Linear Search

Yi-Jun Chang. The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-genus Networks

Ramesh Adhikari and Costas Busch. Lockless Blockchain Sharding with Multiversion Control

Jared Coleman, Lorand Cheng and Bhaskar Krishnamachari. Search and Rescue on the Line

Yuichi Asahiro and Masafumi Yamashita. Compatibility of convergence algorithms for autonomous mobile robots

Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport and Ioan Todinca. Energy-Efficient Distributed Algorithms for Synchronous Networks

Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger and David Wehner. Zero-Memory Graph Exploration with Unknown Inports

Lila Fontes, Mathieu Laurière, Sophie Laplante and Alexandre Nolin. The communication complexity of functions with large outputs

Vitaly Aksenov, Anton Paramonov, Iosif Salem and Stefan Schmid. Self-Adjusting Linear Networks with Ladder Demand Graph

Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider and Julian Werthmann. Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs

Sameep Dahal and Jukka Suomela. Distributed Half-Integral Matching and Beyond



Hotels have rooms blocked for a limited time.



Early registration deadline is April 30th, 2023.

Mikel Larrea
University of the Basque Country UPV/EHU
[log in to unmask]
Tel.: (+34) 943015084


[log in to unmask]

If you don't already have a password for the LISTSERV.ACM.ORG server, we recommend that you create one now. A LISTSERV password is linked to your email address and can be used to access the web interface and all the lists to which you are subscribed on the LISTSERV.ACM.ORG server.

To create a password, visit:


Once you have created a password, you can log in and view or change your subscription settings at: