A new proof of the linearity of tile Boyer-Moore string searching algorithm

Leo J. Guibas, Andrew M. Odlyzko

Research output: Contribution to journalConference article

11 Scopus citations
Original languageEnglish (US)
Pages (from-to)189-195
Number of pages7
JournalProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume1977-October
StatePublished - Jan 1 1977
Externally publishedYes
Event18th Annual Symposium on Foundations of Computer Science, SFCS 1977 - Providence, United States
Duration: Oct 31 1977Nov 2 1977

Cite this