A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Shifting Graphs and Their Applications
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Hardware algorithms for nonnumeric computation
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
A short survey on the state of the art in matching and unification problems
ACM SIGSAM Bulletin
Succinct Text Indexing with Wildcards
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Set Intersection and Sequence Matching
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Indeterminate string inference algorithms
Journal of Discrete Algorithms
Finding patterns with variable length gaps or don’t cares
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Parsing Boolean grammars over a one-letter alphabet using online convolution
Theoretical Computer Science
Faster variance computation for patterns with gaps
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
| Hi-index | 0.02 |