STACS 1992 Annual Symposium on Theoretical Aspects of Computer Science
 |  |
Wall of Fame | Most Viewed STACS-1992 Paper
STACS
1992
Springer
13 years 9 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
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 |  | 220 | ||
| 2 | | 116 | ||
| 3 | | 114 | ||
| 4 | | 95 | ||
| 5 | | 86 |