|
|
|
[BibTeX] for publications
|
|
The proceedings of the conference is edited by
Shay Kutten
In: Lecture Notes in Computer Science
Vol. 1499,
Springer,
1998,
ISBN
3-540-65066-9.
|
List of papers:
Keynote Lectures
-
Paola Flocchini and Bernard Mans and Nicola Santoro :
Sense of Direction in Distributed Computing,
pages 1-15.
-
Ron van der Meyden and Yoram Moses :
Top-Down Considerations on Distributed Computing,
pages 16-19.
-
Santosh K. Shrivastava :
Inter-task Co-ordination in Long-Lived Distributed Applications,
pages 20-21.
Contributed Papers
-
Yair Amir and Alec Peterson and David Shaw :
Seamlessly Selecting the Best Copy from Internet-Wide Replicated Web Servers,
pages 22-33.
-
James H. Anderson and Rohit Jain and David Ott :
Wait-Free Synchronization in Quantum-Based Multiprogrammed Systems,
pages 34-48.
-
Hagit Attiya and Alla Gorbach and Shlomo Moran :
Computing in Totally Anonymous Asynchronous Shared Memory Systems,
pages 49-61.
-
Joffroy Beauquier and Sylvie Delaët and Shlomi Dolev and Sébastien Tixeuil :
Transient Fault Detectors,
pages 62-74.
-
Jean-Claude Bermond and Nausica Marlin and David Peleg and Stephane Perennes :
Directed Virtual Path Layouts in ATM Networks,
pages 75-88.
-
Francis Chu and Joseph Y. Halpern :
A Decision-Theoretic Approach to Reliable Message Delivery,
pages 89-103.
-
Israel Cidon and Osnat Mokryn :
Propagation and Leader Election in a Multihop Broadcast Environment,
pages 104-118.
-
Michael J. Demmer and Maurice Herlihy :
The Arrow Distributed Directory Protocol,
pages 119-133.
-
Matthias Fitzi and Ueli M. Maurer :
Efficient Byzantine Agreement Secure Against General Adversaries,
pages 134-148.
-
Wayne Eberly and Lisa Higham and Jolanta Warpechowska-Gruca :
Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput,
pages 149-160.
-
Cyril Gavoille and David Peleg :
The Compactness of Interval Routing for Almost All Graphs,
pages 161-174.
-
Maurice Herlihy and Sergio Rajsbaum :
A Wait-Free Classification of Loop Agreement Tasks,
pages 175-185.
-
Ted Herman :
A Stabilizing Repair Timer,
pages 186-200.
-
Lisa Higham and Jalal Kawash :
Java: Memory Consistency and Process Coordination,
pages 201-215.
-
Prasad Jayanti :
A Complete and Constant Time Wait-Free Implementation of CAS from LL/SC and Vice Versa,
pages 216-230.
-
Marcos Kawazoe Aguilera and Wei Chen and Sam Toueg :
Failure Detection and Consensus in the Crash-Recovery Model,
pages 231-245.
-
Tim Kempster and Colin Stirling and Peter Thanisch :
A More Committed Quorum-Based Three Phase Commit Protocol,
pages 246-257.
-
Roger Khazan and Alan Fekete and Nancy A. Lynch :
Multicast Group Communication as a Base for a Load-Balancing Replicated Data Service,
pages 258-272.
-
Rastislav Kralovic and Branislav Rovan and Peter Ruzicka and Daniel Stefankovic :
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks,
pages 273-287.
-
Jean-Marc Menaud and Valérie Issarny and Michel Banâtre :
A New Protocol for Efficient Cooperative Transversal Web Caching,
pages 288-302.
-
Michael Merritt and Gadi Taubenfeld :
Fairness of Shared Objects,
pages 303-317.
-
Fernando Pedone and André Schiper :
Optimistic Atomic Broadcast,
pages 318-332.
-
Richard Plunkett and Alan Fekete :
Approximate Agreement with Mixed Mode Faults: Algorithm and Lower Bound,
pages 333-346.
-
Assaf Schuster and Lea Shalev :
Using Remote Access Histories for Thread Scheduling in Distributed Shared Memory Systems,
pages 347-362.
-
Jeremy B. Sussman and Keith Marzullo :
The Bancomat Problem: An Example of Resource Allocation in a Partitionable Asynchronous System,
pages 363-377.
-
Francisco J. Torres-Rojas and Mustaque Ahamad and Michel Raynal :
Lifetime Based Consistency Protocols for Distributed Objects,
pages 378-392.
-
Yih-Kuen Tsay :
Deriving a Scalable Algorithm for Mutual Exclusion,
pages 393-407.
-
Christopher H. Young and Nael B. Abu-Ghazaleh and Philip A. Wilsey :
OFC: A Distributed Fossil-Collection Algorithm for Time-Warp,
pages 408-418.
Winner of Best Student Paper Award
-
Michael J. Demmer and Maurice Herlihy :
The Arrow Distributed Directory Protocol,
pages 119-133.
|
|
|
|