| 2024 | Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens. | Keren Censor-Hillel, Yuka Machino, Pedro Soto |
| 2024 | On Distributed Computation of the Minimum Triangle Edge Transversal. | Keren Censor-Hillel, Majd Khoury |
| 2024 | In Search of the Lost Tree - Hardness and Relaxation of Spanning Trees in Temporal Graphs. | Arnaud Casteigts, Timothe Corsini |
| 2024 | Locally Balanced Allocations Under Strong Byzantine Influence. | Costas Busch, Pawel Garncarek, Dariusz R. Kowalski |
| 2024 | Stand-Up Indulgent Gathering on Rings. | Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sbastien Tixeuil |
| 2024 | Optimal Memory Requirement for Self-stabilizing Token Circulation. | Llia Blin, Gabriel Le Bouder, Franck Petit |
| 2024 | k-Center Clustering in Distributed Models. | Leyla Biabani, Ami Paz |
| 2024 | All You Need are Random Walks: Fast and Simple Distributed Conductance Testing. | Tugkan Batu, Amitabh Trehan, Chhaya Trehan |
| 2024 | Awake Complexity of Distributed Minimum Spanning Tree. | John Augustine, William K. Moses Jr., Gopal Pandurangan |
| 2024 | Sharding in Permissionless Systems in Presence of an Adaptive Adversary. | Emmanuelle Anceaume, Davide Frey, Arthur Rauch |
| 2024 | An Analysis of Avalanche Consensus. | Ignacio Amores-Sesar, Christian Cachin, Philipp Schneider |
| 2024 | Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs. | Erik van den Akker, Kevin Buchin, Klaus-Tycho Foerster |
| 2023 | Minimum Cost Flow in the CONGEST Model. | Tijn de Vos |
| 2023 | Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation. | Stefan Schmid, Jakub Svoboda, Michelle Yeo |
| 2023 | About Informatics, Distributed Computing, and Our Job: A Personal View. | Michel Raynal |
| 2023 | Exact Distributed Sampling. | Sriram V. Pemmaraju, Joshua Z. Sobel |
| 2023 | Packet Forwarding with Swaps. | Cameron Matsui, Will Rosenbaum |
| 2023 | Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks with Feedback. | Nancy A. Lynch, Frederik Mallmann-Trenn |
| 2023 | Overcoming Probabilistic Faults in Disoriented Linear Search. | Konstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis |
| 2023 | Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity. | Luisa Gargano, Adele A. Rescigno |
| 2023 | Energy-Efficient Distributed Algorithms for Synchronous Networks. | Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2023 | On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. | Pierre Fraigniaud, Mal Luce, Ioan Todinca |
| 2023 | The Communication Complexity of Functions with Large Outputs. | Lila Fontes, Sophie Laplante, Mathieu Laurire, Alexandre Nolin |
| 2023 | Boundary Sketching with Asymptotically Optimal Distance and Rotation. | Varsha Dani, Abir Islam, Jared Saia |
| 2023 | Distributed Half-Integral Matching and Beyond. | Sameep Dahal, Jukka Suomela |