Title :
A new proof of the linearity of the Boyer-Moore string searching algorithm
Author :
Guibas, Leo J. ; Odlyzko, Andrew M.
fDate :
Oct. 31 1977-Nov. 2 1977
Keywords :
Algorithm design and analysis; Costs; Laboratories; Linearity; Machinery; Pattern matching; Performance analysis; Performance evaluation; Telephony; Tiles;
Conference_Titel :
Foundations of Computer Science, 1977., 18th Annual Symposium on
Conference_Location :
Providence, RI, USA
DOI :
10.1109/SFCS.1977.3
