| 2023 | About Informatics, Distributed Computing, and Our Job: A Personal View. Michel Raynal |
| 2023 | Boundary Sketching with Asymptotically Optimal Distance and Rotation. Varsha Dani, Abir Islam, Jared Saia |
| 2023 | Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract). Yuichi Asahiro, Masafumi Yamashita |
| 2023 | Cops & Robber on Periodic Temporal Graphs: Characterization and Improved Bounds. Jean-Lou De Carufel, Paola Flocchini, Nicola Santoro, Frédéric Simard |
| 2023 | Degree Realization by Bipartite Multigraphs. Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz |
| 2023 | Distributed Coloring of Hypergraphs. Duncan Adamson, Magnús M. Halldórsson, Alexandre Nolin |
| 2023 | Distributed Half-Integral Matching and Beyond. Sameep Dahal, Jukka Suomela |
| 2023 | Divide & Scale: Formalization and Roadmap to Robust Sharding. Zeta Avarikioti, Antoine Desjardins, Lefteris Kokoris-Kogias, Roger Wattenhofer |
| 2023 | Energy-Efficient Distributed Algorithms for Synchronous Networks. Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2023 | Exact Distributed Sampling. Sriram V. Pemmaraju, Joshua Z. Sobel |
| 2023 | FnF-BFT: A BFT Protocol with Provable Performance Under Attack. Zeta Avarikioti, Lioba Heimbach, Roland Schmid, Laurent Vanbever, Roger Wattenhofer, Patrick Wintermeyer |
| 2023 | Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks with Feedback. Nancy A. Lynch, Frederik Mallmann-Trenn |
| 2023 | Lockless Blockchain Sharding with Multiversion Control. Ramesh Adhikari, Costas Busch |
| 2023 | Minimum Cost Flow in the CONGEST Model. Tijn de Vos |
| 2023 | On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. Pierre Fraigniaud, Maël Luce, Ioan Todinca |
| 2023 | Overcoming Probabilistic Faults in Disoriented Linear Search. Konstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis |
| 2023 | Packet Forwarding with Swaps. Cameron Matsui, Will Rosenbaum |
| 2023 | Routing Schemes for Hybrid Communication Networks. Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann |
| 2023 | Search and Rescue on the Line. Jared Coleman, Lorand Cheng, Bhaskar Krishnamachari |
| 2023 | Self-adjusting Linear Networks with Ladder Demand Graph. Vitaly Aksenov, Anton Paramonov, Iosif Salem, Stefan Schmid |
| 2023 | Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity. Luisa Gargano, Adele A. Rescigno |
| 2023 | Structural Information and Communication Complexity - 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023, Proceedings Sergio Rajsbaum, Alkida Balliu, Joshua J. Daymude, Dennis Olivetti |
| 2023 | The Communication Complexity of Functions with Large Outputs. Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin |
| 2023 | The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks. Yi-Jun Chang |
| 2023 | Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution. Pierluigi Crescenzi |
| 2023 | Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation. Stefan Schmid, Jakub Svoboda, Michelle Yeo |
| 2023 | Zero-Memory Graph Exploration with Unknown Inports. Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner |