Jump to content

Nigel Horspool

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Ser Amantio di Nicolao (talk | contribs) at 05:43, 26 September 2018 (→External links: add authority control, test). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

R. Nigel Horspool[1] was a professor of computer science at the University of Victoria. He invented the Boyer–Moore–Horspool algorithm, a fast string search algorithm adapted from the Boyer–Moore string search algorithm. Horspool is co-inventor of dynamic Markov compression and is editor-at-large of the journal Software: Practice and Experience.[2] He is the author of C Programming in the Berkeley UNIX Environment.

Nigel Horspool is British by birth, but is now a citizen of Canada. After a public school education at Monmouth School, he studied at Pembroke College, Cambridge where he received a BA in Natural Science, but specializing in Theoretical Physics, in 1969. After two years employment as an assembly language programmer on a failed air traffic control system project, he went to the University of Toronto for an MSc followed by a PhD in computer science. This was followed by seven years as an assistant professor and then an associate professor at McGill University. In 1983, he made a permanent move to the University of Victoria. As of July 2016, he retired from the university but retains the title of professor emeritus.

References

  1. ^ Horspool's page at University of Victoria
  2. ^ Software: Practice and Experience



P ≟ NP 

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Nigel_Horspool&oldid=861260280"