default search action
PODC 2024: Nantes, France
- Ran Gelles, Dennis Olivetti, Petr Kuznetsov:
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, PODC 2024, Nantes, France, June 17-21, 2024. ACM 2024
Keynotes
- Nicola Santoro
:
Keynote: Time is not a Healer: Before and After. 1 - Tim Roughgarden
Keynote: Provable Slashing Guarantees. 2
Concurrency and Synchronization
- Sean Ovens
Determining Recoverable Consensus Numbers. 3-13 - Hagit Attiya
History-Independent Concurrent Objects. 14-24 - Prasad Jayanti
MemSnap: A Fast Adaptive Snapshot Algorithm for RMWable Shared-Memory. 25-35 - Achour Mostéfaoui
Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail! 36-39
Population Protocols
- Dan Alistarh
Game Dynamics and Equilibrium Computation in the Population Protocol Model. 40-49 - Dominik Kaaser
Dynamic Size Counting in the Population Protocol Model. 50-60 - Austin Luchsinger
Brief Announcement: Optimally Encoding Information in Chemical Reaction Networks. 61-64
Biological Distributed Algorithms
- Andreas Padalkin
Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. 65-75 - Matthias Függer
Majority Consensus Thresholds in Competitive Lotka-Volterra Populations. 76-86 - George Giakkoupis
Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model. 87-90 - Niccolò D'Archivio
Brief Announcement: On the Limits of Information Spread by Memory-less Agents. 91-94
The LOCAL Model and Variations
- Alkida Balliu
Tight Lower Bounds in the Supported LOCAL Model. 95-105 - Yi-Jun Chang
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model. 106-116 - Alkida Balliu
Brief Announcement: Local Advice and Local Decompression. 117-120
Distributed Machine Learning
- Sam Ade Jacobs
System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models. 121-130 - Sadegh Farhadkhani
Brief Announcement: A Case for Byzantine Machine Learning. 131-134
Byzantine Fault-Tolerance
- Andrew Lewis-Pye
Lumiere: Making Optimal BFT for Partial Synchrony Practical. 135-144 - Pierre Civit
DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication. 145-156 - Pierre Civit
All Byzantine Agreement Problems Are Expensive. 157-169 - Diogo Avelas
Probabilistic Byzantine Fault Tolerance. 170-181
Algorithms for the CONGEST Model
- Vignesh Manoharan
Computing Minimum Weight Cycle in the CONGEST Model. 182-193 - Yi-Jun Chang
Deterministic Expander Routing: Faster and More Versatile. 194-204 - Fedor V. Fomin
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. 205-208
Quantum Computing and Communication Networks
- Pierre Fraigniaud
Even-Cycle Detection in the Randomized and Quantum CONGEST Model. 209-219 - Atsuya Hasegawa
On the Power of Quantum Distributed Proofs. 220-230 - Michael A. Bender
Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution. 231-242 - Bernadette Charron-Bost
Brief Announcement: Know Your Audience: Communication model and computability in anonymous networks. 243-246
Blockchain and BFT Consensus
- Francesco D'Amato
Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols. 247-256 - Qianyu Yu
TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus. 257-267 - Krishnendu Chatterjee
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains. 268-278 - Geoffrey Ramseyer
Brief Announcement: Fair Ordering via Streaming Social Choice Theory. 279-282
Protocols for Decentralized Finance
- Andrei Tonkikh
Swiper: a new paradigm for efficient weighted distributed protocols. 283-294 - Rida A. Bazzi
The Fractional Spending Problem: Executing Payment transactions in parallel with less than f+1 validations. 295-305 - Zeta Avarikioti
Brief Announcement: Musketeer - Incentive-Compatible Rebalancing for Payment Channel Networks. 306-309
Fault-Tolerance and Synchronization
- Carole Delporte-Gallet
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. 310-320 - Mohammad Hajiaghayi
Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed? 321-331 - Mark Braverman
Multi-Party Set Disjointness and Intersection with Bounded Dependence. 332-342 - Sylvain Gay
Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems. 343-346
Lower Bounds
- Fabian Reiter
A LOCAL View of the Polynomial Hierarchy. 347-357 - Miguel Alves Ferreira
Impossibility Results for Data-Center Routing with Congestion Control and Unsplittable Flows. 358-368 - Alkida Balliu
Completing the Node-Averaged Complexity Landscape of LCLs on Trees. 369-379
Shortest Path Algorithms
- Yi-Jun Chang
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. 380-390 - Hong Duc Bui
Improved All-Pairs Approximate Shortest Paths in Congested Clique. 391-400 - Mohsen Ghaffari
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP. 401-411 - Yi-Jun Chang
Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. 412-415
Coloring in Graphs
- Maxime Flin
(Δ+1) Vertex Coloring in O(n) Communication. 416-424 - Marc Fuchs
Brief Announcement: Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms. 425-428 - Nicolas Bousquet
Brief Announcement: Global certification via perfect hashing. 429-431
Concurrency and Consistency
- Hagit Attiya
Strong Linearizability using Primitives with Consensus Number 2. 432-442 - Fatemeh Naderi-Semiromi
Strongly Linearizable LL/SC from CAS. 443-453 - Dante Bencivenga
Faster Randomized Repeated Choice and DCAS. 454-464 - Giuliano Losa
Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model. 465-468
Security and Cryptography
- Hanwen Feng
Dragon: Decentralization at the cost of Representation after Arbitrary Grouping and Its Applications to Sub-cubic DKG and Interactive Consistency. 469-479 - James Bartusek
On the Communication Complexity of Secure Multi-Party Computation With Aborts. 480-491 - Diana Ghinea
Brief Announcement: Communication-Optimal Convex Agreement. 492-495
Massively Parallel Computation
- Artur Czumaj
Streaming Graph Algorithms in the Massively Parallel Computation Model. 496-507 - Rustam Latypov
Adaptive Massively Parallel Coloring in Sparse Graphs. 508-518 - Quanquan C. Liu
Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds. 519-522 - Jeff Giliberti
Brief Announcement: Massively Parallel Ruling Set Made Deterministic. 523-526
Self-Stabilization
- Karine Altisen
On Self-stabilizing Leader Election in Directed Networks. 527-537 - Colette Johnen
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. 538-548 - Fabian Frei
Brief Announcement: Content-Oblivious Leader Election on Rings. 549-552
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-27 21:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: