Distributed algorithms : 4th international workshop, Bari, Italy, September 24-26, 1990 : proceedings
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...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
486 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Distributed algorithms, 4th international workshop, Bari, Italy, September 24-26, 1990, proceedings, J. van Leeuwen, N. Santoro, (eds.), Berlin, Springer-Verlag, 1991, 1 vol. (VI-431 p.), Lecture notes in computer science, 3-540-54099-7 • Distributed Algorithms, Texte imprimé, 9783662209141 |
Table des matières:
- 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.