Archives
1985-2009

6th International Workshop on Distributed Algorithms

Haifa, Israel, November 2-4, 1992

The proceedings of the conference is edited by
Adrian Segall and Shmuel Zaks
In: Lecture Notes in Computer Science Vol. 647, Springer, 1992,
ISBN SBN 3-540-56188-9.

List of papers:

• Yehuda Afek and Moty Ricklin : Sparser: A Paradigm for Running Distributed Algorithms,
  pages 1-10.
• Ronit Lubitch and Shlomo Moran : Closed Schedulers: Constructions and Applications to Consensus Protocols,
  pages 11-34.
• Hagit Attiya and Maurice Herlihy and Ophir Rachman : Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract),
  pages 35-53.
• David S. Greenberg and Gadi Taubenfeld and Da-Wei Wang : Choice Coordination with Multiple Alternatives (Preliminary Version),
  pages 54-68.
• Prasad Jayanti and Sam Toueg : Some Results on the Impossibility, Universality, and Decidability of Consensus,
  pages 69-84.
• Yehuda Afek and Eli Gafni and John Tromp and Paul M. B. Vitányi : Wait-free Test-and-Set (Extended Abstract),
  pages 85-94.
• Amos Israeli and Meir Pinhasov : A Concurrent Time-Stamp Scheme which is Linear in Time and Space,
  pages 95-109.
• John D. Garofalakis and Sergio Rajsbaum and Paul G. Spirakis and Basil Tampakas : Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization,
  pages 110-119.
• Stephen Ponzio and H. Raymond Strong : Semisynchrony and Real-Time (Extended Abstract),
  pages 120-135.
• Arkady Zamsky and Amos Israeli and Shlomit S. Pinter : Optimal Time Byzantine Agreement for t > n/8 With Linear Messages,
  pages 136-152.
• Juan A. Garay and Kenneth J. Perry : A Continuum of Failure Models for Distributed Computing,
  pages 153-165.
• Rida A. Bazzi and Gil Neiger : Simulating Crash Failures with Many Faulty Processors (Extended Abstract),
  pages 166-184.
• Baruch Awerbuch and Yishay Mansour : An Efficient Topology Update Protocol for Dynamic Networks,
  pages 185-202.
• Efthymios Anagnostou and Ran El-Yaniv and Vassos Hadzilacos : Memory Adaptive Self-Stabilizing Protocols (Extended Abstract),
  pages 203-220.
• Piotr Berman and Juan A. Garay and Kenneth J. Perry : Optimal Early Stopping in Distributed Consensus (Extended Abstract),
  pages 221-237.
• Guy Kortsarz and David Peleg : Traffic-Light Scheduling on the Grid (Extended Abstract),
  pages 238-252.
• Evangelos Kranakis and Nicola Santoro : Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract),
  pages 253-263.
• Israel Cidon and Yuval Shavitt : Message Terminate Algorithms for Anonymous Rings of Unknown Size,
  pages 264-276.
• Judit Bar-Ilan and David Peleg : Distributed Resource Allocation Algorithms (Extended Abstract),
  pages 277-291.
• Yair Amir and Danny Dolev and Shlomo Kramer and Dalia Malki : Membership Algorithms for Multicast Communication Groups,
  pages 292-312.
• James H. Anderson and Jae-Heon Yang and Mohamed G. Gouda : The Granularity of Waiting (Extended Abstract),
  pages 313-328.
• Aleta Ricciardi and Kenneth P. Birman and Pat Stephenson : The Cost of Order in Asynchronous Systems,
  pages 329-345.
• Marios Mavronicolas and Dan Roth : Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract),
  pages 346-361.
• Navin Budhiraja and Keith Marzullo and Fred B. Schneider and Sam Toueg : Optimal Primary-Backup Protocols,
  pages 362-378.