| Publication | Date of Publication | Type |
|---|
| Computing longest Lyndon subsequences and longest common Lyndon subsequences | 2024-03-25 | Paper |
| Longest bordered and periodic subsequences | 2023-06-05 | Paper |
| Deterministic Sparse Suffix Sorting in the Restore Model | 2023-04-26 | Paper |
| Practical Random Access to SLP-Compressed Texts | 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 | 2020-02-20 | Paper |
| Dynamic index and LZ factorization in compressed space | 2020-02-14 | Paper |
| A faster implementation of online RLBWT and its application to LZ77 parsing | 2019-01-18 | Paper |
| Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes | 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 | 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 | 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 | 2017-10-05 | Paper |
| The “Runs” Theorem | 2017-09-25 | Paper |
| Inferring strings from Lyndon factorization | 2017-09-07 | Paper |
| Faster Sparse Suffix Sorting | 2017-03-03 | Paper |
| Faster Compact On-Line Lempel-Ziv Factorization | 2017-03-03 | Paper |
| Faster Lyndon factorization algorithms for SLP and LZ78 compressed text | 2017-02-06 | Paper |
| Closed factorization | 2016-09-12 | Paper |
| Deterministic Sparse Suffix Sorting on Rewritable Texts | 2016-05-03 | Paper |
| Inferring Strings from Full Abelian Periods | 2016-01-11 | Paper |
| Arithmetics on Suffix Arrays of Fibonacci Words | 2015-11-04 | Paper |
| A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String | 2015-10-02 | Paper |
| Inferring strings from suffix trees and links on a binary alphabet | 2015-09-22 | Paper |
| Lempel Ziv Computation in Small Space (LZ-CISS) | 2015-08-20 | Paper |
| Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree | 2015-08-20 | Paper |
| Constructing LZ78 tries and position heaps in linear time for large alphabets | 2015-06-02 | Paper |
| Compressed automata for dictionary matching | 2015-05-18 | Paper |
| Detecting regularities on grammar-compressed strings | 2015-01-30 | Paper |
| Inferring Strings from Lyndon Factorization | 2014-10-14 | Paper |
| Computing Palindromic Factorizations and Palindromic Covers On-line | 2014-06-30 | Paper |
| Palindrome pattern matching | 2014-01-09 | Paper |
| Detecting Regularities on Grammar-Compressed Strings | 2013-09-20 | Paper |
| Compressed Automata for Dictionary Matching | 2013-08-07 | Paper |
| Efficient Lyndon Factorization of Grammar Compressed Text | 2013-06-14 | Paper |
| An efficient algorithm to test square-freeness of strings compressed by straight-line programs | 2012-10-23 | Paper |
| Verifying and enumerating parameterized border arrays | 2011-12-07 | Paper |
| Palindrome Pattern Matching | 2011-06-29 | Paper |
| Verifying a Parameterized Border Array in O(n 1.5) Time | 2010-07-26 | Paper |
| Counting Parameterized Border Arrays for a Binary Alphabet | 2009-04-02 | Paper |
