12. DISC 1998: Andros, Greece

Keynote Lectures

• Paola Flocchini, Bernard Mans, Nicola Santoro:
  Sense of Direction in Distributed Computing. 1-15
  Electronic Edition (Springer LINK) BibTeX
• Ron van der Meyden, Yoram Moses:
  Top-Down Considerations on Distributed Computing. 16-19
  Electronic Edition (Springer LINK) BibTeX
• Santosh K. Shrivastava:
  Inter-task Co-ordination in Long-Lived Distributed Applications. 20-21
  Electronic Edition (Springer LINK) BibTeX

Contributed Papers

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