Distributed Algorithms: 3rd International Workshop, Nice, France, September 26-28, 1989. Proceedings: Lecture Notes in Computer Science, cartea 392
Editat de Jean-Claude Bermond, Michel Raynalen Limba Engleză Paperback – 6 sep 1989
Din seria Lecture Notes in Computer Science
- 20%
Preț: 1020.28 lei -
Preț: 395.25 lei - 20%
Preț: 327.36 lei - 20%
Preț: 556.96 lei - 20%
Preț: 400.77 lei - 15%
Preț: 558.12 lei - 20%
Preț: 328.94 lei - 20%
Preț: 340.04 lei - 20%
Preț: 487.46 lei - 20%
Preț: 629.71 lei - 20%
Preț: 386.08 lei - 20%
Preț: 489.11 lei - 20%
Preț: 620.33 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 782.57 lei - 20%
Preț: 679.09 lei - 20%
Preț: 330.54 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 435.28 lei - 20%
Preț: 375.72 lei - 20%
Preț: 342.61 lei - 20%
Preț: 432.78 lei - 20%
Preț: 904.16 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 373.80 lei - 20%
Preț: 400.17 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 984.64 lei - 20%
Preț: 560.93 lei - 20%
Preț: 731.97 lei - 20%
Preț: 563.29 lei - 20%
Preț: 403.00 lei - 20%
Preț: 793.92 lei - 20%
Preț: 324.19 lei - 20%
Preț: 733.68 lei - 20%
Preț: 336.86 lei - 20%
Preț: 327.36 lei - 20%
Preț: 573.45 lei - 20%
Preț: 558.53 lei - 20%
Preț: 850.42 lei - 20%
Preț: 560.93 lei - 20%
Preț: 560.93 lei - 20%
Preț: 631.96 lei - 20%
Preț: 568.70 lei - 20%
Preț: 488.90 lei - 20%
Preț: 293.24 lei
Preț: 321.49 lei
Preț vechi: 401.86 lei
-20%
Puncte Express: 482
Preț estimativ în valută:
56.83€ • 67.76$ • 49.29£
56.83€ • 67.76$ • 49.29£
Carte tipărită la comandă
Livrare economică 16-30 martie
Specificații
ISBN-13: 9783540516873
ISBN-10: 3540516875
Pagini: 328
Ilustrații: VIII, 320 p.
Dimensiuni: 155 x 233 x 17 mm
Greutate: 0.47 kg
Ediția:1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540516875
Pagini: 328
Ilustrații: VIII, 320 p.
Dimensiuni: 155 x 233 x 17 mm
Greutate: 0.47 kg
Ediția:1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Random leaders and random spanning trees.- Fault-tolerant critical section management in asynchronous networks.- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection.- Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm.- Combinatorics and geometry of consistent cuts : Application to concurrency theory.- Distributed fairness algorithms for local area networks with concurrent transmissions.- An efficient reliable ring protocol.- An efficient solution to the drinking philosophers problem and its extensions.- Highly concurrent logically synchronous multicast.- Reliable broadcast in synchronous and asynchronous environments (preliminary version).- Observing global states of asynchronous distributed applications.- Building a global time on parallel machines.- Functional dependencies of variables in wait-free programs.- Two strategies for solving the vertex cover problem on a transputer network.- Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction.- Simple and efficient election algorithms for anonymous networks.- A distributed solution for detecting deadlock in distributed nested transaction systems.- Distributed deadlock detection and resolution with probes.- A new algorithm to implement causal ordering.- Symmetry breaking in asynchronous rings with o(n) messages.- Designing distributed algorithms by means of formal sequentially phased reasoning.- Possibility and impossibility results in a shared memory environment.- Communication heuristics in distributed combinatorial search algorithms.- The role of inhibition in asynchronous consistent-cut protocols.- How to construct an atomic variable (extended abstract).- Electing a leader when processor identity numbers are not distinct (extended abstract).