default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th WDAG 1990: Bari, Italy
- Jan van Leeuwen, Nicola Santoro:
Distributed Algorithms, 4th International Workshop, WDAG '90, Bari, Italy, September 24-26, 1990, Proceedings. Lecture Notes in Computer Science 486, Springer 1991, ISBN 3-540-54099-7 - Amos Israeli, Marc Jalfon:
Self-Stabilizing Ring Orientation. 1-14 - Yehuda Afek, Shay Kutten, Moti Yung:
Memory-Efficient Self Stabilizing Protocols for General Networks. 15-28 - Alon Atai:
On the Computational Power Needed to Elect a Leader (Extended Abstract). 29-40 - Ivan Lavallée, Christian Lavault:
Spanning Tree Construction for Nameless Networks. 41-56 - Joffroy Beauquier, Paul Gastin, Vincent Villain:
A Linear Fault-Tolerant Naming Algorithm. 57-70 - David Peleg:
Distributed Data Structures: A Complexity-Oriented View. 71-89 - Berthold Kröger, Reinhard Lüling, Burkhard Monien, Oliver Vornberger:
An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems. 90-101 - Sergio Rajsbaum, Moshe Sidi:
On the Average Performance of Synchronized Programs in Distributed Networks (Preliminary Version). 102-121 - Jungho Park, Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura:
Distributed Algorithms for Reconstructing MST after Topology Change. 122-132 - Ravi Janardan, Siu-Wing Cheng:
Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. 133-150 - Peter Grønning, Thomas Qvist Nielsen, Hans Henrik Løvengreen:
Stepwise Development of a Distributed Load Balancing Algorithms. 151-168 - Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg:
Greedy Packet Scheduling. 169-184 - Israel Cidon, Inder S. Gopal, Shay Kutten:
Optimal Computation of Global Sensitive Functions in Fast Networks. 185-191 - Yoram Ofek, Moti Yung:
Efficient Mechanism for Fairness and Deadlock-Avoidance in High-Speed Networks. 192-212 - Cynthia Dwork:
Strong Verifiable Secret Sharing (Extended Abstract). 213-227 - Alain Sandoz, André Schiper:
Weak Consistency and Pessimistic Replica Control. 228-244 - Divyakant Agrawal, Amr El Abbadi:
Localized-Access Protocols for Replicated Databases. 245-262 - Mirjana Obradovic, Piotr Berman:
Weighted Voting for Operation Dependent Management of Replicated Data. 263-276 - Prasad Jayanti, Sam Toueg:
Wakeup under Read/Write Atomicity. 277-288 - Tushar Deepak Chandra, Sam Toueg:
Time and Message Efficient Reliable Broadcasts. 289-303 - Navin Budhiraja, Ajei S. Gopal, Sam Toueg:
Early-Stopping Distributed Bidding and Applications (Preliminary Version). 304-320 - Piotr Berman, Juan A. Garay:
Fast Consensus in Networks of Bounded Degree (Extended Abstract). 321-333 - Gil Neiger, Mark R. Tuttle:
Common Knowledge and Consistent Simultaneous Coordination. 334-352 - Rogério de Lemos, Paul D. Ezhilchelvan
:
Agreement on the Group Membership in Synchronous Distributed Systems. 353-372 - Ofer Biran, Shlomo Moran, Shmuel Zaks:
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. 373-389 - Rudolf Fleischer, Hermann Jung, Kurt Mehlhorn:
A Time-Randomness Tradeoff for Communication Complexity. 390-401 - Soma Chaudhuri, Jennifer L. Welch:
Bounds on the Costs of Register Implementations. 402-421 - Yehuda Afek, Danny Dolev, Eli Gafni:
A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem. 422-431
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-11 21:16 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:
