1. Gerard Tel. Introduction to distributed algorithms. Cambridge University Press, Cambridge ; New York, 1994.
   Note: 94016147 Gerard Tel. Includes bibliographical references (p. 512-524) and index. 1. Introduction: Distributed Systems -- Pt. 1. Protocols. 2. The Model. 3. Communication Protocols. 4. Routing Algorithms. 5. Deadlock-free Packet Switching -- Pt. 2. Fundamental Algorithms. 6. Wave and Traversal Algorithms. 7. Election Algorithms. 8. Termination Detection. 9. Anonymous Networks. 10. Snapshots. 11. Synchrony in Networks -- Pt. 3. Fault Tolerance. 12. Fault Tolerance in Distributed Systems. 13. Fault Tolerance in Asynchronous Systems. 14. Fault Tolerance in Synchronous Systems. 15. Stabilization -- Pt. 4. Appendices. A. Pseudocode Conventions. B. Graphs and Networks.
   Keywords: agents, algorithms, honours reading, coordination. [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.