He has written four books in computer science and combinatorics. His book Comparative Programming Languages was regarded among the major textbooks on programming languages[3] and has received positive reviews since its first edition.[4] This book was translated into French in its second edition.[5] As a researcher, he is best known for his contributions to extensions of the stable marriage problem.[6][7]
Page, Ewan Stafford; Wilson, Leslie Blackett (1979). An introduction to computational combinatorics. Cambridge Computer Science Texts. Vol. 9. New York, NY, USA: Cambridge University Press. p. 228. ISBN978-0-521-29492-8.
^ abWho's who in science in Europe : a biographical guide in science, technology, agriculture, and medicine. Detroit, MI, USA: Longman. 1984. p. 786. ISBN978-0-582-90109-4.
^Reynolds, Chris (22 April 1989). "Computers in context". New Scientist. 1661: 63–64.
^ abWilson, Leslie Blackett; Clark, Robert George (1993). Langages de Programmation Comparés. Paris: Addison-Wesley France. p. 452. ISBN978-2-87908-060-4.