Saving Space in Fast String-Matching
- 1 May 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (2) , 417-438
- https://doi.org/10.1137/0209032
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- String Matching in Real TimeJournal of the ACM, 1981
- New Real-Time Simulations of Multihead Tape UnitsJournal of the ACM, 1981
- Palindrome recognition in real time by a multitape turing machineJournal of Computer and System Sciences, 1978
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- On Time Versus SpaceJournal of the ACM, 1977
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975
- Counter machines and counter languagesTheory of Computing Systems, 1968
- Real-time solutions of the origin-crossing problemTheory of Computing Systems, 1968
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962