Approximate congruence in nearly linear time
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pattern matching for sets of segments
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Approximate congruence in nearly linear time
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Information and Computation
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
The submatrices character count problem: an efficient solution using separable values
Information and Computation
Efficient algorithms for the scaled indexing problem
Journal of Algorithms
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Efficient algorithms for substring near neighbor problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient one-dimensional real scaled matching
Journal of Discrete Algorithms
Journal of Discrete Algorithms
L1 pattern matching lower bound
Information Processing Letters
Approximating general metric distances between a pattern and a text
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The Practical Efficiency of Convolutions in Pattern Matching Algorithms
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
A Black Box for Online Approximate Pattern Matching
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Resource scheduling with variable requirements over time
Journal of Scheduling
Approximated Pattern Matching with the L1 , L2 and L∞ Metrics
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
From coding theory to efficient pattern matching
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
ACM Transactions on Algorithms (TALG)
A black box for online approximate pattern matching
Information and Computation
String matching with swaps in a weighted sequence
CIS'04 Proceedings of the First international conference on Computational and Information Science
Approximate matching in weighted sequences
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Faster algorithms for δ,γ-matching and related problems
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Approximate matching in the L1 metric
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
L1 pattern matching lower bound
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
The Practical Efficiency of Convolutions in Pattern Matching Algorithms
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Self-normalised distance with don't cares
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |