Distributed Computing, Volume 17

Volume 17, Number 1, February 2004

• Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy:
  Condition-based consensus solvability: a hierarchy of conditions and efficient protocols. 1-20
  
• Darin Goldstein, Nick Meyer:
  The wake up and report problem is time-equivalent to the firing squad synchronization problem. 21-31
  
• Panagiota Fatourou, Maurice Herlihy:
  Read-modify-write networks. 33-46
  
• Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman:
  The complexity of synchronous iterative Do-All with crashes. 47-63
  
• Marie Duflot, Laurent Fribourg, Claudine Picaronny:
  Randomized dining philosophers without fairness assumption. 65-76
  
• Yishay Mansour, Boaz Patt-Shamir, Ofer Lapid:
  Optimal smoothing schedules for real-time streams. 77-89
  

Volume 17, Number 2, August 2004

• Joseph Y. Halpern, Yoram Moses:
  Using counterfactuals in knowledge-based programming. 91-106
  
• Neeraj Mittal, Vijay K. Garg:
  Finding missing synchronization in a distributed computation using controlled re-execution. 107-130
  
• Ajay D. Kshemkalyani:
  The power of logical clock abstractions. 131-150
  
• Michalis Faloutsos, Mart Molle:
  A linear-time optimal-message distributed algorithm for minimum spanning trees. 151-170
  
• Jennifer E. Walter, Jennifer L. Welch, Nancy M. Amato:
  Distributed reconfiguration of metamorphic robot chains. 171-189
  

Volume 17, Number 3, March 2005

• Yonatan Aumann, Michael A. Bender:
  Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. 191-207
  
• Hyunyoung Lee, Jennifer L. Welch:
  Randomized registers and iterative algorithms. 209-221
  
• Joseph Y. Halpern, Aleta Ricciardi:
  A knowledge-theoretic analysis of uniform distributed coordination and failure detectors. 223-236
  
• Miguel Correia, Nuno Ferreira Neves, Lau Cheuk Lung, Paulo Veríssimo:
  Low complexity Byzantine-resilient consensus. 237-249
  
• Neeraj Mittal, Vijay K. Garg:
  Techniques and applications of computation slicing. 251-277
  
• Anish Arora, Mikhail Nesterenko:
  Unifying stabilization and termination in message-passing systems. 279-290
  

Volume 17, Number 4, May 2005

• Sergio Rajsbaum:
  Introduction. 291
  
• Ninghui Li, Wenliang Du, Dan Boneh:
  Oblivious signature-based envelope. 293-302
  
• Fabian Kuhn, Roger Wattenhofer:
  Constant-time distributed dominating set approximation. 303-310
  
• Moni Naor, Udi Wieder:
  Scalable and dynamic quorum systems. 311-322
  
• Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung:
  Scalable public-key tracing and revoking. 323-347