Seller: Dream Books Co., Denver, CO, U.S.A.
Condition: good. Gently used with minimal wear on the corners and cover. A few pages may contain light highlighting or writing, but the text remains fully legible. Dust jacket may be missing, and supplemental materials like CDs or codes may not be included. May be ex-library with library markings. Ships promptly!
Seller: Bookmans, Tucson, AZ, U.S.A.
Hardcover. Condition: Good. . Satisfaction 100% guaranteed.
Seller: Archives Books inc., Edmond, OK, U.S.A.
Hardcover. Condition: Acceptable. Minor tear on spine. No markings on text. Historic Oklahoma Bookstore on Route 66. Packages shipped daily, Mon-Fri.
Seller: Textbooks_Source, Columbia, MO, U.S.A.
First Edition
hardcover. Condition: Good. 1st Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
Seller: SGS Trading Inc, Franklin Lakes, NJ, U.S.A.
Hardcover. Condition: Good. US Edition Textbook, May Have Highlights, Notes and/or Underlining, BOOK ONLY-NO ACCESS CODE, NO CD, Ships with Emailed Tracking from USA.
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
US$ 117.38
Convert currencyQuantity: 1 available
Add to basketCondition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
Published by Morgan Kaufmann 1996-04-16, 1996
ISBN 10: 1558603484 ISBN 13: 9781558603486
Language: English
Seller: Chiron Media, Wallingford, United Kingdom
US$ 148.07
Convert currencyQuantity: Over 20 available
Add to basketHardcover. Condition: New.
US$ 159.43
Convert currencyQuantity: 3 available
Add to basketCondition: New. pp. 904.
Seller: Revaluation Books, Exeter, United Kingdom
US$ 171.43
Convert currencyQuantity: 2 available
Add to basketHardcover. Condition: Brand New. 872 pages. 10.00x8.25x2.00 inches. In Stock.
Condition: New. pp. 904 1st Edition.
US$ 204.65
Convert currencyQuantity: 3 available
Add to basketCondition: New. pp. 904.
Seller: Toscana Books, AUSTIN, TX, U.S.A.
Hardcover. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
US$ 147.67
Convert currencyQuantity: Over 20 available
Add to basketCondition: new. Questo è un articolo print on demand.
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
US$ 193.14
Convert currencyQuantity: 2 available
Add to basketBuch. 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.
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 200.29
Convert currencyQuantity: 2 available
Add to basketBuch. 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.