{"id":174,"date":"2026-06-17T05:28:07","date_gmt":"2026-06-17T05:28:07","guid":{"rendered":"https:\/\/www.podc.org\/podc2026\/?page_id=174"},"modified":"2026-06-17T05:28:07","modified_gmt":"2026-06-17T05:28:07","slug":"schedule","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2026\/schedule\/","title":{"rendered":"Schedule"},"content":{"rendered":"\n

Tuesday<\/strong><\/h2>\n\n\n\n
Opening<\/strong><\/td>08:40<\/td><\/tr>
Session 1<\/strong><\/td>08:45-09:05<\/td>Deterministic Distributed Algorithms for Short Disjoint Paths<\/td><\/tr>
<\/td>09:05-09:25<\/td>Girth Approximations in the CONGEST Model<\/td><\/tr>
<\/td>09:25-09:45<\/td>Distributed Treewidth Computation and Courcelle\u2019s Theorem in the CONGEST Model<\/td><\/tr>
<\/td>09:45-09:50<\/td>Brief Announcement: On Energy Complexity and Multi-Instance Computation in the Congested Clique<\/td><\/tr>
<\/td>09:50-09:55<\/td>Brief Announcement: Deterministic Edge Coloring with few Colors in CONGEST<\/td><\/tr>
<\/td>09:55-10:00<\/td>Brief Announcement: 2-Coloring Cycles in One Round<\/td><\/tr>
Coffee<\/strong><\/td>10:00-10:30<\/td><\/tr>
Session 2<\/strong><\/td>10:30-10:50<\/td>Simple and Efficient Randomized Wait-Free Locks<\/td><\/tr>
<\/td>10:50-11:10<\/td>Generalized and Reinitializable Concurrent Fast Arrays<\/td><\/tr>
<\/td>11:10-11:15<\/td>Brief Announcement: A Space-Efficient Lock-Free Linear-Probing Hash Table<\/td><\/tr>
<\/td>11:15-11:20<\/td>Brief Announcement: Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems<\/td><\/tr>
Session 3<\/strong><\/td>11:20-11:40<\/td>Undecided State Dynamics with Many Opinions<\/td><\/tr>
<\/td>11:40-12:00<\/td>Fast Gossip-Based Rumor Spreading Using Small Messages<\/td><\/tr>
<\/td>12:00-12:20<\/td>Complementary Time–Space Tradeoff for Self-Stabilizing Leader Election<\/td><\/tr>
Lunch<\/strong><\/td>12:20-14:00<\/td><\/tr>
Session 4<\/strong><\/td>14:00-14:20<\/td>Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs<\/td><\/tr>
<\/td>14:20-14:40<\/td>Early-Stabilizing Counting<\/td><\/tr>
<\/td>14:40-15:00<\/td>Gradient Clock Synchronization with Practically Constant Local Skew<\/td><\/tr>
Session 5<\/strong><\/td>15:05-15:25<\/td>Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes<\/td><\/tr>
<\/td>15:25-15:45<\/td>Distributed Algorithms for Potential Problems<\/td><\/tr>
<\/td>15:45-15:50<\/td>Brief Announcement: Exponential Quantum Advantage for Message Complexity in Distributed Algorithms<\/td><\/tr>
<\/td>15:50-15:55<\/td>Brief Announcement: Distributed Statistical Zero-Knowledge Proofs via Sumcheck<\/td><\/tr>
<\/td>15:55-16:00<\/td>Brief Announcement: Distributed Non-Interactive Zero-Knowledge Proofs<\/td><\/tr>
Coffee<\/strong><\/td>16:00-16:25<\/td><\/tr>
Invited Talk<\/strong><\/td>16:25-17:35<\/td>Keynote Talk: Parallel Algorithm Engineering Reconsidered<\/td><\/tr>
Business Meeting<\/strong><\/td>17:45<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Wednesday<\/h2>\n\n\n\n
Session 6<\/strong><\/td>08:40-09:00<\/td>From Few to Many Faults: Optimal Adaptive Byzantine Agreement<\/td><\/tr>
<\/td>09:00-09:20<\/td>Reaching Univalency with Subquadratic Communication<\/td><\/tr>
<\/td>09:20-09:40<\/td>Why Canonical-Round Algorithms Fail for Optimal Byzantine Resilience<\/td><\/tr>
<\/td>09:40-09:45<\/td>Brief Announcement: Communication Efficient Byzantine Agreement with Predictions<\/td><\/tr>
<\/td>09:45-09:50<\/td>Brief Announcement: BumbleBee: Best-of-Both-Worlds MVBA with Optimal Communication, Latency and Resilience Tradeoffs<\/td><\/tr>
<\/td>09:50-09:55<\/td>Brief Announcement: What is Agreement About if not Common Knowledge?<\/td><\/tr>
<\/td>09:55-10:00<\/td>Brief Announcement: Byzantine Machine Learning, MultiKrum and an Optimal Notion of Robustness<\/td><\/tr>
Coffee<\/strong><\/td>10:00-10:30<\/td><\/tr>
Dijkstra Talk<\/strong><\/td>10:30-11:30<\/td>Dijkstra Prize Keynote: The $\\tilde{\\Omega}(D+\\sqrt{n})$ Lower Bound Story of Distributed Algorithms<\/td><\/tr>
Session 7<\/strong><\/td>11:35-11:55<\/td>Efficient Counting and Simulation in Content-Oblivious Rings<\/td><\/tr>
<\/td>11:55-12:00<\/td>Brief Announcement: Toward Uniform Content-Oblivious Leader Election on General Graphs<\/td><\/tr>
<\/td>12:00-12:20<\/td>Distinct Gathering and the Virtue of Self-Consistency<\/td><\/tr>
Lunch<\/strong><\/td>12:20-14:00<\/td><\/tr>
Session 8<\/strong><\/td>14:00-14:20<\/td>Nearly Quadratic Asynchronous Distributed Key Generation from Recursive Consensus<\/td><\/tr>
<\/td>14:20-14:40<\/td>Information-Theoretic Optimistic Verifiable Secret Sharing<\/td><\/tr>
<\/td>14:40-15:00<\/td>Balanced and Adaptively Secure Asynchronous Common Coin and Byzantine Agreement With Sub-Quadratic Communication<\/td><\/tr>
<\/td>15:00-15:20<\/td>Byzantine Consensus in the Partially Authenticated Setting<\/td><\/tr>
<\/td>15:20-15:25<\/td>Brief Announcement: Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity<\/td><\/tr>
<\/td>15:25-15:30<\/td>Brief Announcement: Subcubic Coin Tossing in Asynchrony without PKI<\/td><\/tr>
Coffee<\/strong><\/td>15:30-15:55<\/td><\/tr>
Session 9<\/strong><\/td>15:55-16:15<\/td>New Hardness Results for the LOCAL Model via a Simple Self-Reduction<\/td><\/tr>
<\/td>16:15-16:35<\/td>The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size<\/td><\/tr>
<\/td>16:35-16:40<\/td>Brief Announcement: Is a LOCAL Algorithm Computable?<\/td><\/tr>
<\/td>16:40-16:45<\/td>Brief Announcement: It Does Not Matter How You Define Locally Checkable Labelings<\/td><\/tr>
<\/td>16:45-16:50<\/td>Brief Announcement: Fast Deterministic Distributed Degree Splitting<\/td><\/tr>
<\/td>16:50-16:55<\/td>Brief Announcement: Sinkless Orientation Made Trivial<\/td><\/tr>
Session 10<\/strong><\/td>17:00-17:20<\/td>Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers<\/td><\/tr>
<\/td>17:20-17:40<\/td>The Task Completion Problem and its Application to Crash-Resilient Computation<\/td><\/tr>
<\/td>17:40-18:00<\/td>A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput<\/td><\/tr>
Barbecue<\/strong><\/td>19:30<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Thursday<\/h2>\n\n\n\n
Session 11<\/strong><\/td>08:40-09:00<\/td>Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition<\/td><\/tr>
<\/td>09:00-09:20<\/td>Meta-Theorems for Cuttable Distributed Problems<\/td><\/tr>
<\/td>09:20-09:40<\/td>Distributed Stochastic Graph Algorithms<\/td><\/tr>
<\/td>09:40-10:00<\/td>Improved Bounds for Distributed Random Walks and Spanning Trees<\/td><\/tr>
Coffee<\/strong><\/td>10:00-10:30<\/td><\/tr>
Session 12<\/strong><\/td>10:30-10:50<\/td>Ranking Opinions with Few States in Population Protocols<\/td><\/tr>
<\/td>10:50-11:10<\/td>Order Statistics in Population Protocols via Simple Dynamics<\/td><\/tr>
<\/td>11:10-11:15<\/td>Brief Announcement: D\u00e9j\u00e0Vu: A Minimalistic Mechanism for Distributed Plurality Consensus<\/td><\/tr>
<\/td>11:15-11:20<\/td>Brief Announcement: Limit Laws for Consensus Protocols on the Complete Graph<\/td><\/tr>
Session 13<\/strong><\/td>11:20-11:40<\/td>Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing<\/td><\/tr>
<\/td>11:40-12:00<\/td>Conflict-Freedom as a Progress Condition<\/td><\/tr>
<\/td>12:00-12:20<\/td>Generalized Compare-and-Swap and Space-Efficient Universal Constructions for the Infinite-Arrival Model<\/td><\/tr>
Lunch<\/strong><\/td>12:20-14:00<\/td><\/tr>
Session 14<\/strong><\/td>14:00-14:20<\/td>Forget-IT: Optimal Good-Case Latency For Information-Theoretic BFT<\/td><\/tr>
<\/td>14:20-14:40<\/td>FEAT: Fair and Efficient Adversarial Transaction Ordering<\/td><\/tr>
<\/td>14:40-15:00<\/td>Fast Byzantine Total Order Broadcast<\/td><\/tr>
<\/td>15:00-15:05<\/td>Brief Announcement: Delay-Optimal Transaction Order Fairness<\/td><\/tr>
Pause<\/strong><\/td>15:05<\/td><\/tr>
Session 15<\/strong><\/td>15:10-15:30<\/td>Distributed Renaming with Subquadratic Bits via Scalable Committee Election<\/td><\/tr>
<\/td>15:30-15:50<\/td>Network-Agnostic Multidimensional Approximate Agreement with Optimal Resilience<\/td><\/tr>
<\/td>15:50-16:10<\/td>Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs<\/td><\/tr>
<\/td>16:10-16:15<\/td>Brief Announcement: Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience<\/td><\/tr>
Coffee<\/strong><\/td>16:15-16:45<\/td><\/tr>
Invited Talk<\/strong><\/td>16:45-17:55<\/td>Highly Asynchronous Concurrency in Data Structures<\/td><\/tr>
Closing Remarks<\/strong><\/td>17:55<\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"

Tuesday Opening 08:40 Session 1 08:45-09:05 Deterministic Distributed Algorithms for Short Disjoint Paths 09:05-09:25 Girth Approximations in the CONGEST Model 09:25-09:45 Distributed Treewidth Computation and Courcelle\u2019s Theorem in the CONGEST Model 09:45-09:50 Brief Announcement: On Energy Complexity and Multi-Instance Computation in the Congested Clique 09:50-09:55 Brief Announcement: Deterministic Edge Coloring with few Colors in CONGEST … Continue reading “Schedule”<\/span><\/a><\/p>\n","protected":false},"author":29,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-174","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages\/174","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/users\/29"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/comments?post=174"}],"version-history":[{"count":1,"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages\/174\/revisions"}],"predecessor-version":[{"id":175,"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/pages\/174\/revisions\/175"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2026\/wp-json\/wp\/v2\/media?parent=174"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}