default search action
35th DISC 2021 Freiburg, Germany (Virtual Conference)
- Seth Gilbert:
35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference). LIPIcs 209, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-210-5 - Bernhard Haeupler:
The Quest for Universally-Optimal Distributed Algorithms (Invited Talk). 1:1-1:1 - Dahlia Malkhi:
Tech Transfer Stories and Takeaways (Invited Talk). 2:1-2:1 - Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui
, Dalia Papuc, Athanasios Xygkis, Igor Zablotchi:
Frugal Byzantine Computing. 3:1-3:19 - Dan Alistarh, Rati Gelashvili, Giorgi Nadiradze:
Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention. 4:1-4:17 - Ioannis Anagnostides, Themis Gouleakis:
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. 5:1-5:19 - Sepehr Assadi, Aditi Dudeja:
Ruling Sets in Random Order and Adversarial Streams. 6:1-6:18 - Hagit Attiya
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. 7:1-7:18 - Alkida Balliu
Locally Checkable Labelings with Small Messages. 8:1-8:18 - Gregor Bankhamer, Robert Elsässer, Stefan Schmid
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion. 9:1-9:19 - Leonid Barenboim, Tzalik Maimon:
Deterministic Logarithmic Completeness in the Distributed Sleeping Model. 10:1-10:19 - Denis Bédin, François Lépine, Achour Mostéfaoui, Damien Perez, Matthieu Perrin:
Wait-Free CAS-Based Algorithms: The Burden of the Past. 11:1-11:15 - Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun
Space and Time Bounded Multiversion Garbage Collection. 12:1-12:20 - Marthe Bonamy
A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs. 13:1-13:18 - Wentao Cai
Fast Nonblocking Persistence for Concurrent Data Structures. 14:1-14:20 - Mélanie Cambus, Davin Choo
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. 15:1-15:18 - Armando Castañeda, Miguel Piña:
Fully Read/Write Fence-Free Work-Stealing with Multiplicity. 16:1-16:20 - Jinyuan Chen:
Optimal Error-Free Multi-Valued Byzantine Agreement. 17:1-17:19 - Shir Cohen, Idit Keidar:
Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer. 18:1-18:18 - Varsha Dani
Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks. 19:1-19:14 - Joshua J. Daymude
The Canonical Amoebot Model: Algorithms and Concurrency Control. 20:1-20:19 - Michael Elkin, Yuval Gitlitz, Ofer Neiman:
Improved Weighted Additive Spanners. 21:1-21:15 - Adam Ganczorz
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. 22:1-22:20 - Yael Hitron, Merav Parter:
Broadcast CONGEST Algorithms against Adversarial Edges. 23:1-23:19 - Yael Hitron, Merav Parter:
General CONGEST Compilers against Adversarial Edges. 24:1-24:18 - Siddhartha Jayanti
Fast Arrays: Atomic Arrays with Constant Time Initialization. 25:1-25:19 - Muhammad Samir Khan, Nitin H. Vaidya:
Byzantine Consensus with Local Multicast Channels. 26:1-26:16 - Shay Kutten
Singularly Near Optimal Leader Election in Asynchronous Networks. 27:1-27:18 - Petr Kuznetsov, Yvonne-Anne Pignolet, Pavel Ponomarev, Andrei Tonkikh:
Permissionless and Asynchronous Asset Transfer. 28:1-28:19 - Nan Li, Wojciech M. Golab
Detectable Sequential Specifications for Recoverable Shared Objects. 29:1-29:19 - Liat Maor, Gadi Taubenfeld:
Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions. 30:1-30:16 - Yannic Maus
Efficient CONGEST Algorithms for the Lovász Local Lemma. 31:1-31:19 - Atsuki Momose, Ling Ren:
Optimal Communication Complexity of Authenticated Byzantine Agreement. 32:1-32:16 - Adir Morgan, Shay Solomon, Nicole Wein:
Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial. 33:1-33:19 - Gregory Schwartzman, Yuichi Sudo:
Smoothed Analysis of Population Protocols. 34:1-34:19 - Gali Sheffi, Maurice Herlihy, Erez Petrank:
VBR: Version Based Reclamation. 35:1-35:18 - Yilun Sheng, Faith Ellen
Extension-Based Proofs for Synchronous Message Passing. 36:1-36:17 - Lior Solodkin, Rotem Oshman:
Truthful Information Dissemination in General Asynchronous Networks. 37:1-37:19 - Alexander Spiegelman:
In Search for an Optimal Authenticated Byzantine Agreement. 38:1-38:19 - Lili Su, Quanquan C. Liu, Neha Narula:
The Power of Random Symmetry-Breaking in Nakamoto Consensus. 39:1-39:19 - Yuichi Sudo
Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols. 40:1-40:17 - Ranjani G. Sundaram, Himanshu Gupta, C. R. Ramakrishnan:
Efficient Distribution of Quantum Circuits. 41:1-41:20 - Paolo Zappalà, Marianna Belotti, Maria Potop-Butucaru, Stefano Secci:
Game Theoretical Framework for Analyzing Blockchains Robustness. 42:1-42:18 - Dan Alistarh, Rati Gelashvili, Joel Rybicki
Brief Announcement: Fast Graphical Population Protocols. 43:1-43:4 - Orestis Alpos, Christian Cachin, Luca Zanolini:
Brief Announcement: How to Trust Strangers - Composition of Byzantine Quorum Systems. 44:1-44:4 - Gal Assa, Hagar Meir, Guy Golan-Gueta, Idit Keidar, Alexander Spiegelman:
Brief Announcement: Using Nesting to Push the Limits of Transactional Data Structure Libraries. 45:1-45:4 - Shehar Bano, Alberto Sonnino, Andrey Chursin, Dmitri Perelman, Zekun Li, Avery Ching, Dahlia Malkhi:
Brief Announcement: Twins - BFT Systems Made Robust. 46:1-46:4 - Paul Bastide, Pierre Fraigniaud:
Brief Annoucement: On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models. 47:1-47:4 - Shreesha G. Bhat
Brief Announcement: Automating and Mechanising Cutoff Proofs for Parameterized Verification of Distributed Protocols. 48:1-48:4 - Nicolas Bousquet
Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes. 49:1-49:4 - Sebastian Brandt
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. 50:1-50:4 - Christian Cachin, Luca Zanolini:
Brief Announcement: Revisiting Signature-Free Asynchronous Byzantine Consensus. 51:1-51:4 - Bapi Chatterjee
Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. 52:1-52:4 - Vinicius Vielmo Cogo
Brief Announcement: Auditable Register Emulations. 53:1-53:4 - Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Brief Announcement: Accountability and Reconfiguration - Self-Healing Lattice Agreement. 54:1-54:5 - John Derrick
Brief Announcement: On Strong Observational Refinement and Forward Simulation. 55:1-55:4 - Panagiota Fatourou, Nikolaos D. Kallimanis
Brief Announcement: Persistent Software Combining. 56:1-56:4 - Guy Goren
Brief Announcement: Probabilistic Indistinguishability and The Quality of Validity in Byzantine Agreement. 57:1-57:4 - Janne H. Korhonen, Ami Paz
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. 58:1-58:4 - Ariel Livshits
Brief Announcement: Simple Majority Consensus in Networks with Unreliable Communication. 59:1-59:4 - Ruslan Nikolaev
Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation. 60:1-60:4 - William Schultz, Siyuan Zhou, Stavros Tripakis:
Brief Announcement: Design and Verification of a Logless Dynamic Reconfiguration Protocol in MongoDB Replication. 61:1-61:4 - Sravya Yandamuri, Ittai Abraham, Kartik Nayak, Michael K. Reiter:
Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption. 62:1-62:4 - Pouriya Zarbafian, Vincent Gramoli
Brief Announcement: Ordered Reliable Broadcast and Fast Ordered Byzantine Consensus for Cryptocurrency. 63:1-63:4
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-11-15 19:20 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: