default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPODC 2022: Salerno, Italy
- Alessia Milani, Philipp Woelfel:
PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022. ACM 2022, ISBN 978-1-4503-9262-4
Awards
- Marcos Aguiliera, Andréa W. Richa, Alexander A. Schwarzmann
, Alessandro Panconesi, Christian Scheideler, Philipp Woelfel:
2022 Edsger W. Dijkstra Prize in Distributed Computing. 1 - Yehuda Afek, Keren Censor-Hillel, Pierre Fraigniaud, Seth Gilbert, Gopal Pandurangan, Gadi Taubenfeld:
2022 Principles of Distributed Computing Doctoral Dissertation Award. 2
Keynote 1
- Michael L. Scott:
How Should We Think about Persistent Data Structures? 3
Session 1
- Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti:
Node and Edge Averaged Complexities of Local Graph Problems. 4-14 - Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Edge Coloring in Time Polylogarithmic in Δ. 15-25 - Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan:
Overcoming Congestion in Distributed Coloring. 26-36 - Christoph Grunau, Václav Rozhon, Sebastian Brandt:
The Landscape of Distributed Complexities on Trees and Beyond. 37-47 - Eden Aldema Tshuva, Rotem Oshman:
Brief Announcement: On Polynomial-Time Local Decision. 48-50 - John Augustine, William K. Moses Jr., Gopal Pandurangan:
Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. 51-53 - Antoine El-Hayek, Monika Henzinger, Stefan Schmid:
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. 54-56 - Michael Elkin, Chhaya Trehan:
Brief Announcement: (1+ε)-Approximate Shortest Paths in Dynamic Streams. 57-59
Session 2
- Christoph Lenzen, Sahar Sheikholeslami:
A Recursive Early-Stopping Phase King Protocol. 60-69 - Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer:
Optimal Synchronous Approximate Agreement with Asynchronous Fallback. 70-80 - Jan Camenisch, Manu Drijvers, Timo Hanke, Yvonne-Anne Pignolet, Victor Shoup, Dominic Williams:
Internet Computer Consensus. 81-91 - Ananya Appan, Anirudh Chandramouli, Ashish Choudhury:
Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. 92-102 - Luciano Freitas de Souza, Petr Kuznetsov, Andrei Tonkikh:
Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup. 103-105 - Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski:
Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency. 106-108
Session 3
- Joran van Apeldoorn, Tijn de Vos:
A Framework for Distributed Quantum Queries in the CONGEST Model. 109-119 - Xudong Wu, Penghui Yao:
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. 120-130 - Laurent Feuilloley, Nicolas Bousquet, Théo Pierron:
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. 131-140 - Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Distributed Computations in Fully-Defective Networks. 141-150 - Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon:
Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. 151-162
Keynote 2
- Seny Kamara:
Encrypted Distributed Systems. 163
Session 4
- Dimitrios Los, Thomas Sauerwald:
Balanced Allocations with the Choice of Noise. 164-175 - Sean Ovens:
The Space Complexity of Consensus from Swap. 176-186 - Naama Ben-David, Guy E. Blelloch:
Fast and Fair Randomized Wait-Free Locks. 187-197 - Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert:
When is Recoverable Consensus Harder Than Consensus? 198-208 - Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations. 209-219 - Xialin Liu, Wojciech M. Golab:
Brief Announcement: Towards a Theory of Wear Leveling in Persistent Data Structures. 220-223
Session 5
- Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. 224-234 - Amos Korman, Robin Vacus:
Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication. 235-245 - Dan Alistarh, Joel Rybicki, Sasha Voitovych:
Near-Optimal Leader Election in Population Protocols on Graphs. 246-256 - Jérôme Leroux:
State Complexity of Protocols with Leaders. 257-264 - Lewis Tseng, Qinzi Zhang:
Brief Announcement: Computability and Anonymous Storage-Efficient Consensus with an Abstract MAC Layer. 265-267 - Pierre Sutra:
Brief Announcement: The Weakest Failure Detector for Genuine Atomic Multicast. 268-270
Session 6
- Keren Censor-Hillel, Dean Leitersdorf, David Vulakh:
Deterministic Near-Optimal Distributed Listing of Cliques. 271-280 - Mohsen Ghaffari, Goran Zuzic:
Universally-Optimal Distributed Exact Min-Cut. 281-291 - Michal Dory, Mohsen Ghaffari, Saeed Ilchi:
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. 292-300 - Yi-Jun Chang, Hsin-Hao Su:
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. 301-312 - Rachit Agarwal, Shijin Rajakrishnan, David B. Shmoys:
From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good. 313-323
Keynote 3
- Merav Parter:
A Graph Theoretic Approach for Resilient Distributed Algorithms. 324
Session 7
- Shiri Chechik, Tianyi Zhang:
Constant-Round Near-Optimal Spanners in Congested Clique. 325-334 - Sebastian Forster, Tijn de Vos:
The Laplacian Paradigm in the Broadcast Congested Clique. 335-344 - Orr Fischer, Adi Horowitz, Rotem Oshman:
Massively Parallel Computation in a Heterogeneous Regime. 345-355 - Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic:
A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees. 356-365 - Shreyas Pai, Sriram V. Pemmaraju:
Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets. 366-368 - Vignesh Manoharan, Vijaya Ramachandran:
Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. 369-371 - Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. 372-374 - Jion Hirose, Junya Nakamura, Fukuhito Ooshita, Michiko Inoue:
Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents. 375-377 - Pierre Civit, Maria Potop-Butucaru:
Brief Announcement: Probabilistic Dynamic Input/Output Automata. 378-380
Session 8
- Ittai Abraham, Naama Ben-David, Sravya Yandamuri:
Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement. 381-391 - Ittai Abraham, Gilad Asharov:
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security. 392-398 - Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang:
Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. 399-417 - Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang:
Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. 418-420 - Shir Cohen, Idit Keidar, Alexander Spiegelman:
Brief Announcement: Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words. 421-423 - Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder:
Brief Announcement: Holistic Verification of Blockchain Consensus. 424-426 - João Paulo Bezerra, Petr Kuznetsov:
Brief Announcement: How to Tame Multiple Spending in Decentralized Cryptocurrencies. 427-429
Session 9
- Dario Catalano, Dario Fiore, Emanuele Giunta:
Adaptively Secure Single Secret Leader Election from DDH. 430-439 - Christoph Lenzen, Julian Loss:
Optimal Clock Synchronization with Signatures. 440-449 - Naama Ben-David, Benjamin Y. Chan, Elaine Shi:
Revisiting the Power of Non-Equivocation in Distributed Protocols. 450-459
Session 10
- Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. 460-470 - Sergio Rajsbaum, Armajac Raventós-Pujol:
A Distributed Combinatorial Topology Approach to Arrow's Impossibility Theorem. 471-481 - Shankaranarayanan Krishna, Adwait Godbole, Roland Meyer, Soham Chakraborty:
Parameterized Verification under Release Acquire is PSPACE-complete. 482-492 - Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie:
Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle. 493-495
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-10-31 20:03 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:
