default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th DISC 2016: Paris, France
- Cyril Gavoille, David Ilcinkas:
Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. Lecture Notes in Computer Science 9888, Springer 2016, ISBN 978-3-662-53425-0 - Ioannis Lamprou
, Russell Martin, Sven Schewe:
Fast Two-Robot Disk Evacuation with Wireless Communication. 1-15 - Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Deterministic Leader Election in O(D+\log n) Time with Messages of Size O(1). 16-28 - Amir Abboud, Keren Censor-Hillel, Seri Khoury:
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. 29-42 - Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast Distributed Algorithms for Testing Graph Properties. 43-56 - François Le Gall:
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems. 57-70 - Christian Scheideler, Alexander Setzer, Thim Strothmann:
Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. 71-84 - Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Asynchronous Embedded Pattern Formation Without Orientation. 85-98 - Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger:
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model. 99-113 - Pavol Cerný, Nate Foster, Nilesh Jagnik, Jedidiah McClurg:
Optimal Consistent Network Updates in Polynomial Time. 114-128 - Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed Construction of Purely Additive Spanners. 129-142 - Rachid Guerraoui, Jingjing Wang:
Optimal Fair Computation. 143-157 - Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. 158-172 - Zohir Bouzid, Corentin Travers:
Anonymity-Preserving Failure Detectors. 173-186 - Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots. 187-200 - Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela:
Non-local Probes Do Not Help with Many Graph Problems. 201-214 - Damien Imbs, Michel Raynal, Julien Stainer:
Are Byzantine Failures Really Different from Crash Failures? 215-229 - Pawel Gawrychowski, Adrian Kosowski, Przemyslaw Uznanski:
Sublinear-Space Distance Labeling Using Hubs. 230-242 - Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid:
Online Balanced Repartitioning. 243-256 - Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Lower Bound on the Step Complexity of Anonymous Binary Consensus. 257-268 - Sandeep Hans, Ahmed Hassan, Roberto Palmieri, Sebastiano Peluso, Binoy Ravindran:
Opacity vs TMS2: Expectations and Reality. 269-283 - Matthieu Perrin, Matoula Petrolia, Achour Mostéfaoui, Claude Jard:
On Composition and Implementation of Sequential Consistency. 284-297 - Naama Ben-David, David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
k-Abortable Objects: Progress Under High Contention. 298-312 - Joseph Izraelevitz, Hammurabi Mendes, Michael L. Scott:
Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. 313-327 - Avery Miller, Boaz Patt-Shamir:
Buffer Size for Routing Limited-Rate Adversarial Traffic. 328-341 - Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca:
Distributed Testing of Excluded Subgraphs. 342-356 - Mohsen Ghaffari, Calvin C. Newport:
How to Discreetly Spread a Rumor in a Crowd. 357-370 - James Aspnes, Eric Ruppert:
Depth of a Random Binary Search Tree with Concurrent Insertions. 371-384 - Chien-Chung Huang, Prasad Jayanti:
Priority Mutual Exclusion: Specification and Algorithm. 385-398 - John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman:
Information Spreading in Dynamic Networks Under Oblivious Adversaries. 399-413 - Lili Su, Nitin H. Vaidya:
Non-Bayesian Learning in the Presence of Byzantine Agents. 414-427 - Vikram Saraph, Maurice Herlihy, Eli Gafni:
Asynchronous Computability Theorems for t-Resilient Systems. 428-441 - Zahra Aghazadeh, Philipp Woelfel:
Upper Bounds for Boundless Tagging with Bounded Objects. 442-457
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-08-02 00:58 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.
