1. Nancy Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
   Keywords: algorithmic complexity, computational complexity, algorithms, honours reading. [bibtex-entry]



2. 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]



3. Michael R. Garey and David S. Johnson. Computers and intractability : a guide to the theory of NP-completeness, A Series of books in the mathematical sciences.. W. H. Freeman, San Francisco, 1979.
   Note: Michael R. Garey, David S. Johnson. Includes indexes. Bibliography: p. [291]-325. NP-completeness.
   Keywords: computational complexity, algorithms, honours reading. [bibtex-entry]

1. Ramon Bejar, Carmel Domshlak, Cèsar Fernandez, Carla Gomes, Bhaskar Krishnamachari, Bart Selman, and Magda Valls. Sensor networks and distributed CSP: communication, computation and complexity. Artificial Intelligence, 161(1-2):117--147, 2005.
   Keywords: algorithms, honours reading, constraint satisfaction, sensor networks. [bibtex-entry]



2. P. J. Modi, W. Shen, M. Tambe, and M. Yokoo. Adopt: asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1-2):149--180, 2005.
   Keywords: algorithms, honours reading, constraint satisfaction, DCOP, DCSP. [bibtex-entry]



3. Johan van Benthem. Extensive Games as Process Models. Journal of Logic, Language and Information, 11(3):289--313, 2002.
   Keywords: game theory, model theory, algorithms, honours reading. [bibtex-entry]



4. Johan van Benthem. Games in Dynamic-Epistemic Logic. Bulletin of Economic Research, 53(4):219--48, 2001.
   Keywords: epistemic logic, game theory, algorithms, honours reading. [abstract] [bibtex-entry]



5. Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.
   Keywords: algorithms, honours reading, constraint satisfaction, logistics. [bibtex-entry]



6. Juan A. Garay and Yoram Moses:. Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds.. SIAM J. Comput, 27(1):247--290, 1998.
   Keywords: algorithms, computational complexity, honours reading. [bibtex-entry]



7. Bradley S. Stewart, Ching-Fang Liaw, and Chelsea C. White. A bibliography of heuristic search research through 1992. IEEE Transactions on Systems, Man, and Cybernetics, 24(2):268--293, 1994.
   Keywords: algorithms, honours reading. [bibtex-entry]



8. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401, 1982.
   Keywords: honours reading, algorithms, coordination, agent communication languagess. [bibtex-entry]



9. S. Amarel. On representations of problems of reasoning about actions. Machine Intelligence, 3:131--171, 1968.
   Keywords: algorithms, honours reading. [abstract] [bibtex-entry]

1. Pragnesh Jay Modi, Shen Wei-Min, and Milind Tambe. An Asynchronous Complete method for distributed constraint optimization. In Jeffrey S. Rosenschein, Tuomas Sandholm, Michael Wooldridge, and Makoto Yokoo, editors, AAMAS-2003, Melbourne, pages 161--176, 2003.
   Keywords: constraint satisfaction, computational complexity, algorithms, DCOP, DCSP. [abstract] [bibtex-entry]



2. David S. Johnson. Local optimization and the traveling salesman problem. In M. S. Paterson, editor, Automata, Languages and Programming. 17th International Colloquium Proceedings; Coventry, UK, Berlin, Germany, pages p. ix+780, 446--61, 1990. Springer-Verlag.
   Keywords: algorithms, honours reading. [bibtex-entry]

1. Mohammad Taghi Hajiaghayi. Algorithms for Graphs of (Locally) Bounded Treewidth. PhD thesis, University of Waterloo, 2001.
   Keywords: graph matching, graph theory, algorithms, honours reading. [bibtex-entry]

1. R. B. Borie, R. Gary Parker, and C. A. Tovey. Solving problems on recursively constructed graphs. Technical Report TR-2002-04, Dept. Comp. Sci., University of Alabama, 2002.
   Keywords: graph theory, algorithms, computational complexity, honours reading. [bibtex-entry]



2. Leslie Lamport and Michael Fischer. Byzantine Generals and transaction commit protocols. Technical report Op. 62, SRI International and Yale University, 1984.
   Keywords: honours reading, coordination, agent communication languagess, algorithms. [abstract] [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.