PODC

Keyphrases

Publications

2023

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

2022