Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCID11th PODC 1992: Vancouver, British Columbia, Canada
- Norman C. Hutchinson:
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 10-12, 1992. ACM 1992, ISBN 0-89791-495-3
Session1
- Reuven Cohen, Adrian Segall:
Distributed Priority Algorithms Under One-Bit-Delay Constraints. 1-12 - Amir Herzberg
:
Connection-Based Communication in Dynamic Networks (Extended Abstract). 13-24 - Robert Cypher, Luis Gravano:
Requirements for Deadlock-Free, Adaptive Packet Routing. 25-33 - Yehuda Afek, Eli Gafni, Adi Rosén:
The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract). 35-46
Session 2
- Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld:
Computing with Faulty Shared Memory (Extended Abstract). 47-58 - Shlomo Moran, Gadi Taubenfeld, Irit Yadin:
Concurrent Counting (Extended Abstract). 59-70 - Amos Israeli, Amnon Shaham:
Optimal Multi-Writer Multi-Reader Atomic Register. 71-82
Session 3
- Eli Upfal:
Tolerating Linear Number of Faults in Networks of Bounded Degree. 83-89 - Cynthia Dwork, Joseph Y. Halpern, Orli Waarts:
Performing Work Efficiently in the Presence of Faults. 91-102 - Oded Goldreich, Dror Sneh:
On the Complexity of Global Computation in the Presence of Link Failures: The Case of Uni-Directional Faults. 103-111 - Chengdian Lin, Janos Simon:
Observing Self-Stabilization. 113-123
Session 4
- Juan Alemany, Edward W. Felten:
Performance Issues in Non-blocking Synchronization on Shared-memory Multiprocessors. 125-134 - Marc Shapiro, Peter Dickman, David Plainfossé:
Robust, Distributed References and Acyclic Garbage Collection. 135-146 - Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg:
The Weakest Failure Detector for Solving Consensus. 147-158 - Eugene Styer:
Improving Fast Mutual Exclusion. 159-168
Session 5
- Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Fast Network Decomposition (Extended Abstract). 169-177 - Gurdip Singh:
Leader Election in Complete Networks. 179-190 - Injong Rhee, Jennifer L. Welch:
The Impact of Time on the Session Problem. 191-202
Session 6
- Rida A. Bazzi, Gil Neiger:
The Possibility and the Complexity of Achieving Fault-Tolerant Coordination. 203-214 - Wil Janssen, Job Zwiers:
From Sequential Layers to Distributed Processes: Deriving a Distributed Minimum Weight Spanning Tree Algorithm (Extended Anstract). 215-227 - Nils Klarlund:
Progress Measures and Stack Assertions for Fair Termination. 229-240
Session 7
- George Varghese, Nancy A. Lynch:
A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack Protocols. 241-250 - Alessandro Panconesi, Aravind Srinivasan:
Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract). 251-262 - Isaac Saias:
Proving Probabilistic Correctness Statements: the Case of Rabin's Algorithm for Mutual Exclusion. 263-274 - Eyal Kushilevitz, Michael O. Rabin:
Randomized Mutual Exclusion Algorithms Revisited. 275-283
a service of 
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 2022-09-30 21:53 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 has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
