default search action
34th DISC 2020 (Virtual Conference)
- Hagit Attiya
:
34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference. LIPIcs 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-168-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Sepehr Assadi, Aaron Bernstein, Zachary Langley
Improved Bounds for Distributed Load Balancing. 1:1-1:15 - Arik Rinberg, Idit Keidar:
Intermediate Value Linearizability: A Quantitative Correctness Criterion. 2:1-2:17 - Vitaly Aksenov
The Splay-List: A Distribution-Adaptive Concurrent Skip-List. 3:1-3:18 - Rachid Guerraoui
Efficient Multi-Word Compare and Swap. 4:1-4:19 - Guy E. Blelloch
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS. 5:1-5:17 - Talley Amir
Message Complexity of Population Protocols. 6:1-6:18 - Da-Jung Cho
Distributed Computation with Continual Population Growth. 7:1-7:17 - Aurélien Bellet, Rachid Guerraoui
Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols. 8:1-8:18 - George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald:
Spread of Information and Diseases via Random Walks in Sparse Graphs. 9:1-9:17 - Yael Hitron, Cameron Musco, Merav Parter:
Spiking Neural Networks Through the Lens of Streaming Algorithms. 10:1-10:18 - Xavier Défago
Communication Efficient Self-Stabilizing Leader Election. 11:1-11:19 - Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi:
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. 12:1-12:17 - Sebastian Brandt
Tight Bounds for Deterministic High-Dimensional Grid Exploration. 13:1-13:16 - Guy Goren
Distributed Dispatching in the Parallel Server Model. 14:1-14:18 - Hsin-Hao Su, Hoa T. Vu
Distributed Dense Subgraph Detection and Low Outdegree Orientation. 15:1-15:18 - Yannic Maus, Tigran Tonoyan:
Local Conflict Coloring Revisited: Linial for Lists. 16:1-16:18 - Alkida Balliu
Classification of Distributed Binary Labeling Problems. 17:1-17:17 - Yi-Jun Chang
The Complexity Landscape of Distributed Locally Checkable Problems on Trees. 18:1-18:17 - Ofer Grossman, Seri Khoury, Ami Paz
Improved Hardness of Approximation of Diameter in the CONGEST Model. 19:1-19:16 - Yuval Emek, Yuval Gil:
Twenty-Two New Approximate Proof Labeling Schemes. 20:1-20:14 - Merav Parter:
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers. 21:1-21:17 - Shay Kutten
Singularly Optimal Randomized Leader Election. 22:1-22:18 - Manuel Bravo, Gregory V. Chockler
Making Byzantine Consensus Live. 23:1-23:17 - Tuanir França Rezende, Pierre Sutra
Leaderless State-Machine Replication: Specification, Properties, Limits. 24:1-24:17 - Shir Cohen, Idit Keidar, Alexander Spiegelman:
Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP. 25:1-25:17 - Oded Naor, Idit Keidar:
Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR. 26:1-26:17 - Petr Kuznetsov, Andrei Tonkikh:
Asynchronous Reconfiguration with Byzantine Failures. 27:1-27:17 - Kartik Nayak, Ling Ren
Improved Extension Protocols for Byzantine Broadcast and Agreement. 28:1-28:17 - Diana Ghinea
From Partial to Global Asynchronous Reliable Broadcast. 29:1-29:16 - Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski:
Fast Agreement in Networks with Byzantine Nodes. 30:1-30:18 - John Augustine
Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols. 31:1-31:19 - Xiong Zheng, Vijay K. Garg:
Byzantine Lattice Agreement in Synchronous Message Passing Systems. 32:1-32:16 - Keren Censor-Hillel
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. 33:1-33:17 - Mohsen Ghaffari, Christoph Grunau
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. 34:1-34:18 - Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman:
Improved Distributed Approximations for Maximum Independent Set. 35:1-35:16 - Uri Meir, Ami Paz
Models of Smoothing in Dynamic Networks. 36:1-36:16 - Mohamad Ahmadi, Fabian Kuhn:
Distributed Maximum Matching Verification in CONGEST. 37:1-37:18 - Merav Parter:
Distributed Planar Reachability in Nearly Optimal Time. 38:1-38:17 - Magnús M. Halldórsson, Fabian Kuhn
Coloring Fast Without Learning Your Neighbors' Colors. 39:1-39:17 - Sebastian Brandt
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. 40:1-40:3 - Yi-Jun Chang
Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens. 41:1-41:3 - Emilio Cruciani
Brief Announcement: Phase Transitions of the k-Majority Dynamics in a Biased Communication Model. 42:1-42:3 - Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Brief Announcement: Distributed Quantum Proofs for Replicated Data. 43:1-43:3 - Ashish Choudhury
Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited. 44:1-44:3 - Pierre Civit
Brief Announcement: Polygraph: Accountable Byzantine Agreement. 45:1-45:3 - Klaus-Tycho Foerster
Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally. 46:1-46:3 - Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency. 47:1-47:3 - Martin Hirt, Ard Kastrati, Chen-Da Liu-Zhang
Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus. 48:1-48:3 - Paolo Zappalà, Marianna Belotti, Maria Potop-Butucaru, Stefano Secci:
Brief Announcement: Game Theoretical Framework for Analyzing Blockchains Robustness. 49:1-49:3 - Dolev Adas, Roy Friedman:
Brief Announcement: Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue. 50:1-50:3 - Guy E. Blelloch
Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time. 51:1-51:3 - Haosen Wen, Wentao Cai
Brief Announcement: Building Fast Recoverable Persistent Data Structures with Montage. 52:1-52:3 - Lewis Tseng, Qinzi Zhang, Yifan Zhang:
Brief Announcement: Reaching Approximate Consensus When Everyone May Crash. 53:1-53:3 - Petr Kuznetsov, Thibault Rieutord:
Brief Announcement: On Decidability of 2-Process Affine Models. 54:1-54: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 2025-03-11 19:49 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: