Theoretical Computer Science
Reducing space for index implementation
Theoretical Computer Science
Text Compression Using Antidictionaries
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Factor Oracle: A New Structure for Pattern Matching
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Forbidden Factors and Fragment Assembly
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
String pattern matching for a deluge survival kit
Handbook of massive data sets
Computing forbidden words of regular languages
Fundamenta Informaticae - Special issue on computing patterns in strings
From monomials to words to graphs
Journal of Combinatorial Theory Series A
Information Processing Letters
Theoretical Computer Science - The art of theory
Word assembly through minimal forbidden words
Theoretical Computer Science
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Length of minimal forbidden words on a stationary ergodic source
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Information Processing Letters
Combinatorial complexity of regular languages
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Growth rates of complexity of power-free languages
Theoretical Computer Science
Negative selection algorithms on strings with efficient training and linear-time classification
Theoretical Computer Science
Growth properties of power-free languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Building phylogeny with minimal absent words
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Outfix-free regular languages and prime outfix-free decomposition
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Growth of power-free languages over large alphabets
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Factorial languages of low combinatorial complexity
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Automata and differentiable words
Theoretical Computer Science
Using minimal absent words to build phylogeny
Theoretical Computer Science
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
Computing forbidden words of regular languages
Fundamenta Informaticae - Computing Patterns in Strings
Computing the longest common prefix array based on the Burrows-Wheeler transform
Journal of Discrete Algorithms
Growth of Power-Free Languages over Large Alphabets
Theory of Computing Systems
| Hi-index | 0.90 |