| 2025 | A Visibility vs. Memory Trade-Off for Stand-Up Indulgent Gathering on Lines. Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil |
| 2025 | Approximating Independent Sets in Constant Distributed Rounds. Ravi B. Boppana, Magnús M. Halldórsson |
| 2025 | Asynchronous Byzantine Consensus with Trusted Monotonic Counters. Yackolley Amoussou-Guenou, Maurice Herlihy, Maria Potop-Butucaru |
| 2025 | Bankrupting DoS Attackers. Trisha Chakraborty, Abir Islam, Valerie King, Daniel Rayborn, Jared Saia, Maxwell Young |
| 2025 | Brief Announcement: A Sheaf-Theoretic Characterization of Tasks in Distributed Systems. Stephan Felber, Bernardo Hummes Flores, Hugo Rincon Galeana |
| 2025 | Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model. Yuki Kawashima, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa |
| 2025 | Brief Announcement: Perfect Matching with Few Link Activations. Hugo Mirault, Peter Robinson, Ming Ming Tan, Xianbin Zhu |
| 2025 | Brief Announcement: Relaxation for Efficient Asynchronous Queues. Samuel Baldwin, Cole Hausman, Mohamed Bakr, Edward Talmage |
| 2025 | Deterministic Color-Optimal Self-stabilizing Semi-synchronous Gathering: A Certified Algorithm. François Bonnet, Quentin Bramas, Pierre Courtieu, Xavier Défago, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain |
| 2025 | Distributed Distance Sensitivity Oracles. Vignesh Manoharan, Vijaya Ramachandran |
| 2025 | Explicit Token-Based Communication for Mobile Entities. Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro |
| 2025 | Exploration of Convex Terrains by a Deterministic Automaton with Pebbles. Mohamed Anouar Baaziz, Andrzej Pelc |
| 2025 | Labeling Embeddings of Planar Graphs for Face-Adjacency. Borna Simic, Roger Wattenhofer |
| 2025 | Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi |
| 2025 | Low-Distortion Clustering in Bounded Growth Graphs. Yi-Jun Chang, Varsha Dani, Thomas P. Hayes |
| 2025 | Lower Bounds for Uniform Read-Once Threshold Formulae in the Randomized Decision Tree Model. Nikos Leonardos |
| 2025 | Multi-agent Disk Inspection. James Conley, Konstantinos Georgiou |
| 2025 | Multimodal Search on a Line. Jared Coleman, Dmitry Ivanov, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce |
| 2025 | Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation. Paola Flocchini, Alfredo Navarra, Debasish Pattanayak, Francesco Piselli, Nicola Santoro |
| 2025 | On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies. Raphael Gerlach, Sören von der Gracht, Michael Dellnitz |
| 2025 | On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement. Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum |
| 2025 | Pointer Chasing with Unlimited Interaction. Orr Fischer, Rotem Oshman, Adi Rosén, Tal Roth |
| 2025 | Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-Offs. Toni Böhnlein, Pál András Papp, Albert-Jan Nicholas Yzelman |
| 2025 | Self-stabilizing Graph Exploration by a Single Agent. Yuichi Sudo, Fukuhito Ooshita, Sayaka Kamei |
| 2025 | Simplicial Belief. Christian Cachin, David Lehnherr, Thomas Studer |
| 2025 | Structural Information and Communication Complexity - 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2-4, 2025, Proceedings Ulrich Schmid, Roman Kuznets |
| 2025 | Sublinear-Time Collision Detection with a Polynomial Number of States in Population Protocols. Takumi Araya, Yuichi Sudo |
| 2025 | Support + Belief = Decision Trust. Alessandro Aldini, Agata Ciabattoni, Dominik Pichler, Mirko Tagliaferri |
| 2025 | When MIS and Maximal Matching are Easy in the Congested Clique. Keren Censor-Hillel, Tomer Even, Maxime Flin, Magnús M. Halldórsson |