Random generation of combinatorial structures from a uniform
Theoretical Computer Science
The computational linguistics of biological sequences
Artificial intelligence and molecular biology
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
RE-tree: an efficient index structure for regular expressions
The VLDB Journal — The International Journal on Very Large Data Bases
Optimizing markov models with applications to triangular connectivity coding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
RE-Tree: an efficient index structure for regular expressions
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generating, sampling and counting subclasses of regular tree languages
Proceedings of the 14th International Conference on Database Theory
Best fitting fixed-length substring patterns for a set of strings
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Measuring over-generalization in the minimal multiple generalizations of biosequences
DS'05 Proceedings of the 8th international conference on Discovery Science
The complexity of evaluating path expressions in SPARQL
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Isomorphism of regular trees and words
Information and Computation
The complexity of regular expressions and property paths in SPARQL
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.00 |