Distributed Algorithms on Graphs
1st Edition
Published on 15. January 1986
200 pages
978-0-7735-7347-5 (ISBN)
Description
This volume contains papers presented at the First International Workshop on Distributed Algorithms. The papers present solutions to a wide spectrum of problems (leader election, resource allocation, routing, etc.) and focus on a variety of issues that influence communications complexity.
More details
Other editions
Additional editions
Eli Gafni | Nicola Santoro
Distributed Algorithms on Graphs
Book
01/1986
McGill-Queen's University Press
€148.56
Article not available at the moment
Content
- Cover
- Title
- Copyright
- Preface
- Table of Contents
- Contributors
- 1. The bit complexity of probabilistic leader election on a unidirectional ring
- 2. Minimizing a virtual control token ring
- 3. New upperbounds for decentralized extrema-finding in a ring of processors
- 4. Efficient algorithms for routing information in a multicomputer system
- 5. Lower bounds on common knowledge in distributed algorithms
- 6. Scheme for efficiency-performance measures of distributed and parallel algorithms
- 7. Duplicate routing in distributed networks
- 8. Notes on distributed algorithms in unidirectional rings
- 9. Sense of direction and communication complexity in distributed networks
- 10. The communication complexity hierarchy in distributed computing
- 11. Simulation of chaotic algorithms by token algorithms
- 12. A general distributed graph algorithm for fair access to critical sections
- ADDENDA
- a. Open Problems
- b. A bibliography of distributed algorithms (1985)
- c. Author Index
