Distributed algorithms : 2nd international workshop, Amsterdam, The Netherlands, July 8-10, 1987 : proceedings
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. algorith...
Wedi'i Gadw mewn:
| Awdur Corfforaethol: | |
|---|---|
| Awduron Eraill: | |
| Fformat: | Livre numérique |
| Iaith: | Anglais |
| Cyhoeddwyd: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Cyfres: | Lecture notes in computer science
312 |
| Pynciau: | |
| Mynediad Ar-lein: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nodyn: |
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, proceedings, 2nd International worshop on ..., Amsterdam, the Netherlands, July 8-10, 1987, Berlin, Springer, 1987, 1 vol. (VII-428 p.), Lecture notes in computer science - LNCS, 3-540-19366-9 • Distributed Algorithms, Texte imprimé, 9783662167885 |
Tabl Cynhwysion:
- A distributed spanning tree algorithm
- Directed network protocols
- Fault tolerant queries in computer networks
- General and efficient decentralized consensus protocols
- A framework for agreement
- Byzantine firing squad using a faulty external source
- An improved multiple identification algorithm for synchronous broadcasting networks
- Distributed algorithms for tree pattern matching
- On the packet complexity of distributed selection
- Load balancing in a network of transputers
- Experience with a new distributed termination detection algorithm
- A distributed deadlock avoidance technique
- How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion
- Verification of connection-management protocols
- Generalized scheme for topology-update in dynamic networks
- Local fail-safe network reset procedure
- Synchronizing asynchronous bounded delay networks
- A modular proof of correctness for a network synchronizer
- On the use of synchronizers for asynchronous communication networks
- Atomic multireader register
- An optimistic resiliency control scheme for distributed database systems
- A failsafe scheme for replicated information
- Randomized function evaluation on a ring
- A distributed ring orientation algorithm
- Constructing efficient election algorithms from efficient traversal algorithms
- Optimal resilient ring election algorithms
- Fault-tolerant distributed algorithm for election in complete networks
- Lower bounds for synchronous networks and the advantage of local information
- On the existence of generic broadcast algorithms in networks of Communicating Sequential Processes
- Stepwise removal of virtual channels in distributed algorithms.