default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th DISC 2001: Lisbon, Portugal
- Jennifer L. Welch:
Distributed Computing, 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001, Proceedings. Lecture Notes in Computer Science 2180, Springer 2001, ISBN 3-540-42605-1 - Yong-Jik Kim, James H. Anderson:
A Time Complexity Bound for Adaptive Mutual Exclusion. 1-15 - Yuh-Jzer Joung:
Quorum-Based Algorithms for Group Mutual Exclusion. 16-32 - Paolo Boldi, Sebastiano Vigna:
An Effective Characterization of Computability in Anonymous Networks. 33-47 - John R. Douceur, Roger Wattenhofer:
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System. 48-62 - Dahlia Malkhi, Elan Pavlov, Yaron Sella:
Optimal Unconditional Information Diffusion. 63-77 - Neeraj Mittal, Vijay K. Garg:
Computation Slicing: Techniques and Theory. 78-92 - Ricardo Jiménez-Peris, Marta Patiño-Martínez
, Gustavo Alonso, Sergio Arévalo:
A Low-Latency Non-blocking Commit Service. 93-107 - Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Stable Leader Election. 108-122 - Michiko Inoue, Shinya Umetani, Toshimitsu Masuzawa, Hideo Fujiwara:
Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps. 123-135 - Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle:
A New Synchronous Lower Bound for Set Agreement. 136-150 - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman:
The Complexity of Synchronous Iterative Do-All with Crashes. 151-165 - Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Mobile Search for a Black Hole in an Anonymous Ring. 166-179 - Jaap-Henk Hoepman:
Randomised Mutual Search for k>2 Agents. 180-193 - Lisa Higham, Zhiying Liang:
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks. 194-208 - Maurice Herlihy, Srikanta Tirthapura:
Self Stabilizing Distributed Queuing. 209-223 - Faith E. Fich, Colette Johnen:
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. 224-239 - Marie Duflot, Laurent Fribourg, Claudine Picaronny:
Randomized Finite-State Distributed Algorithms as Markov Chains. 240-254 - David Peleg, Uri Pincas:
The Average Hop Count Measure for Virtual Path Layouts. 255-269 - Lali Barrière, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc:
Efficient Routing in Networks with Long Range Contacts. 270-284 - Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
An Efficient Communication Strategy for Ad-hoc Mobile Networks. 285-299 - Timothy L. Harris:
A Pragmatic Implementation of Non-blocking Linked-Lists. 300-314 - Ted Herman, Toshimitsu Masuzawa:
Stabilizing Replicated Search Trees. 315-329 - Panagiota Fatourou, Maurice Herlihy:
Adding Networks. 330-342
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-28 20:35 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:
