| 2023 | (1- Shang-En Huang, Hsin-Hao Su |
| 2023 | A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States. Daisuke Yokota, Yuichi Sudo, Fukuhito Ooshita, Toshimitsu Masuzawa |
| 2023 | A Near-Optimal Deterministic Distributed Synchronizer. Mohsen Ghaffari, Anton Trygub |
| 2023 | A Wait-free Queue with Polylogarithmic Step Complexity. Hossein Naderibeni, Eric Ruppert |
| 2023 | Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. Armando Castañeda, Gilde Valeria Rodríguez |
| 2023 | BeeGees: Stayin' Alive in Chained BFT. Neil Giridharan, Florian Suri-Payer, Matthew Ding, Heidi Howard, Ittai Abraham, Natacha Crooks |
| 2023 | Brief Announcement: Breaking the Rida A. Bazzi, Sara Tucci Piergiovanni |
| 2023 | Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding. Viveck R. Cadambe, Shihang Lyu |
| 2023 | Brief Announcement: Discrete Incremental Voting. Colin Cooper, Tomasz Radzik, Takeharu Shiraga |
| 2023 | Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. Jinfeng Dou, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, Julian Werthmann |
| 2023 | Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. Romain Cosson, Laurent Massoulié, Laurent Viennot |
| 2023 | Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks. Giuseppe Antonio Di Luna, Giovanni Viglietta |
| 2023 | Brief Announcement: Efficient Recoverable Writable-CAS. Prasad Jayanti, Siddhartha Visveswara Jayanti, Sucharita Jayanti |
| 2023 | Brief Announcement: Improved Consensus in Quantum Networks. MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski |
| 2023 | Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds. Anh Tran, Edward Talmage |
| 2023 | Brief Announcement: Local Problems in the SUPPORTED Model. Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran |
| 2023 | Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model. Tijn de Vos |
| 2023 | Brief Announcement: Population Protocols Decide Double-exponential Thresholds. Philipp Czerner |
| 2023 | Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. Sebastian Forster, Tijn de Vos |
| 2023 | Brief Announcement: The MBroadcast Abstraction. Mathilde Déprés, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal |
| 2023 | Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? Peter Robinson |
| 2023 | Deterministic Fault-Tolerant Connectivity Labeling Scheme. Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa |
| 2023 | Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication. Bogdan S. Chlebus, Dariusz Rafal Kowalski, Jan Olkowski |
| 2023 | Distributed Averaging in Opinion Dynamics. Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik, Nicolas Rivera |
| 2023 | Distributed CONGEST Algorithms against Mobile Adversaries. Orr Fischer, Merav Parter |
| 2023 | Distributed MIS in O(log log n) Awake Complexity. Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan |
| 2023 | Distributed MIS with Low Energy and Time Complexities. Mohsen Ghaffari, Julian Portmann |
| 2023 | Distributed Self-Stabilizing MIS with Few States and Weak Communication. George Giakkoupis, Isabella Ziccardi |
| 2023 | Distributed Symmetry Breaking on Power Graphs via Sparsification. Yannic Maus, Saku Peltonen, Jara Uitto |
| 2023 | Efficient Bounded Timestamping from Standard Synchronization Primitives. Benyamin Bashari, Ali Jamadi, Philipp Woelfel |
| 2023 | Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications. Yi-Jun Chang |
| 2023 | Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model. Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, John Lazarsfeld |
| 2023 | From Distributed Algorithms to Machine Learning and Back. Roger Wattenhofer |
| 2023 | Improved Tradeoffs for Leader Election. Shay Kutten, Peter Robinson, Ming Ming Tan, Xianbin Zhu |
| 2023 | On the Amortized Communication Complexity of Byzantine Broadcast. Jun Wan, Atsuki Momose, Ling Ren, Elaine Shi, Zhuolun Xiang |
| 2023 | On the Validity of Consensus. Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira |
| 2023 | Optimal Eventual Byzantine Agreement Protocols with Omission Failures. Kaya Alpturer, Joseph Y. Halpern, Ron van der Meyden |
| 2023 | Optimal Message-Passing with Noisy Beeps. Peter Davies |
| 2023 | Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023 Rotem Oshman, Alexandre Nolin, Magnús M. Halldórsson, Alkida Balliu |
| 2023 | Sparse Semi-Oblivious Routing: Few Random Paths Suffice. Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe |
| 2023 | The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. Yi-Jun Chang, Zeyong Li |
| 2023 | The ERA Theorem for Safe Memory Reclamation. Gali Sheffi, Erez Petrank |
| 2023 | The Impact of Cooperation in Bilateral Network Creation. Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Arthur Zahn |
| 2023 | Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization. Peter Davies |
| 2023 | Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications. Myrto Arapinis, Ábel Kocsis, Nikolaos Lamprou, Liam Medley, Thomas Zacharias |
| 2023 | Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel |