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

Research output: Contribution to journal › Conference article

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 - Jan 1 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

Cite this

@article{b311bec13d544d38abcfb2678394d6e4,

title = "A new proof of the linearity of tile Boyer-Moore string searching algorithm",

author = "Guibas, {Leo J.} and Odlyzko, {Andrew M.}",

year = "1977",

month = jan,

day = "1",

language = "English (US)",

volume = "1977-October",

pages = "189--195",

journal = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

issn = "0272-5428",

note = "18th Annual Symposium on Foundations of Computer Science, SFCS 1977 ; Conference date: 31-10-1977 Through 02-11-1977",

}

TY - JOUR

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

AU - Guibas, Leo J.

AU - Odlyzko, Andrew M.

PY - 1977/1/1

Y1 - 1977/1/1

UR - http://www.scopus.com/inward/record.url?scp=85036561200&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85036561200&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:85036561200

VL - 1977-October

SP - 189

EP - 195

JO - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

JF - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SN - 0272-5428

T2 - 18th Annual Symposium on Foundations of Computer Science, SFCS 1977

Y2 - 31 October 1977 through 2 November 1977

ER -