Archives
1985-2007

1st International Workshop on Distributed Algorithms

Ottawa, Canada, 1985

The proceedings of the conference is edited by
Eli Gafni and Nicola Santoro
In: Carleton University Press Vol. , Carleton University, 1985,
ISBN 0-88629-054-6.

List of papers:

• K. Abrahamson and A. Adler and R. Gelbart and L. Higham and D. Kirkpatrick : The bit complexity of probabilistic leader election on a unidirectional ring,
  pages -.
• S.A. Andreasson : Minimizing a virtual control token ring,
  pages -.
• H.L. Bodlaender and J. van Leeuween : New upperbounds for decentralized extrema finding in a ring of processors,
  pages -.
• Z. Drezner and A. Barak : Efficient algorithms for routing information in a multicomputer system,
  pages -.
• E. Gafni and M.C. Loui and P. Tiwari and D.B. West and S. Zaks : Lower bounds on common knowledge in distributed algorithms,
  pages -.
• I. Lavallee and C. Lavaul : "Scheme for efficiency-performance measures of distributed and parallel algorithms,
  pages -.
• K.D. Marzullo : Distributed clock synchronization,
  pages -.
• A. Orda and R. Rom : Duplicate routing in distributed networks,
  pages -.
• J.K. Pachl and D. Rotem : Notes on distributed algorithms in unidirectional rings,
  pages -.
• N. Santoro and J. Urrutia and S. Zaks : Sense of direction and communication complexity in distributed networks,
  pages -.
• J.B. Sidney and J. Urrutia : The communication complexity hierarchy in distributed computing",
  pages -.
• P. Tiwari and M.C. Loui : Simulation of chaotic algorithms by token algorithms,
  pages -.
• H.F. Wedde : A general distributed graph algorithm for fair access to critical sections,
  pages -.