6. WDAG 1992: Haifa, Israel

• Yehuda Afek, Moty Ricklin:
  Sparser: A Paradigm for Running Distributed Algorithms. 1-10
  
• Ronit Lubitch, Shlomo Moran:
  Closed Schedulers: Constructions and Applications to Consensus Protocols. 11-34
  
• Hagit Attiya, Maurice Herlihy, Ophir Rachman:
  Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract). 35-53
  

• David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang:
  Choice Coordination with Multiple Alternatives (Preliminary Version). 54-68
  
• Prasad Jayanti, Sam Toueg:
  Some Results on the Impossibility, Universality, and Decidability of Consensus. 69-84
  
• Yehuda Afek, Eli Gafni, John Tromp, Paul M. B. Vitányi:
  Wait-free Test-and-Set (Extended Abstract). 85-94
  

• Amos Israeli, Meir Pinhasov:
  A Concurrent Time-Stamp Scheme which is Linear in Time and Space. 95-109
  
• John D. Garofalakis, Sergio Rajsbaum, Paul G. Spirakis, Basil Tampakas:
  Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization. 110-119
  
• Stephen Ponzio, H. Raymond Strong:
  Semisynchrony and Real-Time (Extended Abstract). 120-135
  

• Arkady Zamsky, Amos Israeli, Shlomit S. Pinter:
  Optimal Time Byzantine Agreement for t<n/8 With Linear Messages. 136-152
  
• Juan A. Garay, Kenneth J. Perry:
  A Continuum of Failure Models for Distributed Computing. 153-165
  
• Rida A. Bazzi, Gil Neiger:
  Simulating Crash Failures with Many Faulty Processors (Extended Abstract). 166-184
  

• Baruch Awerbuch, Yishay Mansour:
  An Efficient Topology Update Protocol for Dynamic Networks. 185-202
  
• Efthymios Anagnostou, Ran El-Yaniv, Vassos Hadzilacos:
  Memory Adaptive Self-Stabilizing Protocols (Extended Abstract). 203-220
  
• Piotr Berman, Juan A. Garay, Kenneth J. Perry:
  Optimal Early Stopping in Distributed Consensus (Extended Abstract). 221-237
  

• Guy Kortsarz, David Peleg:
  Traffic-Light Scheduling on the Grid (Extended Abstract). 238-252
  
• Evangelos Kranakis, Nicola Santoro:
  Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract). 253-263
  
• Israel Cidon, Yuval Shavitt:
  Message Terminate Algorithms for Anonymous Rings of Unknown Size. 264-276
  

• Judit Bar-Ilan, David Peleg:
  Distributed Resource Allocation Algorithms (Extended Abstract). 277-291
  
• Yair Amir, Danny Dolev, Shlomo Kramer, Dalia Malki:
  Membership Algorithms for Multicast Communication Groups. 292-312
  
• James H. Anderson, Jae-Heon Yang, Mohamed G. Gouda:
  The Granularity of Waiting (Extended Abstract). 313-328
  

• Aleta Ricciardi, Kenneth P. Birman, Pat Stephenson:
  The Cost of Order in Asynchronous Systems. 329-345
  
• Marios Mavronicolas, Dan Roth:
  Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract). 346-361
  
• Navin Budhiraja, Keith Marzullo, Fred B. Schneider, Sam Toueg:
  Optimal Primary-Backup Protocols. 362-378