Skip to main content
SpringerLink
Log in

Distributed Algorithms

2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987. Proceedings

  • Conference proceedings
  • © 1988

Overview

Editors:
  1. J. Leeuwen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 312)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  2. A distributed spanning tree algorithm

    • Karl Erik Johansen, Ulla Lundin Jørgensen, Svend Hauge Nielsen, Søren Erik Nielsen, Sven Skyum
    Pages 1-12

  3. Directed network protocols

    • Gerard Tel
    Pages 13-29

  4. Fault tolerant queries in computer networks

    • Alan Baratz, Inder Gopal, Adrian Segall
    Pages 30-40

  5. General and efficient decentralized consensus protocols

    • Bermond Jean-Claude, Konig Jean-Claude, Raynal Michel
    Pages 41-56

  6. A framework for agreement

    • Kenneth J. Perry
    Pages 57-75

  7. Byzantine firing squad using a faulty external source

    • Edward T. Ordman
    Pages 76-83

  8. An improved multiple identification algorithm for synchronous broadcasting networks

    • Walter Vogler
    Pages 84-91

  9. Distributed algorithms for tree pattern matching

    • Gurdip Singh, Scott A. Smolka, I. V. Ramakrishnan
    Pages 92-107

  10. On the packet complexity of distributed selection

    • Alberto Negro, Nicola Santoro, Jorge Urrutia
    Pages 108-115

  11. Load balancing in a network of transputers

    • Oliver Vornberger
    Pages 116-126

  12. Experience with a new distributed termination detection algorithm

    • Friedemann Mattern
    Pages 127-143

  13. A distributed deadlock avoidance technique

    • Ferenc Belik
    Pages 144-154

  14. How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion

    • Naimi Mohamed, Trehel Michel
    Pages 155-166

  15. Verification of connection-management protocols

    • Anneke A. Schoone
    Pages 167-186

  16. Generalized scheme for topology-update in dynamic networks

    • Eli Gafni
    Pages 187-196

  17. Local fail-safe network reset procedure

    • Yehuda Afek, Baruch Awerbuch, Eli Gafni
    Pages 197-211

  18. Synchronizing asynchronous bounded delay networks

    • Ching-Tsun Chou, Israel Cidon, Inder S. Gopal, Shmuel Zaks
    Pages 212-218

  19. A modular proof of correctness for a network synchronizer

    • A. Fekete, N. Lynch, L. Shrira
    Pages 219-256

  20. On the use of synchronizers for asynchronous communication networks

    • K. B. Lakshmanan, K. Thulasiraman
    Pages 257-277
Back to top

Keywords

About this book

This volume presents the proceedings of the 2nd International Workshop on Distributed Algorithms, held July 8-10, 1987, in Amsterdam, The Netherlands. It contains 29 papers on new developments in the area of the design and analysis of distributed algorithms. The topics covered include, e.g. algorithms for distributed consensus and agreement in networks, connection management and topology update schemes, election and termination detection protocols, and other issues in distributed network control.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation