Skip to main content
SpringerLink
Log in

Distributed Algorithms

4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings.

  • Conference proceedings
  • © 1991

Overview

Editors:
  1. Jan Leeuwen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Nicola Santoro
    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 486)

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 (28 papers)

  1. Front Matter

    Download chapter PDF

  2. Self-stabilizing ring orientation

    • Amos Israeli, Marc Jalfon
    Pages 1-14

  3. Memory-efficient self stabilizing protocols for general networks

    • Yehuda Afek, Shay Kutten, Moti Yung
    Pages 15-28

  4. On the computational power needed to elect a leader

    • Alon Itai
    Pages 29-40

  5. Spanning tree construction for nameless networks

    • Ivan Lavallée, Christian Lavault
    Pages 41-56

  6. A linear fault-tolerant naming algorithm

    • Joffroy Beauquier, Paul Gastin, Vincent Villain
    Pages 57-70

  7. Distributed data structures: A complexity-oriented view

    • David Peleg
    Pages 71-89

  8. An improved algorithm to detect communication deadlocks in distributed systems

    • B. Kröger, R. Lüling, B. Monien, O. Vornberger
    Pages 90-101

  9. On the average performance of synchronized programs in distributed networks

    • Sergio Rajsbaum, Moshe Sidi
    Pages 102-121

  10. Distributed algorithms for reconstructing MST after topology change

    • Jungho Park, Toshimitsu Masuzawa, Ken'ich Hagihara, Nobuki Tokura
    Pages 122-132

  11. Efficient distributed algorithms for single-source shortest paths and related problems on plane networks

    • Ravi Janardan, Siu Wing Cheng
    Pages 133-150

  12. Stepwise development of a distributed load balancing algorithm

    • Peter Grønning, Thomas Qvist Nielsen, Hans Henrik Løvengreen
    Pages 151-168

  13. Greedy packet scheduling

    • Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg
    Pages 169-184

  14. Optimal computation of global sensitive functions in fast networks

    • Israel Cidon, Inder Gopal, Shay Kutten
    Pages 185-191

  15. Efficient mechanism for fairness and deadlock-avoidance in high-speed networks

    • Yoram Ofek, Moti Yung
    Pages 192-212

  16. Strong verifiable secret sharing extended abstract

    • Cynthia Dwork
    Pages 213-227

  17. Weak consistency and pessimistic replica control

    • Alain Sandoz, André Schiper
    Pages 228-244

  18. Localized-access protocols for replicated databases

    • D. Agrawal, A. El Abbadi
    Pages 245-262

  19. Weighted voting for operation dependent management of replicated data

    • Mirjana Obradovic, Piotr Berman
    Pages 263-276

  20. Wakeup under read/write atomicity

    • Prasad Jayanti, Sam Toueg
    Pages 277-288
Back to top

Keywords

About this book

This volume contains the proceedings of the 4th International Workshop on Distributed Algorithms, held near Bari, Italy, September 24-26, 1990. The workshop was a forum for researchers, students and other interested persons to discuss recent results and trends in the design and analysis of distributed algorithms for communication networks and decentralized systems. The volume includes all 28 papers presented at the workshop, covering current research in such aspects of distributed algorithm design as distributed combinatorial algorithms, distributed algorithms on graphs, distributed algorithms for new types of decentralized systems, distributed data structures, synchronization and load-balancing, distributed algorithms for control and communication, design and verification of network protocols, routing algorithms, fail-safe and fault-tolerant distributed algorithms, distributed database techniques, algorithms for transaction management and replica control, and other related topics.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation