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

Distributed Algorithms 4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings. / edited by Jan van Leeuwen, Nicola Santoro.

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 distribut...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Leeuwen, Jan van (Editor), Santoro, Nicola (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1991.
Edition:1st ed. 1991.
Series:Lecture Notes in Computer Science, 486
Springer eBook Collection.
Subjects:
Computers.
Computer programming.
Algorithms.
Computer communication systems.
Operating systems (Computers).
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • Self-stabilizing ring orientation
  • Memory-efficient self stabilizing protocols for general networks
  • On the computational power needed to elect a leader
  • Spanning tree construction for nameless networks
  • A linear fault-tolerant naming algorithm
  • Distributed data structures: A complexity-oriented view
  • An improved algorithm to detect communication deadlocks in distributed systems
  • On the average performance of synchronized programs in distributed networks
  • Distributed algorithms for reconstructing MST after topology change
  • Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
  • Stepwise development of a distributed load balancing algorithm
  • Greedy packet scheduling
  • Optimal computation of global sensitive functions in fast networks
  • Efficient mechanism for fairness and deadlock-avoidance in high-speed networks
  • Strong verifiable secret sharing extended abstract
  • Weak consistency and pessimistic replica control
  • Localized-access protocols for replicated databases
  • Weighted voting for operation dependent management of replicated data
  • Wakeup under read/write atomicity
  • Time and message efficient reliable broadcasts
  • Early-stopping distributed bidding and applications
  • Fast consensus in networks of bounded degree
  • Common knowledge and consistent simultaneous coordination
  • Agreement on the group membership in synchronous distributed systems
  • Tight bounds on the round complexity of distributed 1-solvable tasks
  • A time-randomness tradeoff for communication complexity
  • Bounds on the costs of register implementations
  • A bounded first-in, first-enabled solution to the l-exclusion problem.

Similar Items