default search action
32nd DISC 2018: New Orleans, LA, USA
- Ulrich Schmid, Josef Widder:
32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018. LIPIcs 121, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-092-7 - Front Matter, Table of Contents, Preface, Conference Organization, Awards. 0:i-0:xx
- Sándor P. Fekete:
Autonomous Vehicles: From Individual Navigation to Challenges of Distributed Swarms (Invited Talk). 1:1-1:1 - Tom Goldstein:
Challenges for Machine Learning on Distributed Platforms (Invited Talk). 2:1-2:3 - Michael Mendler:
Logical Analysis of Distributed Systems: The Importance of Being Constructive (Invited Talk). 3:1-3:1 - Yehuda Afek, Yuval Emek, Noa Kolikant:
Selecting a Leader in a Network of Finite State Machines. 4:1-4:17 - Yehuda Afek, Shaked Rafaeli, Moshe Sulamy:
The Role of A-priori Information in Networks of Rational Agents. 5:1-5:18 - Mohamad Ahmadi, Fabian Kuhn, Rotem Oshman:
Distributed Approximate Maximum Matching in the CONGEST Model. 6:1-6:17 - Karolos Antoniadis, Rachid Guerraoui
, Dahlia Malkhi, Dragos-Adrian Seredinschi:
State Machine Replication Is More Expensive Than Consensus. 7:1-7:18 - James Aspnes, Bernhard Haeupler, Alexander Tong
Allocate-On-Use Space Complexity of Shared-Memory Algorithms. 8:1-8:17 - Alkida Balliu
Almost Global Problems in the LOCAL Model. 9:1-9:16 - Petra Berenbrink, Robert Elsässer, Tom Friedetzky
A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. 10:1-10:18 - Alon Berger, Idit Keidar, Alexander Spiegelman:
Integrated Bounds for Disintegrated Storage. 11:1-11:18 - Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela
Distributed Recoloring. 12:1-12:17 - Sebastian Brandt, Jara Uitto, Roger Wattenhofer:
A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration. 13:1-13:17 - Gregory V. Chockler
Multi-Shot Distributed Transaction Commit. 14:1-14:18 - Artur Czumaj, Peter Davies
Deterministic Blind Radio Networks. 15:1-15:17 - Artur Czumaj, Christian Konrad:
Detecting Cliques in CONGEST Networks. 16:1-16:15 - Eli Daian, Giuliano Losa, Yehuda Afek, Eli Gafni:
A Wealth of Sub-Consensus Deterministic Objects. 17:1-17:17 - Henry Daly, Ahmed Hassan, Michael F. Spear
NUMASK: High Performance Scalable Skip List for NUMA. 18:1-18:19 - Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta:
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications. 19:1-19:18 - Fabien Dufoulon
Beeping a Deterministic Time-Optimal Leader Election. 20:1-20:17 - Aryaz Eghbali
An Almost Tight RMR Lower Bound for Abortable Test-And-Set. 21:1-21:19 - Guy Even, Mohsen Ghaffari, Moti Medina:
Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. 22:1-22:14 - Yotam M. Y. Feldman
Order out of Chaos: Proving Linearizability Using Local Views. 23:1-23:21 - Laurent Feuilloley
Redundancy in Distributed Proofs. 24:1-24:18 - Laurent Feuilloley
Local Verification of Global Proofs. 25:1-25:17 - Manuela Fischer, Mohsen Ghaffari:
A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. 26:1-26:11 - Matthias Függer
Fast Multidimensional Asymptotic and Approximate Consensus. 27:1-27:16 - Pawel Garncarek
Local Queuing Under Contention. 28:1-28:18 - Mohsen Ghaffari, Fabian Kuhn:
Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set. 29:1-29:17 - Mohsen Ghaffari, Fabian Kuhn:
Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping. 30:1-30:12 - Mohsen Ghaffari, Jason Li:
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. 31:1-31:16 - Robert Gmyr, Gopal Pandurangan
Time-Message Trade-Offs in Distributed Algorithms. 32:1-32:18 - Bernhard Haeupler, Jason Li:
Faster Distributed Shortest Path Approximations via Shortcuts. 33:1-33:14 - Yael Tauman Kalai, Ilan Komargodski, Ran Raz
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. 34:1-34:16 - Ken-ichi Kawarabayashi, Gregory Schwartzman:
Adapting Local Sequential Algorithms to the Distributed Setting. 35:1-35:17 - Julian Loss, Ueli Maurer, Daniel Tschudi
Strong Separations Between Broadcast and Authenticated Channels. 36:1-36:17 - Ali Mashreghi, Valerie King:
Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model. 37:1-37:17 - Calvin Newport, Peter Robinson:
Fault-Tolerant Consensus with an Abstract MAC Layer. 38:1-38:20 - Merav Parter, Hsin-Hao Su:
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds. 39:1-39:18 - Merav Parter, Eylon Yogev:
Congested Clique Algorithms for Graph Spanners. 40:1-40:18 - Xiong Zheng, Changyong Hu, Vijay K. Garg:
Lattice Agreement in Message Passing Systems. 41:1-41:17 - Philipp Bamberger, Fabian Kuhn, Yannic Maus:
Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks. 42:1-42:4 - Artur Czumaj, Peter Davies
Brief Announcement: Randomized Blind Radio Networks. 43:1-43:3 - Gianluca De Marco, Dariusz R. Kowalski, Grzegorz Stachowiak
Brief Announcement: Deterministic Contention Resolution on a Shared Channel. 44:1-44:3 - Simon Doherty, Brijesh Dongol
Brief Announcement: Generalising Concurrent Correctness to Weak Memory. 45:1-45:3 - David Doty, Mahsa Eftekhari
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. 46:1-46:3 - Reginald Frank
Brief Announcement: A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids. 47:1-47:3 - Seth Gilbert
Brief Announcement: On Simple Back-Off in Unreliable Radio Networks. 48:1-48:3 - Shreyas Gokhale, Neeraj Mittal:
Brief Announcement: Fast and Scalable Group Mutual Exclusion. 49:1-49:3 - Éric Goubault, Jérémy Ledent
Brief Announcement: On the Impossibility of Detecting Concurrency. 50:1-50:4 - Dimitris Sakavalas, Lewis Tseng, Nitin H. Vaidya:
Brief Announcement: Effects of Topology Knowledge and Relay Depth on Asynchronous Consensus. 51:1-51:4 - Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time. 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 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: