This volume presents the locality-sensitive approach to distributed network algorithms-the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that illustrate the role of locality in distributed algorithmic techniques. He then introduces locality-preserving network representations and describes sequential and distributed techniques for their construction. Finally, the applicability of the locality-sensitive approach is demonstrated through several applications. Distributed Computing: A Locality-Sensitive Approach is the only book that gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions. The book is useful for computer scientists interested in distributed computing, electrical engineers interested in network architectures and protocols, and for discrete mathematicians and graph theorists.
"synopsis" may belong to another edition of this title.
David Peleg is the Norman D. Cohen Professorial Chair of Computer Sciences at the Weizmann Institute of Science, Rehovot, Israel.
"About this title" may belong to another edition of this title.
US$ 33.25 shipping from United Kingdom to U.S.A.
Destination, rates & speedsUS$ 20.81 shipping from United Kingdom to U.S.A.
Destination, rates & speedsSeller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. New copy - Usually dispatched within 4 working days. 890. Seller Inventory # B9780898714647
Quantity: Over 20 available
Seller: dsmbooks, Liverpool, United Kingdom
Hardcover. Condition: Good. Good. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # D8S0-3-M-0898714648-6
Quantity: 1 available