| Publication | Date of Publication | Type |
|---|
Rpair: rescaling RePair with Rsync
| 2024-04-19 | Paper |
Computing longest Lyndon subsequences and longest common Lyndon subsequences
Algorithmica | 2024-03-25 | Paper |
Longest bordered and periodic subsequences
Information Processing Letters | 2023-06-05 | Paper |
Deterministic Sparse Suffix Sorting in the Restore Model
ACM Transactions on Algorithms | 2023-04-26 | Paper |
Practical Random Access to SLP-Compressed Texts
1523.68029 | 2022-12-22 | Paper |
Computing longest (common) Lyndon subsequences
| 2022-08-30 | Paper |
Space-efficient B trees via load-balancing
| 2022-08-30 | Paper |
Extracting the sparse longest common prefix array from the suffix binary search tree
| 2022-06-15 | Paper |
A separation of \(\gamma\) and \(b\) via Thue-Morse words
| 2022-06-15 | Paper |
A Separation of $\gamma$ and $b$ via Thue--Morse Words
| 2021-04-19 | Paper |
Faster Online Elastic Degenerate String Matching
| 2020-12-16 | Paper |
Lyndon factorization of grammar compressed texts revisited
| 2020-12-16 | Paper |
Faster privacy-preserving computation of edit distance with moves
| 2020-07-22 | Paper |
Refining the \(r\)-index
Theoretical Computer Science | 2020-02-20 | Paper |
Dynamic index and LZ factorization in compressed space
Discrete Applied Mathematics | 2020-02-14 | Paper |
A faster implementation of online RLBWT and its application to LZ77 parsing
Journal of Discrete Algorithms | 2019-01-18 | Paper |
Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes
Theoretical Computer Science | 2018-11-29 | Paper |
The runs theorem and beyond
| 2018-11-22 | Paper |
LZ-ABT: a practical algorithm for \(\alpha \)-balanced grammar compression
| 2018-09-06 | Paper |
Lempel-Ziv factorization powered by space efficient suffix trees
Algorithmica | 2018-07-25 | Paper |
A faster implementation of online run-length Burrows-Wheeler transform
| 2018-06-15 | Paper |
Fully dynamic data structure for LCE queries in compressed space
| 2018-03-21 | Paper |
Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets
Theory of Computing Systems | 2018-03-01 | Paper |
Efficiently finding all maximal \(\alpha\)-gapped repeats
| 2018-01-24 | Paper |
Deterministic sub-linear space LCE data structures with efficient construction
| 2017-10-17 | Paper |
A new characterization of maximal repetitions by Lyndon trees
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
The ``runs theorem
SIAM Journal on Computing | 2017-09-25 | Paper |
Inferring strings from Lyndon factorization
Theoretical Computer Science | 2017-09-07 | Paper |
Faster compact on-line Lempel-Ziv factorization
| 2017-03-03 | Paper |
Faster sparse suffix sorting
| 2017-03-03 | Paper |
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
Theoretical Computer Science | 2017-02-06 | Paper |
Closed factorization
Discrete Applied Mathematics | 2016-09-12 | Paper |
Deterministic Sparse Suffix Sorting on Rewritable Texts
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Inferring strings from full abelian periods
Algorithms and Computation | 2016-01-11 | Paper |
Arithmetics on suffix arrays of Fibonacci words
Lecture Notes in Computer Science | 2015-11-04 | Paper |
A faster algorithm for computing maximal \(\alpha \)-gapped repeats in a string
String Processing and Information Retrieval | 2015-10-02 | Paper |
Inferring strings from suffix trees and links on a binary alphabet
Discrete Applied Mathematics | 2015-09-22 | Paper |
Lempel Ziv computation in small space (LZ-CISS)
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Constructing LZ78 tries and position heaps in linear time for large alphabets
Information Processing Letters | 2015-06-02 | Paper |
Compressed automata for dictionary matching
Theoretical Computer Science | 2015-05-18 | Paper |
Detecting regularities on grammar-compressed strings
Information and Computation | 2015-01-30 | Paper |
Inferring Strings from Lyndon Factorization
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Computing palindromic factorizations and palindromic covers on-line
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Palindrome pattern matching
Theoretical Computer Science | 2014-01-09 | Paper |
Detecting regularities on grammar-compressed strings
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Compressed automata for dictionary matching
Implementation and Application of Automata | 2013-08-07 | Paper |
Efficient Lyndon factorization of grammar compressed text
Combinatorial Pattern Matching | 2013-06-14 | Paper |
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Information Processing Letters | 2012-10-23 | Paper |
Verifying and enumerating parameterized border arrays
Theoretical Computer Science | 2011-12-07 | Paper |
Palindrome pattern matching
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Verifying a parameterized border array in \(O(n ^{1.5})\) time
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Counting Parameterized Border Arrays for a Binary Alphabet
Language and Automata Theory and Applications | 2009-04-02 | Paper |
