Recognizing string graphs in NP
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The complexity of compressing subsegments of images described by finite automata
Discrete Applied Mathematics
Pattern-matching problems for two-dimensional images described by finite automata
Nordic Journal of Computing
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Algorithms for Normal Curves and Surfaces
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Pattern Matching in Text Compressed by Using Antidictionaries
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Shift-And Approach to Pattern Matching in LZW Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Collage system: a unifying framework for compressed pattern matching
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
Fundamenta Informaticae - Special issue on computing patterns in strings
Recognizing string graphs in NP
Journal of Computer and System Sciences - STOC 2002
A PTIME-complete matching problem for SLP-compressed words
Information Processing Letters
LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text: Research Articles
Software—Practice & Experience
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Theoretical Computer Science
Unification with Singleton Tree Grammars
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Computing longest common substring and all palindromes from compressed strings
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Testing square-freeness of strings compressed by balanced straight line program
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Compressed conjugacy and the word problem for outer automorphism groups of graph groups
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Counting and verifying maximal palindromes
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Unification and matching on compressed terms
ACM Transactions on Computational Logic (TOCL)
Leaf languages and string compression
Information and Computation
Compressed membership in automata with compressed labels
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Window subsequence problems for compressed texts
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Querying and embedding compressed texts
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Space efficient deep packet inspection of compressed web traffic
Computer Communications
Efficient retrieval of approximate palindromes in a run-length encoded string
Theoretical Computer Science
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Information Processing Letters
Faster fully compressed pattern matching by recompression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Accelerating multipattern matching on compressed HTTP traffic
IEEE/ACM Transactions on Networking (TON)
Fundamenta Informaticae - Computing Patterns in Strings
Efficient computation in groups via compression
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Fast q-gram mining on SLP compressed strings
Journal of Discrete Algorithms
Isomorphism of regular trees and words
Information and Computation
Compressed automata for dictionary matching
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |