Robert S. Boyer
From Wikipedia, the free encyclopedia
This article is about the professor. For the murderer, see Robert Boyer.
Robert Stephen Boyer, also known as Bob Boyer, is a professor of computer science, mathematics, and philosophy at The University of Texas at Austin. He and J Strother Moore invented the Boyer-Moore string search algorithm, a particularly efficient string searching algorithm, in 1977. He and Moore also collaborated on the Boyer-Moore automated theorem prover, Nqthm, in 1992.[1]
[edit] Publications
Dr. Boyer has published extensively, including the following books:
- A Computational Logic Handbook, with J S. Moore. Second Edition. Academic Press, London, 1998.
- Automated Reasoning: Essays in Honor of Woody Bledsoe, editor. Kluwer Academic, Dordrecht, The Netherlands, 1991.
- A Computational Logic Handbook, with J S. Moore. Academic Press, New York, 1988.
- The Correctness Problem in Computer Science, editor, with J S. Moore. Academic Press, London, 1981.
- A Computational Logic, with J S. Moore. Academic Press, New York, 1979.
[edit] External links
- Home page of Robert S. Boyer. Accessed March 14, 2006.
[edit] References
- ^ Nqthm, the Boyer-Moore prover. Retrieved on April 21, 2006.
 |
This biography of an American academic is a stub. You can help Wikipedia by expanding it. |
