Waiting time and complexity for matching patterns with automata
Information Processing Letters
Algorithms and theory of computation handbook
Validating the knuth-morris-pratt failure function, fast and online
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Theory of Computing Systems
Hi-index | 0.89 |