Home * People * J. Howard Johnson

J. Howard Johnson,
a Canadian computer scientist and research officer at the Institute for Information Technology, the National Research Council of Canada, in Ottawa since 1992. Before he was professor at the University of Waterloo, where he became interested in studying algorithms for text processing ^[1]. As Ph.D. student at University of Waterloo in 1981, he co-authored along with Jonathan Schaeffer the chess program Prodigy written in C. Johnson wrote the control part of the program, Schaeffer put in the chess knowledge ^[2].

Selected Publications

^{[3] [4]}

• J. Howard Johnson (1983). Formal Models for String Similarity. Ph.D. thesis, University of Waterloo ^[5]
• J. Howard Johnson (1985). Do Rational Equivalence Relations have Regular Cross-Sections? ICALP 1985, pp. 300-309.
• J. Howard Johnson (1986). Rational Equivalence Relations. Research Report, Department of Computer Science, University of Waterloo, pdf
• J. Howard Johnson (1993). Identifying Redundancy in Source Code using Fingerprints. CASCON 1993, pp. 171-183
• J. Howard Johnson (1994). Substring Matching for Clone Detection and Change Tracking. ICSM 1994, pp. 120-126, CiteSeerX
• J. Howard Johnson (2010). Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization. CIAA 2010, pp. 173-180

References

1. ^ Hakan Erdogmus, Oryal Tanir (2002). Advances in Software Engineering: Comprehension, Evaluation, and Evolution. xviii List of Contributors
2. ^ Jonathan Schaeffer (1997, 2009). One Jump Ahead. 1. This Was Going to Be Easy, pp. 8
3. ^ DBLP: J. Howard Johnson
4. ^ INR matters - Bibliography
5. ^ Students Supervised, University of Waterloo

What links here?

Up one level