CSR   2010 International Computer Science Symposium
Wall of Fame | Most Viewed CSR-2010 Paper
10 years 11 months ago
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
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...
Pawel Gawrychowski, Artur Jez, Lukasz Jez
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source187
2Download preprint from source162
3Download preprint from source144
4Download preprint from source128
5Download preprint from source128
6Download preprint from source128
7Download preprint from source109
8Download preprint from source109
9Download preprint from source104
10Download preprint from source102
11Download preprint from source101
12Download preprint from source101
13Download preprint from source96
14Download preprint from source93
15Download preprint from source86
16Download preprint from source81