Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Robert S. Boyer

Also Known As Robert Stephen Boyer · Bob Boyer
Theory of Computation

Robert Stephen Boyer is an American retired 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, and following that he worked with Moore and Matt Kaufmann on another theorem prover called ACL2. He was elected an AAAI Fellow in 1991.

Facts
Birth Year
1946 1
Birth Date
1946-08-02 2
Nationality
American 2
Award
AAAI Fellow 1
Award
Herbrand Award 1
Award
ACM Software System Award 1
Connections

Invented

Source Wikipedia: Boyer-Moore Algorithm

The Boyer-Moore-Horspool algorithm is a simplification of the Boyer-Moore string search algorithm, which Robert S. Boyer co-published with J Strother Moore in 1977.

In the Other Atlases
Sources
1. Wikidata: Robert S. Boyer
  • Wikidata Q4588776, class allow-list match (w-wdresolver-0926)
  • Wikidata Q4588776 P569 (date of birth)
2. Wikipedia: Robert S. Boyer
Wikimedia Foundation
  • Lead sentence
    Robert Stephen Boyer is an American retired professor of computer science
  • Infobox: Born
    Born (1946-08-02) August 2, 1946
View the Source
Wikipedia: Boyer-Moore Algorithm
Wikimedia FoundationInvented: Boyer-Moore Algorithm, Description section
Quote, Invented: Boyer-Moore Algorithm, Description section
It was developed by Robert S. Boyer and J Strother Moore in 1977.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.