16:47 PODC 2021 — Session 1 Talk 1 — Separating Bounded and Unbounded Asynchrony for Autonomous Robots... Association for Computing…
20:13 PODC 2021 — Session 1 Talk 2 — On Implementing Stabilizing Leader Election with Weak Assumptions... Association for Computing…
19:27 PODC 2021 — Session 1 Talk 3 — Time-Optimal Self-Stabilizing Leader Election in Population Protocols Association for Computing…
16:57 PODC 2021 — Session 1 Talk 4 — Lower Bounds on the State Complexity of Population Protocols Association for Computing…
16:01 PODC 2021 — Session 1 Talk 5 — Fast and Robust Comparison Dynamics in Population Protocols Association for Computing…
19:52 PODC 2021 — Session 1 Talk 6 — Diversity, Fairness and Sustainability in Population Protocols Association for Computing…
10:27 PODC 2021 — Session 1 Talk 7 — Brief Announcement: A Time and Space Optimal Stable Population Pr... Association for Computing…
17:10 PODC 2021 — Session 2 Talk 1 — Search via Parallel Lévy Walks on Z^2 Association for Computing…
19:52 PODC 2021 — Session 2 Talk 2 — A Thin Self-Stabilizing Asynchronous Unison Algorithm with... Association for Computing…
17:31 PODC 2021 — Session 2 Talk 3 — Efficient Deterministic Leader Election for Programmable Matter Association for Computing…
19:38 PODC 2021 — Session 2 Talk 4 — Decision Power of Weak Asynchronous Models of Distributed Computing Association for Computing…
19:42 PODC 2021 — Session 2 Talk 5 — Contention Resolution with Predictions Association for Computing…
17:14 PODC 2021 — Session 2 Talk 6 — Tight Trade-off in Contention Resolution without Collision Detection Association for Computing…
8:46 PODC 2021 — Session 2 Talk 7 — Brief Announcement: Wake Up and Join Me! An Energy Efficient... Association for Computing…
14:34 PODC 2021 — Session 3 Talk 1 — Hedging Against Sore Loser Attacks in Cross-Chain Transactions Association for Computing…
16:05 PODC 2021 — Session 3 Talk 3 — Embedding a Deterministic BFT Protocol in a Block DAG Association for Computing…
8:30 PODC 2021 — Session 3 Talk 4 — Brief Announcement: Be Prepared When Network Goes Bad... Association for Computing…
10:01 PODC 2021 — Session 3 Talk 5 — Brief Announcement: Classifying Trusted Hardware via... Association for Computing…
9:25 PODC 2021 — Session 3 Talk 6 — Brief Announcement: Malicious Security Comes for Free... Association for Computing…
9:48 PODC 2021 — Session 3 Talk 7 — Brief Announcement: Brokering w/ Hashed Timelock Contracts is NP-Hard Association for Computing…
21:00 PODC 2021 — Session 4 Talk 1 — Low-Congestion Shortcuts in Constant Diameter Graphs Association for Computing…
21:47 PODC 2021 — Session 4 Talk 2 — Low-Congestion Shortcuts for Graphs Excluding Dense Minors Association for Computing…
19:01 PODC 2021 — Session 4 Talk 3 — Constant-Round Spanners and Shortest Paths in Congested Clique & MPC Association for Computing…
23:59 PODC 2021 — Session 4 Talk 5 — Can We Break Symmetry with o(m) Communication? Association for Computing…
10:00 PODC 2021 — Session 4 Talk 6 — Brief Announcement: On the Message Complexity of Fault-Tolerant... Association for Computing…
7:40 PODC 2021 — Session 5 Talk 1 — Locally Checkable Problems in Rooted Trees Association for Computing…
18:41 PODC 2021 — Session 5 Talk 2 — Strong-Diameter Network Decomposition Association for Computing…
18:57 PODC 2021 — Session 5 Talk 3 — Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree... Association for Computing…
18:21 PODC 2021 — Session 5 Talk 4 — On the Locality of Nash-Williams Forest Decomposition and... Association for Computing…
18:48 PODC 2021 — Session 5 Talk 5 — The Randomized Local Computation Complexity of the Lovász Local Lemma Association for Computing…
18:37 PODC 2021 — Session 6 Talk 1 — Breaking the O(sqrt n)-Bit Barrier: Byzantine Agreement with... Association for Computing…
21:31 PODC 2021 — Session 6 Talk 2 — Good-case Latency of Byzantine Broadcast: a Complete Categorization Association for Computing…
17:39 PODC 2021 — Session 6 Talk 3 — Revisiting Optimal Resilience of Fast Byzantine Consensus Association for Computing…
19:47 PODC 2021 — Session 6 Talk 4 — A New Way to Achieve Round-Efficient Byzantine Agreement Association for Computing…
19:52 PODC 2021 — Session 6 Talk 5 — Reaching Consensus for Asynchronous Distributed Key Generation Association for Computing…
9:40 PODC 2021 — Session 6 Talk 6 — Brief Announcement: Making Synchronous BFT Protocols Secure in... Association for Computing…
19:46 PODC 2021 — Session 7 Talk 1 — Approximate Byzantine Fault-Tolerance in Distributed Optimization Association for Computing…
18:42 PODC 2021 — Session 7 Talk 2 — Differential Privacy and Byzantine Resilience in SGD: Do They Add Up? Association for Computing…
16:22 PODC 2021 — Session 7 Talk 3 — Stochastic Coordination in Heterogeneous Load Balancing Systems Association for Computing…
24:09 PODC 2021 — Session 7 Talk 4 — The Topology of Randomized Symmetry-Breaking Distributed Computing Association for Computing…
9:43 PODC 2021 — Session 7 Talk 5 — Brief Announcement: Variants of Approximate Agreement on Graphs and.. Association for Computing…
9:13 PODC 2021 — Session 7 Talk 6 — Brief Announcement: A Randomness-efficient Massively Parallel... Association for Computing…
20:21 PODC 2021 — Session 8 Talk 1 — Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs Association for Computing…
20:11 PODC 2021 — Session 8 Talk 2 — Fault-Tolerant Labeling and Compact Routing Schemes Association for Computing…
20:01 PODC 2021 — Session 8 Talk 3 — Time-Optimal Construction of Overlay Networks Association for Computing…
19:50 PODC 2021 — Session 8 Talk 4 — Improved Deterministic (Δ+1) Coloring in Low-Space MPC Association for Computing…
18:44 PODC 2021 — Session 8 Talk 5 — Component Stability in Low-Space Massively Parallel Computation Association for Computing…
9:55 PODC 2021 — Session 8 Talk 6 — Brief Announcement: An Improved Distributed Approximate Single... Association for Computing…
16:10 PODC 2021 — Session 9 Talk 1 — Reductions and Extension-Based Proofs Association for Computing…
17:25 PODC 2021 — Session 9 Talk 2 — The Space Complexity of Scannable Binary Objects Association for Computing…
19:45 PODC 2021 — Session 9 Talk 3 — On Register Linearizability and Termination Association for Computing…
18:38 PODC 2021 — Session 9 Talk 4 — A Tight Lower Bound for the RMR Complexity of Recoverable Mutual... Association for Computing…
17:54 PODC 2021 — Session 9 Talk 5 — An Efficient Adaptive Partial Snapshot Implementation Association for Computing…
9:25 PODC 2021 — Session 9 Talk 6 — Brief Announcement: Detectable Sequential Specifications for... Association for Computing…
10:21 PODC 2021 — Session 9 Talk 7 — Brief Announcement: Linearizability: A Typo Association for Computing…
9:42 PODC 2021 — Session 9 Talk 8 — Brief Announcement: What's Live? Understanding Distributed Consensus Association for Computing…
