Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
SIAM Journal on Computing
Information retrieval: data structures and algorithms
Information retrieval: data structures and algorithms
Information retrieval
Journal of the ACM (JACM)
Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
String matching under a general matching relation
Information and Computation
A survey of information retrieval and filtering methods
A survey of information retrieval and filtering methods
Tree pattern matching and subset matching in randomized O(nlog3m) time
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Geometric matching under noise: combinatorial bounds and algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Deterministic Superimposed Coding with Applications to Pattern Matching
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Efficient tree pattern matching
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Interpolation of symmetric functions and a new type of combinatorial design
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Geometric matching under noise: combinatorial bounds and algorithms
Proceedings of the tenth 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
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree pattern matching with a more general notion of occurrence of the pattern
Information Processing Letters
On special families of morphisms related to δ-matching and don't care symbols
Information Processing Letters
Constructing the Suffix Tree of a Tree with a Large Alphabet
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Tree Pattern Matching for Linear Static Terms
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Patterns in Words versus Patterns in Trees: A Brief Survey and New Results
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Unordered Tree Mining with Applications to Phylogeny
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Chopper: efficient algorithm for tree mining
Journal of Computer Science and Technology
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Transposition invariant string matching
Journal of Algorithms
A new tree inclusion algorithm
Information Processing Letters
On the top-down tree inclusion
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
New Perspectives on the Prefix Array
SPIRE '08 Proceedings of the 15th 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
Transposition invariant string matching
Journal of Algorithms
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Indeterminate string inference algorithms
Journal of Discrete Algorithms
A bit-parallel tree matching algorithm for patterns with horizontal VLDC's
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
| Hi-index | 0.00 |