| Publication | Date of Publication | Type |
|---|
| String indexing for top-\(k\) close consecutive occurrences | 2026-03-23 | Paper |
| Sparse regular expression matching | 2024-11-28 | Paper |
| Sliding window string indexing in streams | 2024-10-21 | Paper |
| Predecessor on the ultra-wide word RAM | 2024-05-27 | Paper |
| The fine-grained complexity of episode matching | 2024-05-06 | Paper |
Predecessor on the Ultra-Wide Word RAM
Algorithmica | 2024-04-24 | Paper |
| scientific article; zbMATH DE number 7765406 (Why is no real title available?) | 2023-11-14 | Paper |
String Indexing with Compressed Patterns
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Random access in persistent strings and segment selection
Theory of Computing Systems | 2023-08-17 | Paper |
The complexity of the co-occurrence problem
String Processing and Information Retrieval | 2023-08-04 | Paper |
Compressed communication complexity of longest common prefixes
String Processing and Information Retrieval | 2023-07-28 | Paper |
| Gapped indexing for consecutive occurrences | 2023-06-14 | Paper |
Gapped indexing for consecutive occurrences
Algorithmica | 2023-04-11 | Paper |
String Indexing with Compressed Patterns.
(available as arXiv preprint) | 2023-02-07 | Paper |
| Top Tree Compression of Tries. | 2023-02-03 | Paper |
Partial sums on the ultra-wide word RAM
Lecture Notes in Computer Science | 2022-12-22 | Paper |
From regular expression matching to parsing
Acta Informatica | 2022-10-24 | Paper |
String indexing for top-\(k\) close consecutive occurrences
Theoretical Computer Science | 2022-08-10 | Paper |
From Regular Expression Matching to Parsing
(available as arXiv preprint) | 2022-07-21 | Paper |
Partial sums on the ultra-wide word RAM
Theoretical Computer Science | 2022-02-01 | Paper |
Top tree compression of tries
Algorithmica | 2022-01-18 | Paper |
Top tree compression of tries
Algorithmica | 2022-01-18 | Paper |
Tight bounds for top tree compression
String Processing and Information Retrieval | 2021-02-16 | Paper |
Succinct partial sums and Fenwick trees
String Processing and Information Retrieval | 2021-02-16 | Paper |
Fast dynamic arrays
(available as arXiv preprint) | 2020-05-27 | Paper |
Deterministic indexing for packed strings
(available as arXiv preprint) | 2020-05-25 | Paper |
| Time-space trade-offs for Lempel-Ziv compressed indexing | 2020-05-25 | Paper |
| Lempel-Ziv Compression in a Sliding Window | 2020-05-25 | Paper |
Finger search in grammar-compressed strings
Theory of Computing Systems | 2019-09-05 | Paper |
Dynamic relative compression, dynamic partial sums, and substring concatenation
Algorithmica | 2019-01-11 | Paper |
A separation between RLSLPs and LZ77
Journal of Discrete Algorithms | 2018-12-14 | Paper |
Sparse text indexing in small space
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Dynamic relative compression, dynamic partial sums, and substring concatenation
(available as arXiv preprint) | 2018-04-19 | Paper |
Finger Search in Grammar-Compressed Strings
(available as arXiv preprint) | 2018-04-19 | Paper |
Time-space trade-offs for Lempel-Ziv compressed indexing
Theoretical Computer Science | 2018-02-06 | Paper |
| Boxed permutation pattern matching | 2017-10-17 | Paper |
| Random access to grammar-compressed strings | 2017-09-29 | Paper |
Subsequence automata with default transitions
Journal of Discrete Algorithms | 2017-07-13 | Paper |
Fingerprints in compressed strings
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Substring range reporting
Algorithmica | 2017-03-27 | Paper |
Compressed subsequence matching and packed tree coloring
Algorithmica | 2017-03-03 | Paper |
Longest common extensions in trees
Theoretical Computer Science | 2016-06-16 | Paper |
Compressed data structures for range searching
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Subsequence automata with default transitions
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Longest common extensions in trees
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Longest common extensions in sublinear space
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Random access to grammar-compressed strings and trees
SIAM Journal on Computing | 2015-06-11 | Paper |
Tree compression with top trees
Information and Computation | 2015-06-09 | Paper |
String indexing for patterns with wildcards
Theory of Computing Systems | 2015-02-05 | Paper |
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
ACM Transactions on Algorithms | 2014-11-18 | Paper |
The tree inclusion problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Compact q-gram profiling of compressed strings
Theoretical Computer Science | 2014-08-26 | Paper |
Compressed subsequence matching and packed tree coloring
Lecture Notes in Computer Science | 2014-06-30 | Paper |
| Regular expression matching with multi-strings and intervals | 2014-05-22 | Paper |
Time-space trade-offs for longest common extensions
Journal of Discrete Algorithms | 2014-04-01 | Paper |
Towards optimal packed string matching
Theoretical Computer Science | 2014-03-13 | Paper |
Fingerprints in compressed strings
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Sparse suffix tree construction in small space
Automata, Languages, and Programming | 2013-08-06 | Paper |
Tree compression with top trees
Automata, Languages, and Programming | 2013-08-06 | Paper |
Compact \(q\)-gram profiling of compressed strings
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Faster approximate string matching for short patterns
Theory of Computing Systems | 2012-12-06 | Paper |
| Optimal packed string matching | 2012-08-31 | Paper |
Time-Space Trade-Offs for Longest Common Extensions
Combinatorial Pattern Matching | 2012-08-14 | Paper |
String indexing for patterns with wildcards
Lecture Notes in Computer Science | 2012-08-14 | Paper |
String matching with variable length gaps
Theoretical Computer Science | 2012-08-10 | Paper |
Longest common extensions via fingerprinting
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Fast and cache-oblivious dynamic programming with local dependencies
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Fast arc-annotated subsequence matching in linear space
Algorithmica | 2012-04-26 | Paper |
Substring Range Reporting
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Fast searching in packed strings
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Fast arc-annotated subsequence matching in linear space
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Faster Regular Expression Matching
Automata, Languages and Programming | 2009-07-14 | Paper |
Fast Searching in Packed Strings
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Matching subsequences in trees
Journal of Discrete Algorithms | 2009-06-24 | Paper |
New Algorithms for Regular Expression Matching
Automata, Languages and Programming | 2009-03-12 | Paper |
Fast and compact regular expression matching
Theoretical Computer Science | 2009-01-08 | Paper |
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Fast Evaluation of Union-Intersection Expressions
Algorithms and Computation | 2008-05-27 | Paper |
Matching Subsequences in Trees
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Labeling Schemes for Small Distances in Trees
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Computer Vision - ECCV 2004
Lecture Notes in Computer Science | 2005-12-27 | Paper |
A survey on tree edit distance and related problems
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2079400 (Why is no real title available?) | 2004-07-28 | Paper |
