Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Theoretical Computer Science
ACM Transactions on Graphics (TOG)
Longest common factor of two words
The International Joint Conference on theory and practice of software development on TAPSOFT '87
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
Detecting plagiarism in student Pascal programs
The Computer Journal
Data structures and algorithms for approximate string matching
Journal of Complexity
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
A data structure for dynamic trees
Journal of Computer and System Sciences
Identifying the semantic and textual differences between two versions of a program
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Fast text searching: allowing errors
Communications of the ACM
The Suffix of a square matrix, with applications
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Linear Algorithm for Data Compression via String Matching
Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences
Communications of the ACM
The UNIX Programming Environment
The UNIX Programming Environment
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Parameterized pattern matching by Boyer-Moore-type algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for dynamic text indexing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Faster suffix tree construction with missing suffix links
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Compiler techniques for code compaction
ACM Transactions on Programming Languages and Systems (TOPLAS)
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximate subset matching with Don't Cares
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
From relational program dependencies to hypertextual access structures
Nordic Journal of Computing
Multidimensional matching and fast search in suffix trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Longest Common Subsequence from Fragments via Sparse Dynamic Programming
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Information and Computation
On finding duplication and near-duplication in large software systems
WCRE '95 Proceedings of the Second Working Conference on Reverse Engineering
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Insufficiency of four known necessary conditions on string unavoidability
Journal of Algorithms
Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Detecting near-duplicates for web crawling
Proceedings of the 16th international conference on World Wide Web
Journal of Discrete Algorithms
Finding similar files in a large file system
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
Finding Clones with Dup: Analysis of an Experiment
IEEE Transactions on Software Engineering
Approximating general metric distances between a pattern and a text
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast parameterized matching with q-grams
Journal of Discrete Algorithms
Note: Pattern matching with pair correlation distance
Theoretical Computer Science
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Pattern Matching with Pair Correlation Distance
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
On-Line Construction of Parameterized Suffix Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Insufficiency of four known necessary conditions on string unavoidability
Journal of Algorithms
WebVigiL: user profile-based change detection for HTML/XML documents
BNCOD'03 Proceedings of the 20th British national conference on Databases
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Information Processing Letters
On-line construction of parameterized suffix trees for large alphabets
Information Processing Letters
Sublinear algorithms for parameterized matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Two dimensional parameterized matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Parameterized longest previous factor
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
p-Suffix sorting as arithmetic coding
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Parameterized longest previous factor
Theoretical Computer Science
Variations of the parameterized longest previous factor
Journal of Discrete Algorithms
p-Suffix sorting as arithmetic coding
Journal of Discrete Algorithms
Approximate function matching under δ- and γ- distances
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Viewing functions as token sequences to highlight similarities in source code
Science of Computer Programming
Journal of Discrete Algorithms
Hi-index | 0.00 |