12265 search results - page 1 / 2453 » Knuth-Morris-Pratt Algorithm: An Analysis |
MFCS
1989
Springer
15 years 1 months ago
1989
Springer
102
Voted
CSR
2010
Springer
15 years 2 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
CPM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...