default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th DISC 2000: Toledo, Spain
- Maurice Herlihy:
Distributed Computing, 14th International Conference, DISC 2000, Toledo, Spain, October 4-6, 2000, Proceedings. Lecture Notes in Computer Science 1914, Springer 2000, ISBN 3-540-41143-7 - Faith E. Fich, Eric Ruppert
:
Lower Bounds in Distributed Computing. 1-28 - James H. Anderson, Yong-Jik Kim:
Adaptive Mutual Exclusion with Local Spinning. 29-43 - Lisa Higham, Jalal Kawash:
Bounds for Mutual Exclusion with only Processor Consistency. 44-58 - David Detlefs, Christine H. Flood, Alex Garthwaite, Paul Alan Martin, Nir Shavit, Guy L. Steele Jr.:
Even Better DCAS-Based Concurrent Deques. 59-73 - Yedidia Atzmony, David Peleg:
Distributed Algorithms for English Auctions. 74-88 - Indranil Gupta, Robbert van Renesse, Kenneth P. Birman:
A Probabilistically Correct Leader Election Protocol for Large Groups. 89-103 - Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Approximation Algorithms for Survivable Optical Networks. 104-118 - Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman:
Distributed Cooperation During the Absence of Communication. 119-133 - Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi:
On the Importance of Having an Identity or is Consensus Really Universal? 134-148 - Hagit Attiya, Arie Fouren:
Polynominal and Adaptive Long-Lived (2k-1)-Renaming. 149-163 - Michael Merritt, Gadi Taubenfeld:
Computing with Infinitely Many Processes. 164-178 - Victoria Ungureanu, Naftaly H. Minsky:
Establishing Business Rules for Inter-Enterprise Electronic Commerce. 179-193 - Carlo Blundo, Annalisa De Bonis, Barbara Masucci:
Metering Schemes with Pricing. 194-208 - Oliver E. Theel:
Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms. 209-222 - Joffroy Beauquier, Ajoy Kumar Datta, Maria Gradinariu, Frédéric Magniette:
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. 223-237 - Paolo Boldi, Sebastiano Vigna:
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs. 238-252 - Meng-Jang Lin, Keith Marzullo, Stefano Masini:
Gossip versus Deterministically Constrained Flooding on Small Networks. 253-267 - Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
Thrifty Generic Broadcast. 268-282 - Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou:
Locating Information with Uncertainty in Fully Interconnected Networks. 283-296 - Yasushi Saito, Henry M. Levy:
Optimistic Replication for Internet Data Services. 297-314 - Marta Patiño-Martínez, Ricardo Jiménez-Peris, Bettina Kemme, Gustavo Alonso:
Scalable Replication in Database Clusters. 315-329 - Eli Gafni, Leslie Lamport:
Disk Paxos. 330-344 - Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld:
Objects Shared by Byzantine Processes. 345-359 - Faith E. Fich, Andreas Jakoby:
Short Headers Suffice for Communication in a DAG with Link Failures. 360-373 - Gregory V. Chockler, Roy Friedman, Roman Vitenberg:
Consistency Conditions for a CORBA Caching Service. 374-388
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-29 00:15 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.
