default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd DISC 2019: Budapest, Hungary
- Jukka Suomela:
33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary. LIPIcs 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-126-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- James Aspnes, Heyang Er:
Consensus with Max Registers. 1:1-1:9 - Hagit Attiya
, Constantin Enea:
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent Objects. 2:1-2:17 - Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
Long-Lived Counters with Polylogarithmic Amortized Step Complexity. 3:1-3:16 - Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Distributed Algorithms for Low Stretch Spanning Trees. 4:1-4:14 - Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. 5:1-5:15 - Ran Ben-Basat, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Parameterized Distributed Algorithms. 6:1-6:16 - Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Message Reduction in the LOCAL Model Is a Free Lunch. 7:1-7:15 - Mark Braverman, Gillat Kol, Rotem Oshman, Avishay Tal:
On the Computational Power of Radio Channels. 8:1-8:17 - Janna Burman, Joffroy Beauquier, Devan Sohier:
Space-Optimal Naming in Population Protocols. 9:1-9:16 - Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Erasure Correction for Noisy Radio Networks. 10:1-10:17 - Shiri Chechik, Doron Mukhtar:
Reachability and Shortest Paths in the Broadcast CONGEST Model. 11:1-11:13 - Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky:
On the Round Complexity of Randomized Byzantine Agreement. 12:1-12:17 - Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Trade-Offs in Distributed Interactive Proofs. 13:1-13:17 - Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver:
The Capacity of Smartphone Peer-To-Peer Networks. 14:1-14:17 - Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. 15:1-15:16 - Orr Fischer, Rotem Oshman:
A Distributed Algorithm for Directed Minimum-Weight Spanning Tree. 16:1-16:16 - Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Stable Memoryless Queuing under Contention. 17:1-17:16 - Mohsen Ghaffari, Julian Portmann:
Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond. 18:1-18:16 - Seth Gilbert, James Maguire, Calvin Newport:
On Bioelectric Algorithms. 19:1-19:17 - Seth Gilbert, Wei Quan Lim:
Parallel Finger Search Structures. 20:1-20:18 - Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum:
Wait-Free Solvability of Equality Negation Tasks. 21:1-21:16 - Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi:
Scalable Byzantine Reliable Broadcast. 22:1-22:16 - Kristian Hinnenthal, Christian Scheideler, Martijn Struijs:
Fast Distributed Algorithms for LP-Type Problems of Low Dimension. 23:1-23:16 - Artem Khyzha, Hagit Attiya, Alexey Gotsman:
Privatization-Safe Transactional Memories. 24:1-24:17 - Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-Congestion Shortcut and Graph Parameters. 25:1-25:17 - Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
The Complexity of Symmetry Breaking in Massive Graphs. 26:1-26:18 - Giuliano Losa, Eli Gafni, David Mazières:
Stellar Consensus by Instantiation. 27:1-27:15 - Ruslan Nikolaev:
A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue. 28:1-28:16 - Thomas Nowak, Joel Rybicki:
Byzantine Approximate Agreement on Graphs. 29:1-29:17 - Merav Parter:
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach. 30:1-30:16 - Adones Rukundo, Aras Atalar, Philippas Tsigas:
Monotonically Relaxing Concurrent Data-Structure Semantics for Increasing Performance: An Efficient 2D Design Framework. 31:1-31:15 - Nobutaka Shimizu, Takeharu Shiraga:
Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models. 32:1-32:17 - Hsin-Hao Su, Hoa T. Vu:
Distributed Data Summarization in Well-Connected Networks. 33:1-33:16 - Mohammad Taheri, Arash Pourdamghani, Mohsen Lesani:
Polynomial-Time Fence Insertion for Structured Programs. 34:1-34:17 - Chen Avin, Iosif Salem, Stefan Schmid:
Brief Announcement: On Self-Adjusting Skip List Networks. 35:1-35:3 - Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. 36:1-36:3 - Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Brief Announcement: Memory Lower Bounds for Self-Stabilization. 37:1-37:3 - Grégoire Bonin, Achour Mostéfaoui, Matthieu Perrin:
Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model. 38:1-38:3 - Christian Cachin, Björn Tackmann:
Brief Announcement: Asymmetric Distributed Trust. 39:1-39:3 - Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas C. Nicolaou:
Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects. 40:1-40:3 - Xavier Défago, Adam Heriban, Sébastien Tixeuil, Koichi Wada:
Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space. 41:1-41:3 - Michael Dinitz, Yasamin Nazari:
Brief Announcement: Massively Parallel Approximate Distance Sketches. 42:1-42:3 - Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada:
Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots. 43:1-43:3 - Suyash Gupta, Jelle Hellings, Mohammad Sadoghi:
Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization. 44:1-44:3 - Jelle Hellings, Mohammad Sadoghi:
Brief Announcement: The Fault-Tolerant Cluster-Sending Problem. 45:1-45:3 - Masoomeh Javidi Kishi, Ahmed Hassan, Roberto Palmieri:
Brief Announcement: On the Correctness of Transaction Processing with External Dependency. 46:1-46:3 - Chen-Da Liu Zhang, Varun Maram, Ueli Maurer:
Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models. 47:1-47:3 - Nancy A. Lynch, Mien Brabeeba Wang:
Brief Announcement: Integrating Temporal Information to Spatial Information in a Neural Circuit. 48:1-48:3 - Ali Mashreghi, Valerie King:
Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication. 49:1-49: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-01-30 20:19 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:
