default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th DISC 2022: Augusta, GA, USA
- Christian Scheideler
:
36th International Symposium on Distributed Computing, DISC 2022, Augusta, Georgia, USA, October 25-27, 2022. LIPIcs 246, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-255-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Sepehr Assadi:
Graph Coloring, Palette Sparsification, and Beyond (Invited Talk). 1:1-1:1 - Roberto Baldoni:
Managing the Cyber Risk in a Decoupled World: Does This Bring Potential Opportunities in Computer Science? (Invited Talk). 2:1-2:1 - Jennifer L. Welch:
Using Linearizable Objects in Randomized Concurrent Programs (Invited Talk). 3:1-3:1 - Timothé Albouy, Davide Frey, Michel Raynal, François Taïani:
Good-Case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case. 4:1-4:22 - Gal Amram, Avi Hayoun, Lior Mizrahi, Gera Weiss:
Polynomial-Time Verification and Testing of Implementations of the Snapshot Data Structure. 5:1-5:20 - Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. 6:1-6:20 - John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, Yadu Vasudev:
Byzantine Connectivity Testing in the Congested Clique. 7:1-7:21 - Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela:
Efficient Classification of Locally Checkable Problems in Regular Trees. 8:1-8:19 - Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Exponential Speedup over Locality in MPC with Optimal Memory. 9:1-9:21 - Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder:
Holistic Verification of Blockchain Consensus. 10:1-10:24 - Subhash Bhagat, Andrzej Pelc:
How to Meet at a Node of Any Connected Graph. 11:1-11:16 - Manuel Bravo, Gregory V. Chockler, Alexey Gotsman:
Liveness and Latency of Byzantine State-Machine Replication. 12:1-12:19 - Martina Camaioni, Rachid Guerraoui, Matteo Monti, Manuel Vidigueira:
Oracular Byzantine Reliable Broadcast. 13:1-13:19 - Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira:
Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony! 14:1-14:21 - Pierre Civit, Maria Potop-Butucaru:
Dynamic Probabilistic Input Output Automata. 15:1-15:18 - Varsha Dani, Thomas P. Hayes:
How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. 16:1-16:22 - Gianluca De Marco, Dariusz R. Kowalski, Grzegorz Stachowiak:
Contention Resolution Without Collision Detection: Constant Throughput And Logarithmic Energy. 17:1-17:21 - Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport:
Smoothed Analysis of Information Spreading in Dynamic Networks. 18:1-18:22 - Fabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg:
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. 19:1-19:24 - Yuval Emek, Yuval Gil, Shay Kutten:
Locally Restricted Proof Labeling Schemes. 20:1-20:22 - David Eppstein, Hadi Khodabandeh:
Distributed Construction of Lightweight Spanners for Unit Ball Graphs. 21:1-21:23 - Manuela Fischer, Jeff Giliberti, Christoph Grunau:
Improved Deterministic Connectivity in Massively Parallel Computation. 22:1-22:17 - Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie:
Fault Tolerant Coloring of the Asynchronous Cycle. 23:1-23:22 - Luciano Freitas de Souza, Petr Kuznetsov, Andrei Tonkikh:
Distributed Randomness from Approximate Agreement. 24:1-24:21 - Chryssis Georgiou, Nicolas Nicolaou, Andria Trigeorgi:
Fragmented ARES: Dynamic Storage for Large Objects. 25:1-25:24 - Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin:
Fast Distributed Vertex Splitting with Applications. 26:1-26:24 - Yael Hitron, Merav Parter, Eylon Yogev:
Broadcast CONGEST Algorithms Against Eavesdroppers. 27:1-27:19 - Fabian Kuhn, Philipp Schneider:
Routing Schemes and Distance Oracles in the Hybrid Model. 28:1-28:22 - Oded Naor, Idit Keidar:
On Payment Channels in Asynchronous Money Transfer Systems. 29:1-29:20 - Sean Ovens:
The Space Complexity of Scannable Objects with Bounded Components. 30:1-30:18 - Merav Parter, Asaf Petruschka:
Near-Optimal Distributed Computation of Small Vertex Cuts. 31:1-31:21 - Merav Parter, Asaf Petruschka:
Õptimal Dual Vertex Failure Connectivity Labels. 32:1-32:19 - Youer Pu, Lorenzo Alvisi, Ittay Eyal:
Safe Permissionless Consensus. 33:1-33:15 - Will Rosenbaum:
Packet Forwarding with a Locally Bursty Adversary. 34:1-34:18 - Pierre Sutra:
The Weakest Failure Detector for Genuine Atomic Multicast. 35:1-35:19 - Xing Hu, Sam Toueg:
On Implementing SWMR Registers from SWSR Registers in Systems with Byzantine Failures. 36:1-36:19 - Anatoliy Zinovyev:
Space-Stretch Tradeoff in Routing Revisited. 37:1-37:16 - Ittai Abraham, Danny Dolev, Alon Kagan, Gilad Stern:
Brief Announcement: Authenticated Consensus in Synchronous Systems with Mixed Faults. 38:1-38:3 - Ittai Abraham, Natacha Crooks, Neil Giridharan, Heidi Howard, Florian Suri-Payer:
Brief Announcement: It's not easy to relax: liveness in chained BFT protocols. 39:1-39:3 - Sharareh Alipour, Mohammadhadi Salari:
Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach. 40:1-40:3 - Naama Ben-David, Michal Friedman, Yuanhao Wei:
Brief Announcement: Survey of Persistent Memory Correctness Conditions. 41:1-41:4 - Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Stefan Schmid:
Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies. 42:1-42:3 - Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca:
Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks. 43:1-43:3 - Leszek Gasieniec, Paul G. Spirakis, Grzegorz Stachowiak:
Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols. 44:1-44:3 - Rosina Kharal, Trevor Brown:
Brief Announcement: Performance Anomalies in Concurrent Data Structure Microbenchmarks. 45:1-45:3 - Yonghwan Kim, Masahiro Shibata, Yuichi Sudo, Junya Nakamura, Yoshiaki Katayama, Toshimitsu Masuzawa:
Brief Announcement: Gathering Despite Defected View. 46:1-46:3 - Irina Kostitsyna, Tom Peters, Bettina Speckmann:
Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter. 47:1-47:3 - François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Brief Announcement: Distributed Quantum Interactive Proofs. 48:1-48:3 - Raïssa Nataf, Guy Goren, Yoram Moses:
Brief Announcement: Null Messages, Information and Coordination. 49:1-49:3 - Jacob Nelson-Slivon, Lewis Tseng, Roberto Palmieri:
Brief Announcement: Asymmetric Mutual Exclusion for RDMA. 50:1-50:3 - Shunhao Oh, Dana Randall, Andréa W. Richa:
Brief Announcement: Foraging in Particle Systems via Self-Induced Phase Changes. 51:1-51:3 - Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko:
Brief Announcement: Temporal Locality in Online Algorithms. 52:1-52:3
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 2026-09-02 23:16 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
