![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
8th WDAG 1994: Terschelling, The Netherlands
- Gerard Tel, Paul M. B. Vitányi
:
Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings. Lecture Notes in Computer Science 857, Springer 1994, ISBN 3-540-58449-8
Applications and Distributed Systems
- Özalp Babaoglu, Alberto Bartoli, Gianluca Dini:
Replicated File Management in Large-Scale Distributed Systems. 1-16 - Jörg Keller, Wolfgang J. Paul, Dieter Scheerer:
Realization of PRAMs: Processor Design. 17-27 - Arjen K. Lenstra:
Factoring. 28-38 - André Schiper, Alain Sandoz:
Primary Partition "Virtually-Synchronous Communication" harder than Consensus. 39-52 - Moti Yung:
Secure Distributed Computing: Theory and Practice. 53-73
Wait-free Algorithms and Synchronization
- Soma Chaudhuri, Mark R. Tuttle:
Fast Increment Registers. 74-88 - Manhoi Choy, Ambuj K. Singh:
Coping with Contention (Extended Abstract). 89-100 - Robert Cori, Shlomo Moran:
Exotic Behaviour of Consensus Numbers. 101-115 - Sibsankar Haldar, P. S. Subramanian:
Space-optimum Conflict-free Construction of 1-Writer 1-Reader Multivalued Atomic Variable. 116-129 - Michiko Inoue, Wei Chen:
Linear-Time Snapshot Using Multi-writer Multi-reader Registers. 130-140 - Mark Moir, James H. Anderson:
Fast, Long-Lived Renaming (Extended Abstract). 141-155 - Ophir Rachman:
Anomalies in the Wait-Free Hierarchy. 156-163
Network Algorithms
- Paola Alimonti, Paola Flocchini, Nicola Santoro:
Finding the Extrema of a Distributed Multiset. 164-178 - Hagit Attiya, Rinat Rappoport:
The Level of Handshake Required for Establishing a Connection. 179-193 - Hagit Attiya, Hadas Shachnai, Tami Tamir:
Local Labeling and Resource Allocation Using Preprocessing. 194-208 - Israel Cidon, Ornan Ori Gerstel, Shmuel Zaks:
A Scalable Approach to Routing in ATM Networks. 209-222 - Lior Shabtay, Adrian Segall:
Low Complexity Network Synchronization. 223-237 - Bala Swaminathan, Kenneth J. Goldman:
An Incremental Distributed Algorithm for Computing Biconnected Components (Extended Abstract). 238-252
Fault-tolerant Algorithms
- Juan A. Garay:
Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract). 253-264 - Jaap-Henk Hoepman:
Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings. 265-279 - Wai-Kau Lo, Vassos Hadzilacos:
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract). 280-295 - Yih-Kuen Tsay, Rajive L. Bagrodia:
An Algorithm with Optimal Failure Locality for the Dining Philosophers Problem. 296-310
Miscellaneous
- Baruch Awerbuch, Boaz Patt-Shamir, George Varghese, Shlomi Dolev
:
Self-Stabilization by Local Checking and Global Reset (Extended Abstract). 326-339 - Twan Basten:
Breakpoints and Time in Distributed Computations. 340-354 - Frédéric Ruget:
Cheaper Matrix Clocks. 355-369
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.