Distributed Algorithms: 2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987. Proceedings: Lecture Notes in Computer Science, cartea 312
Editat de Jan van Leeuwenen Limba Engleză Paperback – mai 1988
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 567.60 lei
- 20% Preț: 238.01 lei
- 15% Preț: 568.74 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 373.56 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 632.22 lei
- 20% Preț: 747.79 lei
- 20% Preț: 1053.45 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 809.19 lei
- 20% Preț: 579.56 lei
- 20% Preț: 649.49 lei
- 20% Preț: 330.23 lei
- Preț: 389.48 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 326.98 lei
- 20% Preț: 256.27 lei
- 20% Preț: 444.17 lei
- 20% Preț: 571.63 lei
- 20% Preț: 575.48 lei
- 20% Preț: 574.05 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 747.79 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 569.19 lei
- 20% Preț: 1159.14 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 388.66 lei
Nou
Puncte Express: 583
Preț estimativ în valută:
74.39€ • 78.01$ • 61.47£
74.39€ • 78.01$ • 61.47£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540193661
ISBN-10: 3540193669
Pagini: 444
Ilustrații: VII, 432 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1988
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540193669
Pagini: 444
Ilustrații: VII, 432 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1988
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.