1. David K. Lewis. Counterfactuals. Harvard University Press, Cambridge,, 1973.
   Note: [by] David K. Lewis. Includes bibliographical references.
   Keywords: model theory, honours reading.
   

   @Book{Lewis1973,
   author = "David K. Lewis",
   title = "Counterfactuals",
   publisher = "Harvard University Press",
   address = "Cambridge,",
   note = "[by] David K. Lewis. Includes bibliographical references.",
   keywords = "model theory, honours reading",
   year = "1973",
   
   }
   

1. G. David Forney. The Viterbi Algorithm. Proceedings of The IEEE, 61(3):268--278, 1973.
   Keywords: Markov theory, honours reading.
   

   @Article{Forney1973,
   author = "G. David Forney",
   title = "The Viterbi Algorithm",
   journal = "Proceedings of The IEEE",
   volume = "61",
   number = "3",
   pages = "268--278",
   keywords = "Markov theory, honours reading",
   year = "1973",
   
   }
   




2. L. Stockmeyer. Planar 3-colorability is polynomial complete.. SIGACT News,, 5(3):19--25, 1973.
   Keywords: graph theory, computational complexity, honours reading.
   

   @Article{Stockmeyer1973,
   author = "L. Stockmeyer",
   title = "Planar 3-colorability is polynomial complete.",
   journal = "SIGACT News,",
   volume = "5",
   number = "3",
   pages = "19--25",
   keywords = "graph theory, computational complexity, honours reading",
   year = "1973",
   
   }
   

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.