Order Total (1 Item Items):
Shipping Destination:
Distributed Algorithms by Lynch Nancy (15 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (15)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (10)
- As New, Fine or Near Fine (1)
- Very Good or Good (4)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (15)
- Softcover (No further results match this refinement)
Collectible Attributes
- First Edition (4)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (2)
- Not Print on Demand (12)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
Distributed Algorithms
Published by Elsevier Science & Technology, 1996
ISBN 10: 1558603484 ISBN 13: 9781558603486
Language: English
First Edition
Condition: Good. 1st. Used book that is in clean, average condition without any missing pages.
-
Hardcover. Condition: Fine. 1st Edition. This is a fine, unmarked, hardcover first edition, second printing copy, no DJ, brown spine, 872 pages. MEDIA SHIPPING, extra for airmail or international shipping.
-
Distributed Algorithms
Published by Elsevier Science & Technology, 1996
ISBN 10: 1558603484 ISBN 13: 9781558603486
Language: English
First Edition
Condition: Good. 1st. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
-
Distributed Algorithms
Published by Elsevier Science & Technology, 1996
ISBN 10: 1558603484 ISBN 13: 9781558603486
Language: English
First Edition
Condition: Very Good. 1st. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects.
-
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems)
Published by Morgan Kaufmann 1996-04-16, 1996
ISBN 10: 1558603484 ISBN 13: 9781558603486
Language: English
US$ 140.87
US$ 20.22 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardcover. Condition: New.
-
Condition: New. pp. 904.
-
Hardcover. Condition: Brand New. 872 pages. 10.00x8.25x2.00 inches. In Stock.
-
Condition: New. pp. 904 1st Edition.
-
Hardcover. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.
-
Condition: New. pp. 904.
-
Condition: Very good.
-
Condition: new. Questo è un articolo print on demand.
-
Distributed Algorithms
Published by Elsevier Science Mär 1996, 1996
ISBN 10: 1558603484 ISBN 13: 9781558603486
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers.Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others.The material is organized according to the system model-first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference.The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures. 912 pp. Englisch.
-
Buch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others. The material is organized according to the system model-first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference. The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
