Monday, June 17th

• 08:55 – 17:00: Workshop: Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (ApPLIED)
• 08:45-18:00: Workshop: Biological Distributed Algorithms (BDA)
• 19:00-20:00: Reception & HOPC poster session

Tuesday, June 18th

• 8:45-9:00: Opening remarks
• 9:00 – 10:00: Keynote: Tim Harris (Microsoft): The growth of parallelism in machine learning inference.
• Coffee break
• 10:30 – 11:25: Session: Concurrency and synchronization
• 11:30 – 12:10: Session: Population Protocols
• Lunch break
• 13:40 – 14:35: Session: Biological Distributed Algorithms
• 14:40 – 15:20: Session: The LOCAL model and variations
• Coffee break
• 15:50 – 16:15: Session: Distributed Machine Learning
• 16:20 – 17:30: Session: Byzantine fault-tolerance
• 17:45-18:00: In memory of Matthieu Roy
• 18:00-19:00: Business Meeting

Wednesday, June 19th

• 9:00 – 10:00: Keynote: Tim Roughgarden (University of Columbia): The Economic Limits of Permissionless Consensus
• Coffee break
• 10:30 – 11:10: Session: Algorithms for the CONGEST model
• 11:15 – 12:10: Session: Quantum Computing and Communication Networks
• Lunch break and Senior-junior meeting
• 13:40 – 14:35: Session: Blockchain and BFT Consensus
• 14:40 – 15:20: Session: Protocols for decentralized finance
• Coffee break
• 15:50 – 16:45: Session: Fault-tolerance and synchronization
• 16:50 – 17:40: Session: Lower bounds
• 19:00: Bus departure
• 19:30-23:00: Banquet

Thursday, June 20th

• 9:00 – 10:00: Keynote (Dijkstra award session): Nicola Santoro (Carleton University). Time is not a Healer: Before and After
• Coffee break
• 10:30 – 11:25: Session: Concurrency and consistency
• 11:30 – 12:10: Session: Security and cryptography
• Lunch break
• 13:40 – 14:35: Session: Shortest path algorithms
• 14:40 – 15:20: Session: Coloring in Graphs
• Coffee break
• 15:50 – 16:45: Session: Massively parallel computation
• 16:50 – 17:30: Session: Self-stabilization

Friday, June 21st

• Morning+afternoon: Workshop: Principles of Distributed Learning (PODL)
• 09:00-18:00: Workshop: Distributed Computing with Emerging Hardware Technology (EMERALD)
• 09:00-12:20: Tutorial: Weak memory models in programming language semantics
• 14:00-17:30: Tutorial: Permissionless Consensus

Program

Table of contents for the PODC’24 proceedings

Monday, June 17th

08:55 – 17:00: Workshop: Advanced Tools, Programming Languages, and PLatforms for
Implementing and Evaluating algorithms for Distributed systems (ApPLIED)

Schedule

08:45-18:00: Workshop: Biological Distributed Algorithms (BDA)

Schedule

19:00-20:00: Reception & HOPC poster session

Tuesday, June 18th

9:00 – 10:00: Keynote

Tim Harris (Microsoft): The growth of parallelism in machine learning inference.

Coffee break

10:30 – 11:25: Concurrency and synchronization

Chair: Eric Ruppert

• Best Paper: S. Ovens. Determining Recoverable Consensus Numbers 
• H. Attiya, M. Bender, M. Farach-Colton, R. Oshman, N. Schiller. History-Independent Concurrent Objects 
• P. Jayanti, S. Jayanti, S. Jayanti. An Efficient RMWable Snapshot Algorithm
• A. Mostefaoui, M. Perrin, J. Weibel. Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail! 

11:30 – 12:10: Population Protocols

Chair: Eric Ruppert

• D. Alistarh, K. Chatterjee, M. Karrabi, J. Lazarsfeld. Game Dynamics and Equilibrium Computation in the Population Protocol Model
• D. Kaaser, M. Lohmann. Dynamic Size Counting in the Population Protocol Model
• A. Luchsinger, D. Doty, D. Soloveichik. Brief Announcement: Optimally Encoding Information in Chemical Reaction Networks

Lunch

13:40 – 14:35: Biological Distributed Algorithms

Chair: Andrea Richa

• A. Padalkin, C. Scheideler. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter 
• M. Függer, T. Nowak, J. Rybicki. Majority consensus thresholds in competitive Lotka-Volterra populations
• G. Giakkoupis, V. Turau, I. Ziccardi. Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model
• N. D’Archivio, R. Vacus. Brief Announcement: On the Limits of Information Spread by Memory-less Agents 

14:40 – 15:20: The LOCAL model and variations

Chair: Andrea Richa

• A. Balliu, T. Boudier, S. Brandt, D. Olivetti. Tight Lower Bounds in the Supported LOCAL Model
• Y. Chang, G. Mishra, H. Nguyen, M. Yang, Y. Yeh. A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
• A. Balliu, S. Brandt, F. Kuhn, K. Nowicki, D. Olivetti, E. Rotenberg, J. Suomela. Brief Announcement: Local Advice and Local Decompression

Coffee break

15:50 – 16:15: Distributed Machine Learning

Chair: Rida Bazzi

• S. Jacobs, M. Tanaka, C. Zhang, M. Zhang, R. Aminadabi, S. Song, S. Rajbhandari, Y. He. System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models 
• S. Farhadkhani, R. Guerraoui, N. Gupta, R. Pinot. Brief Announcement: A Case for Byzantine Machine Learning 

16:20 – 17:30: Byzantine fault-tolerance

Chair: Rida Bazzi

• A. Lewis-Pye, D. Malkhi, O. Naor, K. Nayak. Lumiere: Making Optimal BFT for Partial Synchrony Practical
• P. Civit, M. Dzulfikar, S. Gilbert, R. Guerraoui, J. Komatovic, M. Vidigueira.  DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication
• P. Civit, S. Gilbert, R. Guerraoui, J. Komatovic, A. Paramonov, M. Vidigueira. All Byzantine Agreement Problems Are Expensive
• D. Avelas, H. Heydari, T. Distler, E. Alchieri, A. Bessani. Probabilistic Byzantine Fault Tolerance

17:45-18:00: In memory of Matthieu Roy

18:00-19:00: Business Meeting

Wednesday, June 19th

9:00 – 10:00: Keynote

Tim Roughgarden (University of Columbia): The Economic Limits of Permissionless Consensus

Coffee break

10:30 – 11:10: Algorithms for the CONGEST model

Chair: Gopal Pandurangan

• V. Manoharan, V. Ramachandran. Computing Minimum Weight Cycle in the CONGEST Model
• Y. Chang, S. Huang, H. Su. Deterministic Expander Routing: Faster and More Versatile
• F. Fomin, P. Fraigniaud, P. Montealegre, I. Rapaport, I. Todinca. Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth

11:15 – 12:10: Quantum Computing and Communication Networks

Chair: Gopal Pandurangan

• P. Fraigniaud, M. Luce, F. Magniez, I. Todinca. Even-Cycle Detection in the Randomized and Quantum CONGEST Model
• A. Hasegawa, S. Kundu, H. Nishimura. On the Power of Quantum Distributed Proofs
• M. Bender, J. Fineman, S. Gilbert, J. Kuszmaul, M. Young. Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution
• B. Charron-Bost, P. Lambein-Monette. Brief Announcement: Know Your Audience

Lunch and Senior-junior meeting

13:40 – 14:35: Blockchain and BFT Consensus

Chair: Kartik Nayak

• L. Zanolini, F. D’Amato, G. Losa. Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols
• Q. Yu, G. Losa, X. Wang. TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus
• K. Chatterjee, A. Ebrahim-Zadeh, M. Karrabi, K. Pietrzak, M. Yeo, Đ. Žikelić. Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains
• G. Ramseyer, A. Goel. Brief Announcement: Fair Ordering via Streaming Social Choice Theory

14:40 – 15:20: Protocols for decentralized finance

Chair: Kartik Nayak

• A. Tonkikh, L. Freitas. Swiper: a new paradigm for efficient weighted distributed protocols
• R. Bazzi, S. Tucci-Piergiovanni. The Fractional Spending Problem: Executing Payment transactions in parallel with less than f+1 validations
• Z. Avarikioti, S. Schmid, S. Tiwari. Brief Announcement: Musketeer: Incentive-Compatible Rebalancing for Payment Channel Networks

Coffee break

15:50 – 16:45: Fault-tolerance and synchronization

Chair: Giuliano Losa

• C. Delporte-Gallet, H. Fauconnier, P. Fraigniaud, S. Rajsbaum, C. Travers. The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers
• Best Student Paper (one of two): M. Hajiaghayi, D. Kowalski, J. Olkowski. Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed? 
• M. Braverman, R. Oshman, T. Roth. Multi-Party Set Disjointness and Intersection with Bounded Dependence
• S. Gay, A. Mostefaoui, M. Perrin. Brief Announcement: No Broadcast Abstraction Captures k-Set-Agreement

16:50 – 17:40: Lower bounds

Chair: Giuliano Losa

• F. Reiter. A LOCAL View of the Polynomial Hierarchy
• M. Ferreira, N. Atre, J. Sherry, J. Sobrinho.  Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable Flows 
• A. Balliu, S. Brandt, F. Kuhn, D. Olivetti, G. Schmid. Completing the Node-Averaged Complexity Landscape of LCLs on Trees

Banquet

Thursday, June 20th

9:00 – 10:00: Keynote (Dijkstra award session)

Nicola Santoro (Carleton University). Time is not a Healer: Before and After

Coffee break

10:30 – 11:25: Concurrency and consistency

Chair: Igor Zablotchi

• H. Attiya, A. Castaneda, C. Enea. Strong Linearizability using Primitives with Consensus Number 2
• F. Naderi Semiromi, P. Woelfel. Strongly Linearizable LL/SC 
• D. Bencivenga, G. Giakkoupis, P. Woelfel. Faster Randomized Repeated Choice and DCAS
• G. Losa, E. Gafni. Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model

11:30 – 12:10: Security and cryptography

Chair: Igor Zablotchi

• H. Feng, Z. Lu, Q. Tang. Dragon: Decentralization at the cost of Representation after Arbitrary Grouping and Its Applications to Sub-cubic DKG and Interactive Consistency
• J. Bartusek, T. Bergamaschi, S. Khoury, S. Mutreja, O. Paradise.  On the Communication Complexity of Secure Multi-Party Computation With Aborts
• D. Ghinea, C. Liu-Zhang, R. Wattenhofer. Brief Announcement: Communication-Optimal Convex Agreement

Lunch

13:40 – 14:35: Shortest path algorithms

Chair: Boaz Patt-Shamir

• M. Ghaffari, A. Trygub. A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
• Best Student Paper (one of two): H. Bui, S. Chandra, Y. Chang, M. Dory, D. Leitersdorf. Improved All-Pairs Approximate Shortest Paths in Congested Clique
• Y. Chang, O. Hecht, D. Leitersdorf, P. Schneider. Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
• Y. Chang, V. Dani, T. Hayes. Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs

14:40 – 15:20: Coloring in Graphs

Chair: Boaz Patt-Shamir

• M. Flin, P. Mittal. (Δ+1) Vertex Coloring in O(n) Communication
• M. Fuchs, F. Kuhn. Brief Announcement: Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms 
• N. Bousquet, L. Feuilloley, S. Zeitoun. Brief Announcement: Global certification via perfect hashing

Coffee break

15:50 – 16:45: Massively parallel computation

Chair: Sébastien Tixeuil

• A. Czumaj, G. Mishra, A. Mukherjee. Streaming Graph Algorithms in the Massively Parallel Computation Model 
• R. Latypov, Y. Maus, S. Pai, J. Uitto. Adaptive Massively Parallel Coloring in Sparse Graphs
• Q. Liu, C. Seshadhri. Brief Announcement. Improved Massively Parallel Triangle Counting in O(1) Rounds 
• J. Giliberti, Z. Parsaeian. Brief Announcement. Massively Parallel Ruling Set Made Deterministic

16:50 – 17:30: Self-stabilization

Chair: Sébastien Tixeuil

• K. Altisen, A. Cournier, G. Defalque, S. Devismes. On Self-stabilizing Leader Election in Directed Networks
• C. Johnen, S. Devismes, F. Mazoit, D. Ilcinkas. Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient
• F. Frei, R. Gelles, A. Ghazy, A. Nolin.  Brief Announcement: Content-Oblivious Leader Election on Rings

Friday, June 21st

Morning+afternoon: Workshop: Principles of Distributed Learning (PODL)

Schedule (tentative)

09:00-18:00: Workshop: Distributed Computing with Emerging Hardware Technology (EMERALD)

Schedule

09:00-12:20: Tutorial: Weak memory models in programming language semantics

Organized by Ori Lahav.

14:00-17:30: Tutorial: Permissionless Consensus

Organized by Andrew Lewis-Pye and Tim Roughgarden.