Distributed Algorithms: 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings: Lecture Notes in Computer Science, cartea 647
Editat de Adrian Segall, Shmuel Zaksen Limba Engleză Paperback – 15 oct 1992
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 579.30 lei
- Preț: 410.88 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- 15% Preț: 448.04 lei
- 20% Preț: 353.50 lei
- Preț: 389.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 645.28 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 20% Preț: 310.28 lei
- 20% Preț: 655.02 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- Preț: 449.57 lei
- 20% Preț: 591.51 lei
- 18% Preț: 938.83 lei
- 20% Preț: 337.00 lei
- 20% Preț: 649.50 lei
- 20% Preț: 607.40 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 583.40 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.49 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 17% Preț: 360.20 lei
- 20% Preț: 763.23 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.58 lei
- 20% Preț: 369.13 lei
- 20% Preț: 580.93 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- 15% Preț: 438.59 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.30 lei
Preț: 337.52 lei
Preț vechi: 421.90 lei
-20% Nou
Puncte Express: 506
Preț estimativ în valută:
64.58€ • 67.67$ • 53.39£
64.58€ • 67.67$ • 53.39£
Carte tipărită la comandă
Livrare economică 11-25 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540561880
ISBN-10: 3540561889
Pagini: 396
Ilustrații: X, 382 p.
Dimensiuni: 155 x 233 x 21 mm
Greutate: 0.56 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540561889
Pagini: 396
Ilustrații: X, 382 p.
Dimensiuni: 155 x 233 x 21 mm
Greutate: 0.56 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Sparser: A paradigm for running distributed algorithms.- Closed schedulers: Constructions and applications to consensus protocols.- Efficient atomic snapshots using lattice agreement.- Choice coordination with multiple alternatives (preliminary version).- Some results on the impossibility, universality, and decidability of consensus.- Wait-free test-and-set.- A concurrent time-stamp scheme which is linear in time and space.- Tentative and definite distributed computations: An optimistic approach to network synchronization.- Semisynchrony and real time.- Optimal time Byzantine agreement for t /8 with linear messages.- A continuum of failure models for distributed computing.- Simulating crash failures with many faulty processors (extended abstract).- An efficient topology update protocol for dynamic networks.- Memory adaptive self-stabilizing protocols (extended abstract).- Optimal early stopping in distributed consensus.- Traffic-light scheduling on the grid.- Distributed computing on anonymous hypercubes with faulty components.- Message terminate algorithms for anonymous rings of unknown size.- Distributed resource allocation algorithms.- Membership algorithms for multicast communication groups.- The granularity of waiting (extended Abstract).- The cost of order in asynchronous systems.- Efficient, strongly consistent implementations of shared memory.- Optimal primary-backup protocols.