Original language | English (US) |
---|---|
Pages (from-to) | 189-195 |
Number of pages | 7 |
Journal | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
Volume | 1977-October |
State | Published - 1977 |
Externally published | Yes |
Event | 18th Annual Symposium on Foundations of Computer Science, SFCS 1977 - Providence, United States Duration: Oct 31 1977 → Nov 2 1977 |
A new proof of the linearity of tile Boyer-Moore string searching algorithm
Leo J. Guibas, Andrew M. Odlyzko
Research output: Contribution to journal › Conference article › peer-review
11
Scopus
citations