High-Level Overview
Saturday, June 17th
- 9:00 – 12:30: Tutorial: High-Level Executable Specification and Reasoning for Improving Distributed Algorithms
Monday, June 19th
- Workshop: Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (ApPLIED)
- 9:00 – 11:00: Tutorial: Fault-Tolerant Distributed Optimization and Learning
- 11:20 – 12:30 FCRC Plenary Session
Kunle Olukotun: Computing in the Foundation Model Era
Tuesday, June 20th
| 8:50 – 9:55 | PODC Keynote Session Roger Wattenhofer: From Distributed Algorithms to Machine Learning and Back |
| 9:55 – 10:55 | Session: Dynamics |
| Break | |
| 11:20 – 12:30 | FCRC Plenary Session Margaret Martonosi: Taking on the World’s Challenges: The Role of Computing Research and Innovation |
| Lunch break | |
| 14:00 – 15:30 | Session: Distributed approximation |
| Break | |
| 16:15 – 17:15 | Plenary panel discussion |
| 17:30 – 19:30 | Business Meeting |
Wednesday, June 21st
| 8:50 – 10:55 | Session: Data structures |
| Break | |
| 11:20 – 12:30 | FCRC Plenary Session Shafi Goldwasser: Constructing and Deconstructing Trust: Employing Cryptographic Recipe in the ML Domain |
| Lunch break | |
| 14:00 – 15:30 | Session: Symmetry breaking |
| Break | |
| 16:00 – 18:05 | Session: Networks |
| Break | |
| 19:00 – 22:00 | Banquet |
Thursday, June 22nd
| 8:50 – 10:50 | Session: Byzantine agreement |
| Break | |
| 11:20 – 12:30 | FCRC Plenary Session Don Towsley: The Quantum Internet: Recent Advantages and Challenges |
| Lunch break | |
| 14:00 – 15:40 | Session: Wireless |
| Break | |
| 16:00 – 17:30 | Session: Complexity/impossibility |
Friday, June 23rd
- 11:20 – 12:30: FCRC Plenary Session
Torsten Hoefler: Scalable and Efficient AI: From Supercomputers to Smartphones - Workshop: BDA
- 14:00 – 17:00: Tutorial: Cryptography in Distributed Protocols
- 9:00 – 11:00: Tutorial: Distributed computing with live streaming data
Detailed schedule
Saturday, June 17th
9:00 – 12:30: Tutorial (in conjunction with PLDI)
Y. Annie Liu, Scott Stoller: High-Level Executable Specification and Reasoning for Improving Distributed Algorithms
Monday, June 19th
11:20 – 12:30: FCRC Plenary Session
Kunle Olukotun: Computing in the Foundation Model Era
Workshop: ApPLIED
9:00 – 11:00: Tutorial
Lili Su and Nitin H. Vaidya: Fault-Tolerant Distributed Optimization and Learning
Tuesday, June 20th
8:50 – 9:55: PODC Keynote Session
Chair: Magnús M. Halldórsson
Roger Wattenhofer: From Distributed Algorithms to Machine Learning and Back
9:55 – 10:55: Session: Dynamics
Chair: George Giakkoupis
| 9:55 – 10:20 | 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 and Toshimitsu Masuzawa. |
| 10:20 – 10:45 | 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 and John Lazarsfeld. |
| 10:45 – 10:50 | Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. Romain Cosson, Laurent Massoulie and Laurent Viennot. |
| 10:50 – 10:55 | Brief Announcement: Population Protocols Decide Double-exponential Thresholds. Philipp Czerner. |
11:20 – 12:30: FCRC Plenary Session
Margaret Martonosi: Taking on the World’s Challenges: The Role of Computing Research and Innovation
14:00 – 15:30: Session: Distributed approximation
Chair: Goran Zuzic
| 14:00 – 14:25 | The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. Yi-Jun Chang and Zeyong Li. |
| 14:25 – 14:50 | (1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings. Shang-En Huang and Hsin-Hao Su. |
| 14:50 – 15:15 | Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications. Yi-Jun Chang. |
| 15:15 – 15:20 | Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. Jinfeng Dou, Thorsten Götte, Henning Hillebrandt, Christian Scheideler and Julian Werthmann. |
| 15:20 – 15:25 | Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model. Tijn de Vos. |
| 15:25 – 15:30 | Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. Tijn de Vos and Sebastian Forster |
16:15 – 17:15: FCRC Plenary panel discussion
17:30 – 19:30: Business meeting
Wednesday, June 21st
8:50 – 10:55: Session: Data structures
Chair: Faith Ellen
| 8:50 – 9:15 | Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. David Yu Cheng Chan, George Giakkoupis and Philipp Woelfel. |
| 9:15 – 9:40 | Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. Armando Castañeda and Gilde Valeria Rodríguez. |
| 9:40 – 10:05 | The ERA Theorem for Safe Memory Reclamation. Gali Sheffi and Erez Petrank. |
| 10:05 – 10:30 | Efficient Bounded Timestamping from Standard Synchronization Primitives. Benyamin Bashari, Ali Jamadi and Philipp Woelfel. |
| 10:30 – 10:55 | A Wait-free Queue with Polylogarithmic Step Complexity. Hossein Naderibeni and Eric Ruppert. |
11:20 – 12:30: FCRC Plenary Session
Shafi Goldwasser: Constructing and Deconstructing Trust: Employing Cryptographic Recipe in the ML Domain
14:00 – 15:30: Session: Symmetry breaking
Chair: Taisuke Izumi
| 14:00 – 14:25 | Distributed MIS in O(log log n) Awake Complexity. Fabien Dufoulon, William K. Moses Jr. and Gopal Pandurangan. |
| 14:25 – 14:50 | Distributed MIS with Low Energy and Time Complexities. Mohsen Ghaffari and Julian Portmann. |
| 14:50 – 15:15 | Distributed Symmetry Breaking on Power Graphs via Sparsification. Yannic Maus, Saku Peltonen and Jara Uitto. |
| 15:15 – 15:20 | Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? Peter Robinson. |
| 15:20 – 15:25 | Brief Announcement: Local Problems in the SUPPORTED Model. Akanksha Agrawal, John Augustine, David Peleg and Srikkanth Ramachandran. |
| 15:25 – 15:30 | Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks. Giuseppe Antonio Di Luna and Giovanni Viglietta. |
16:00 – 18:05: Session: Networks
Chair: Peter Davies
| 16:00 – 16:25 | A Near-Optimal Deterministic Distributed Synchronizer. Mohsen Ghaffari and Anton Trygub. |
| 16:25 – 16:50 | Deterministic Fault-Tolerant Connectivity Labeling Scheme. Taisuke Izumi, Yuval Emek, Tadashi Wadayama and Toshimitsu Masuzawa. |
| 16:50 – 17:15 | Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications. Myrto Arapinis, Ábel Kocsis, Nikolaos Lamprou, Liam Medley and Thomas Zacharias. |
| 17:15 – 17:40 | Distributed Averaging in Opinion Dynamics. Petra Berenbrink, Colin Cooper, Cristina Gava, David Kohan Marzagão, Frederik Mallmann-Trenn, Tomasz Radzik and Nicolas Rivera. |
| 17:40 – 18:05 | Sparse Semi-Oblivious Routing: Few Random Paths Suffice. Goran Zuzic, Bernhard Haeupler and Antti Roeyskoe. |
19:00 – 22:00: Banquet
Thursday, June 22nd
8:50 – 10:55: Session: Byzantine agreement
Chair: Seth Gilbert
| 8:50 – 9:15 | BeeGees: Stayin’ Alive in Chained BFT. Neil Giridharan, Florian Suri-Payer, Matthew Ding, Heidi Howard, Ittai Abraham and Natacha Crooks. |
| 9:15 – 9:40 | Optimal Eventual Byzantine Agreement Protocols with Omission Failures. Kaya Alpturer, Joseph Halpern and Ron van der Meyden. |
| 9:40 – 10:05 | On the Amortized Communication Complexity of Byzantine Broadcast. Jun Wan, Atsuki Momose, Ling Ren, Elaine Shi and Zhuolun Xiang. |
| 10:05 – 10:30 | Distributed CONGEST Algorithms against Mobile Adversaries. Orr Fischer and Merav Parter. |
| 10:30 – 10:35 | Brief Announcement: Breaking the f+1 Barrier: Executing Payment Transactions in Parallel with Less than f+1 Validations. Rida Bazzi and Sara Tucci-Piergiovanni. |
| 10:35 – 10:40 | Brief Announcement: Discrete Incremental Voting. Colin Cooper, Tomasz Radzik and Takeharu Shiraga. |
| 10:40 – 10:45 | Brief Announcement: The MBroadcast Abstraction. Mathilde Déprés, Achour Mostéfaoui, Matthieu Perrin and Michel Raynal. |
| 10:45 – 10:50 | Brief Announcement: Improved Consensus in Quantum Networks. MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski and Jan Olkowski. |
11:20 – 12:30: FCRC Plenary Session
Don Towsley: The Quantum Internet: Recent Advantages and Challenges
14:00 – 15:40: Wireless
Chair: Przemysław Uznański
| 14:00 – 14:25 | Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization. Peter Davies. |
| 14:25 – 14:50 | Optimal Message-Passing with Noisy Beeps. Peter Davies. |
| 14:50 – 15:15 | Distributed Self-Stabilizing MIS with Few States and Weak Communication. George Giakkoupis and Isabella Ziccardi. |
| 15:15 – 15:40 | The Impact of Cooperation in Bilateral Network Creation. Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner and Arthur Zahn. |
16:00 – 17:30: Session: Complexity/impossibility
Chair: Philipp Woelfel
| 16:00 – 16:25 | On the Validity of Consensus. Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic and Manuel Vidigueira. |
| 16:25 – 16:50 | Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication. Jan Olkowski, Bogdan Chlebus and Dariusz Kowalski. |
| 16:50 – 17:15 | Improved Tradeoffs for Leader Election. Shay Kutten, Peter Robinson, Ming Ming Tan and Xianbin Zhu. |
| 17:15 – 17:20 | Brief Announcement: Efficient Recoverable Writable-CAS. Prasad Jayanti, Siddhartha Visveswara Jayanti and Sucharita Jayanti. |
| 17:20 – 17:25 | Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds. Anh Tran and Edward Talmage. |
| 17:25 – 17:30 | Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding. Viveck Cadambe and Shihang Lyu. |
Friday, June 23rd
11:20 – 12:30: FCRC Plenary Session
Torsten Hoefler: Scalable and Efficient AI: From Supercomputers to Smartphones
8:45 – 18:00: Workshop: BDA
14:00 – 17:00: Tutorial
Rotem Oshman and Vinod Vaikuntanathan: Cryptography in Distributed Protocols
Coffee break at 15:30
9:00 – 11:00: Tutorial
Adrian Kosowski, Krzysztof Nowicki, and Przemyslaw Uznanski (Pathway.com): Distributed computing with live streaming data