Distributed Algorithms (Lecture Notes in Computer Science, #392) 3rd International Workshop Nice, France, September 26-28, 1989 Proceedings

Bermond, J. C. ; & M. Raynal

ISBN 10: 3540516875 / ISBN 13: 9783540516873

Published by Springer-Verlag, 1989

About this Item

Softcover. Ex-Corporate Library copy; with typical markings. Library label on front cover and on spine tail. Very light surface rubbing on covers. Pages clean, but for library markings. ; TET22A; 314 pages; Ex-Library.

Seller Inventory # 57161

Bibliographic Details

• Title: Distributed Algorithms (Lecture Notes in Computer Science, #392) 3rd International Workshop Nice, France, September 26-28, 1989 Proceedings
• Publisher: Springer-Verlag
• Publication Date: 1989
• Language: English
• ISBN 10: 3540516875
• ISBN 13: 9783540516873
• Binding: Softcover
• Condition: with no dust jacket
• Dust Jacket Condition: No Dust Jacket

About this title

Synopsis

This book includes the papers presented at the Third International Workshop on Distributed Algorithms organized at La Colle-sur-Loup, near Nice, France, September 26-28, 1989 which followed the first two successful international workshops in Ottawa (1985) and Amsterdam (1987). This workshop provided a forum for researchers and others interested in distributed algorithms on communication networks, graphs, and decentralized systems. The aim was to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. Papers describe original results in all areas of distributed algorithms and their applications, including: distributed combinatorial algorithms, distributed graph algorithms, distributed algorithms for control and communication, distributed database techniques, distributed algorithms for decentralized systems, fail-safe and fault-tolerant distributed algorithms, distributed optimization algorithms, routing algorithms, design of network protocols, algorithms for transaction management, composition of distributed algorithms, and analysis of distributed algorithms.