String-matching cannot be done by a two-head one-way deterministic finite automation
Information Processing Letters
Remarks on string-matching and one-way multihead automata
Information Processing Letters
Kolmogorov complexity and its applications
Handbook of theoretical computer science (vol. A)
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
A fast string searching algorithm
Communications of the ACM
Time-space-optimal string matching (Preliminary Report)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Machine models and linear time complexity
ACM SIGACT News
Communication Complexity for Asynchronous Systems of Finite Devices
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Hi-index | 0.00 |