CSR 2010 International Computer Science Symposium
 |  |
Wall of Fame | Most Viewed CSR-2010 Paper
CSR
2010
Springer
13 years 9 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...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 187 | ||
| 2 | | 162 | ||
| 3 | | 144 | ||
| 4 | | 128 | ||
| 5 | | 128 | ||
| 6 | | 128 | ||
| 7 | | 109 | ||
| 8 | | 109 | ||
| 9 | | 104 | ||
| 10 | | 102 | ||
| 11 | | 101 | ||
| 12 | | 101 | ||
| 13 | | 96 | ||
| 14 | | 93 | ||
| 15 | | 86 | ||
| 16 | | 81 |