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