PODC 2021 — Session 1 Talk 5 — Fast and Robust Comparison Dynamics in Population Protocols
PODC 2021 Keynote: Cynthia Dwork
PODC 2021 Keynote: Kyle Kingsbury
PODC 2021 — Session 1 Talk 7 — Brief Announcement: A Time and Space Optimal Stable Population Pr...
PODC 2021 — Session 1 Talk 1 — Separating Bounded and Unbounded Asynchrony for Autonomous Robots...
PODC 2021 — Session 1 Talk 3 — Time-Optimal Self-Stabilizing Leader Election in Population Protocols
PODC 2021 — Session 3 Talk 3 — Embedding a Deterministic BFT Protocol in a Block DAG
PODC 2021 — Session 7 Talk 1 — Approximate Byzantine Fault-Tolerance in Distributed Optimization
PODC 2021 — Session 7 Talk 4 — The Topology of Randomized Symmetry-Breaking Distributed Computing
PODC 2021 — Session 2 Talk 3 — Efficient Deterministic Leader Election for Programmable Matter
PODC 2021 — Session 4 Talk 1 — Low-Congestion Shortcuts in Constant Diameter Graphs
PODC 2021 — Session 1 Talk 4 — Lower Bounds on the State Complexity of Population Protocols
PODC 2021 — Session 2 Talk 6 — Tight Trade-off in Contention Resolution without Collision Detection
PODC 2021 — Session 1 Talk 6 — Diversity, Fairness and Sustainability in Population Protocols
PODC 2021 Gem Session: Naama Ben-David
PODC 2021 — Session 2 Talk 1 — Search via Parallel Lévy Walks on Z^2
PODC 2021 Gem Session: Laurent Feuilloley
PODC 2021 — Session 2 Talk 4 — Decision Power of Weak Asynchronous Models of Distributed Computing
PODC 2021 — Session 9 Talk 1 — Reductions and Extension-Based Proofs
PODC 2021 — Session 7 Talk 2 — Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?