Distributed algorithms /

Saved in:
Bibliographic Details
Author / Creator:Lynch, Nancy A. (Nancy Ann), 1948-
Imprint:San Francisco, Calif. : Morgan Kaufmann Publishers, ©1996.
Description:1 online resource (xxiii, 872 pages) : illustrations
Language:English
Series:The Morgan Kaufmann series in data management systems
Morgan Kaufmann series in data management systems.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/13592681
Hidden Bibliographic Details
ISBN:9780080504704
0080504701
9781558603486
1558603484
Notes:Includes bibliographical references (pages 829-856) and index.
Print version record.
Summary: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 pr.
Other form:Print version: Lynch, Nancy A. (Nancy Ann), 1948- Distributed algorithms. San Francisco, Calif. : Morgan Kaufmann Publishers, ©1996 1558603484 9781558603486

System Under Maintenance

Our Library Management System is currently under maintenance.

Holdings and item availability information is currently unavailable. Please accept our apologies for any inconvenience this may cause and contact us for further assistance:

catalog@lib.uchicago.edu