Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPODC 2021: Virtual Event, Italy
- Avery Miller, Keren Censor-Hillel, Janne H. Korhonen:
PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021. ACM 2021, ISBN 978-1-4503-8548-0
Awards
- Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg:
2021 Edsger W. Dijkstra Prize in Distributed Computing. 1 - Marcos K. Aguilera, Hagit Attiya, Christian Cachin, Alessandro Panconesi:
2021 Principles of Distributed Computing Doctoral Dissertation Award. 3
Keynotes
- Cynthia Dwork:
Differential Privacy in Distributed Environments: An Overview and Open Questions. 5 - Kyle Kingsbury:
Elle: Finding Isolation Violations in Real-World Databases. 7
Session 1: Robots, Dynamics, and Population Protocols
- David G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro:
Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility. 9-19 - Karine Altisen, Stéphane Devismes, Anaïs Durand
, Colette Johnen, Franck Petit:
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. 21-31 - Janna Burman, Ho-Lin Chen, Hsueh-Ping Chen, David Doty, Thomas Nowak, Eric E. Severson, Chuan Xu:
Time-Optimal Self-Stabilizing Leader Election in Population Protocols. 33-44 - Philipp Czerner, Javier Esparza:
Lower Bounds on the State Complexity of Population Protocols. 45-54 - Dan Alistarh, Martin Töpfer, Przemyslaw Uznanski:
Comparison Dynamics in Population Protocols. 55-65 - Nan Kang, Frederik Mallmann-Trenn, Nicolás Rivera:
Diversity, Fairness, and Sustainability in Population Protocols. 67-76 - David Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Grzegorz Stachowiak, Przemyslaw Uznanski:
Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority. 77-80
Session 2: Biological Algorithms, Contention Resolution, and Radio Networks
- Andrea Clementi, Francesco D'Amore, George Giakkoupis, Emanuele Natale:
Search via Parallel Lévy Walks on Z2. 81-91 - Yuval Emek, Eyal Keren:
A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks. 93-102 - Fabien Dufoulon, Shay Kutten, William K. Moses Jr.:
Efficient Deterministic Leader Election for Programmable Matter. 103-113 - Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Decision Power of Weak Asynchronous Models of Distributed Computing. 115-125 - Seth Gilbert, Calvin Newport, Nitin H. Vaidya, Alex Weaver:
Contention Resolution with Predictions. 127-137 - Haimin Chen, Yonggang Jiang, Chaodong Zheng:
Tight Trade-off in Contention Resolution without Collision Detection. 139-149 - Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie:
Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks. 151-153
Session 3: Blockchains
- Yingjie Xue, Maurice Herlihy:
Hedging Against Sore Loser Attacks in Cross-Chain Transactions. 155-164 - Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, Alexander Spiegelman:
All You Need is DAG. 165-175 - Maria Anna Schett, George Danezis:
Embedding a Deterministic BFT Protocol in a Block DAG. 177-186 - Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman, Zhuolun Xiang:
Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. 187-190 - Naama Ben-David, Kartik Nayak:
Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication. 191-194 - Mark Abspoel, Thomas Attema, Matthieu Rambaud:
Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders. 195-198 - Eric Chan, Mohsen Lesani:
Brief Announcement: Brokering with Hashed Timelock Contracts is NP-Hard. 199-202
Session 4: Shortcuts, Spanners, and Message Complexity
- Shimon Kogan, Merav Parter:
Low-Congestion Shortcuts in Constant Diameter Graphs. 203-211 - Mohsen Ghaffari, Bernhard Haeupler:
Low-Congestion Shortcuts for Graphs Excluding Dense Minors. 213-221 - Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf:
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. 223-233 - Michael Elkin, Shaked Matar:
Ultra-Sparse Near-Additive Emulators. 235-246 - Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
Can We Break Symmetry with o(m) Communication? 247-257 - Manish Kumar, Anisur Rahaman Molla:
Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. 259-262
Session 5: Local Graph Problems
- Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko:
Locally Checkable Problems in Rooted Trees. 263-272 - Yi-Jun Chang, Mohsen Ghaffari:
Strong-Diameter Network Decomposition. 273-281 - Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. 283-293 - David G. Harris, Hsin-Hao Su, Hoa T. Vu:
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. 295-305 - Sebastian Brandt, Christoph Grunau, Václav Rozhon:
The Randomized Local Computation Complexity of the Lovász Local Lemma. 307-317
Session 6: Byzantine Agreement and Broadcast
- Elette Boyle, Ran Cohen, Aarushi Goel:
Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. 319-330 - Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Good-case Latency of Byzantine Broadcast: a Complete Categorization. 331-341 - Petr Kuznetsov, Andrei Tonkikh, Yan X. Zhang:
Revisiting Optimal Resilience of Fast Byzantine Consensus. 343-353 - Matthias Fitzi, Chen-Da Liu-Zhang, Julian Loss:
A New Way to Achieve Round-Efficient Byzantine Agreement. 355-362 - Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu:
Reaching Consensus for Asynchronous Distributed Key Generation. 363-373 - Justin Kim, Vandan Mehta, Kartik Nayak, Nibesh Shrestha:
Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. 375-377
Session 7: Distributed ML, Topology, and Parallel Algorithms
- Shuo Liu, Nirupam Gupta, Nitin H. Vaidya:
Approximate Byzantine Fault-Tolerance in Distributed Optimization. 379-389 - Rachid Guerraoui, Nirupam Gupta, Rafaël Pinot, Sébastien Rouault, John Stephan:
Differential Privacy and Byzantine Resilience in SGD: Do They Add Up? 391-401 - Guy Goren, Shay Vargaftik, Yoram Moses:
Stochastic Coordination in Heterogeneous Load Balancing Systems. 403-414 - Pierre Fraigniaud, Ran Gelles, Zvi Lotker:
The Topology of Randomized Symmetry-Breaking Distributed Computing. 415-425 - Jérémy Ledent:
Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes. 427-430 - Moses Charikar, Weiyun Ma, Li-Yang Tan:
Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity. 431-433
Session 8: Fault Tolerance, MPC, and Shortest Paths
- Greg Bodwin, Merav Parter:
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. 435-443 - Michal Dory, Merav Parter:
Fault-Tolerant Labeling and Compact Routing Schemes. 445-455 - Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, Julian Werthmann:
Time-Optimal Construction of Overlay Networks. 457-468 - Artur Czumaj, Peter Davies, Merav Parter:
Improved Deterministic (Δ+1) Coloring in Low-Space MPC. 469-479 - Artur Czumaj, Peter Davies, Merav Parter:
Component Stability in Low-Space Massively Parallel Computation. 481-491 - Nairen Cao, Jeremy T. Fineman, Katina Russell:
Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm. 493-496
Session 9: Concurrency and Shared Memory
- Kayman Brusse, Faith Ellen:
Reductions and Extension-Based Proofs. 497-507 - Sean Ovens:
The Space Complexity of Scannable Binary Objects. 509-519 - Vassos Hadzilacos, Xing Hu, Sam Toueg:
On Register Linearizability and Termination. 521-531 - David Yu Cheng Chan, Philipp Woelfel:
Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. 533-543 - Benyamin Bashari, Philipp Woelfel:
An Efficient Adaptive Partial Snapshot Implementation. 545-555 - Nan Li, Wojciech M. Golab:
Brief Announcement: Detectable Sequential Specifications for Recoverable Shared Objects. 557-560 - Gal Sela, Maurice Herlihy, Erez Petrank:
Brief Announcement: Linearizability: A Typo. 561-564 - Saksham Chand, Yanhong A. Liu:
Brief Announcement: What's Live? Understanding Distributed Consensus. 565-568
Tutorials
- John Augustine, Anisur Rahaman Molla, Gopal Pandurangan:
Byzantine Agreement and Leader Election: From Classical to the Modern. 569-571 - Nitin H. Vaidya:
Security and Privacy for Distributed Optimization & Distributed Machine Learning. 573 - Amit K. Chopra, Samuel H. Christie V., Munindar P. Singh:
Interaction-Oriented Programming: An Application Semantics Approach for Engineering Decentralized Applications. 575-576
a service of 
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-05-31 18:51 CEST 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:
