| Publication | Date of Publication | Type |
|---|
Quasi-linear-time algorithm for a longest common circular factor
Theoretical Computer Science | 2026-05-11 | Paper |
Logarithmic-time internal pattern matching queries in compressed and dynamic texts
Theory of Computing Systems | 2026-04-27 | Paper |
On the complexity of computing the co-lexicographic width of a regular language
Journal of Computer and System Sciences | 2026-03-12 | Paper |
| Optimal algorithms for bounded weighted edit distance | 2025-08-15 | Paper |
| Collapsing the hierarchy of compressed data structures: suffix arrays in optimal compressed space | 2025-08-15 | Paper |
| Approximating edit distance in the fully dynamic model | 2025-08-15 | Paper |
| Faster pattern matching under edit distance: a reduction to dynamic puzzle matching and the seaweed monoid of permutation matrices | 2025-08-15 | Paper |
| \(\widetilde{O}(n + \operatorname{poly}(k))\)-time algorithm for bounded tree edit distance | 2025-08-15 | Paper |
| Gap edit distance via non-adaptive queries: simple and optimal | 2025-08-15 | Paper |
| Small-space and streaming pattern matching with k edits | 2025-08-13 | Paper |
| Sublinear-time algorithms for computing \& embedding gap edit distance | 2025-08-12 | Paper |
| Resolution of the Burrows-Wheeler transform conjecture | 2025-08-12 | Paper |
| Faster approximate pattern matching: a unified approach | 2025-08-12 | Paper |
| Small-space algorithms for the online language distance problem for palindromes and squares | 2025-07-24 | Paper |
| Approximate circular pattern matching | 2025-06-19 | Paper |
An improved algorithm for the k-Dyck edit distance problem
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Bellman-Ford is optimal for shortest Hop-bounded paths | 2025-01-06 | Paper |
| Dynamic dynamic time warping | 2024-11-28 | Paper |
| Faster sublinear-time edit distance | 2024-11-28 | Paper |
| Near-optimal quantum algorithms for bounded edit distance and Lempel-Ziv factorization | 2024-11-28 | Paper |
| Linear-time computation of cyclic roots and cyclic covers of a string | 2024-10-21 | Paper |
Internal pattern matching queries in a text and applications
SIAM Journal on Computing | 2024-10-21 | Paper |
| An algorithmic bridge between Hamming and Levenshtein distances | 2024-09-25 | Paper |
| How compression and approximation affect efficiency in string distance measures | 2024-07-19 | Paper |
| An improved algorithm for the \(k\)-Dyck edit distance problem | 2024-07-19 | Paper |
| Improved approximation algorithms for Dyck edit distance and RNA folding | 2024-06-24 | Paper |
| Breaking the \(\mathcal{O}(n)\)-barrier in the construction of compressed suffix arrays and suffix trees | 2024-05-14 | Paper |
| Weighted edit distance computation: strings, trees, and Dyck | 2024-05-08 | Paper |
| The dynamic k-mismatch problem | 2024-05-06 | Paper |
| On longest common property preserved substring queries | 2024-04-19 | Paper |
| Weighted shortest common supersequence problem revisited | 2024-04-19 | Paper |
Near-optimal search time in -optimal space, and vice versa
Algorithmica | 2024-04-02 | Paper |
Computing longest Lyndon subsequences and longest common Lyndon subsequences
Algorithmica | 2024-03-25 | Paper |
Toward a Definitive Compressibility Measure for Repetitive Sequences
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
Dynamic suffix array with polylogarithmic queries and updates
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Improved dynamic algorithms for longest increasing subsequence
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7758348 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7740885 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Faster recovery of approximate periods over edit distance
String Processing and Information Retrieval | 2023-07-28 | Paper |
Efficient computation of sequence mappability
String Processing and Information Retrieval | 2023-07-28 | Paper |
Near-optimal search time in -optimal space
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Tight bound for the number of distinct palindromes in a tree
The Electronic Journal of Combinatorics | 2023-05-16 | Paper |
scientific article; zbMATH DE number 7651096 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Counting distinct patterns in internal dictionary matching
(available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651106 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Practical Performance of Space Efficient Data Structures for Longest Common Extensions. | 2023-02-07 | Paper |
| Dynamic String Alignment. | 2023-02-07 | Paper |
Approximating Longest Common Substring with k mismatches: Theory and Practice
(available as arXiv preprint) | 2023-02-07 | Paper |
| Internal dictionary matching | 2023-02-03 | Paper |
Efficient Enumeration of Distinct Factors Using Package Representations
1511.68098 | 2022-12-22 | Paper |
| Towards a definitive measure of repetitiveness | 2022-10-13 | Paper |
Computing longest (common) Lyndon subsequences
(available as arXiv preprint) | 2022-08-30 | Paper |
Longest unbordered factor in quasilinear time
(available as arXiv preprint) | 2022-07-21 | Paper |
Graph and string parameters: connections between pathwidth, cutwidth and the locality number
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561710 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
(available as arXiv preprint) | 2022-07-18 | Paper |
Efficient representation and counting of antipower factors in words
Information and Computation | 2022-06-13 | Paper |
Efficient computation of sequence mappability
Algorithmica | 2022-05-03 | Paper |
A periodicity lemma for partial words
Information and Computation | 2022-03-14 | Paper |
Optimal-Time Dictionary-Compressed Indexes
ACM Transactions on Algorithms | 2022-02-08 | Paper |
| Edit distance with block operations | 2021-08-04 | Paper |
Internal dictionary matching
Algorithmica | 2021-06-30 | Paper |
Internal dictionary matching
Algorithmica | 2021-06-30 | Paper |
A linear-time algorithm for seeds computation
ACM Transactions on Algorithms | 2021-05-03 | Paper |
On two LZ78-style grammars: compression bounds and compressed-space computation
String Processing and Information Retrieval | 2021-02-16 | Paper |
On two LZ78-style grammars: compression bounds and compressed-space computation
String Processing and Information Retrieval | 2021-02-16 | Paper |
Maximal unbordered factors of random strings
Theoretical Computer Science | 2021-01-25 | Paper |
Approximating text-to-pattern Hamming distances
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Linear-time algorithm for long LCF with k mismatches
(available as arXiv preprint) | 2020-12-16 | Paper |
Circular pattern matching with \(k\) mismatches
Journal of Computer and System Sciences | 2020-10-23 | Paper |
String Periods in the Order-Preserving Model
(available as arXiv preprint) | 2020-08-05 | Paper |
Universal reconstruction of a string
Theoretical Computer Science | 2020-02-20 | Paper |
Circular pattern matching with k mismatches
Fundamentals of Computation Theory | 2020-01-30 | Paper |
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Indexing weighted sequences: neat and efficient
Information and Computation | 2020-01-17 | Paper |
Indexing weighted sequences: neat and efficient
Information and Computation | 2020-01-17 | Paper |
String periods in the order-preserving model
Information and Computation | 2020-01-17 | Paper |
| Dynamic dictionary matching in the online model | 2020-01-16 | Paper |
Hardness of approximation for strip packing
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Hardness of approximation for strip packing
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Efficient representation and counting of antipower factors in words
Lecture Notes in Computer Science | 2019-12-04 | Paper |
The streaming \(k\)-mismatch problem
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Deleting vertices to graphs of bounded genus
Algorithmica | 2019-08-20 | Paper |
Pattern matching and consensus problems on weighted sequences and profiles
Theory of Computing Systems | 2019-06-27 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
Correction to: ``Longest common substring with approximately \(k\) mismatches''
Algorithmica | 2019-05-21 | Paper |
Longest common substring with approximately \(k\) mismatches
Algorithmica | 2019-05-17 | Paper |
| A linear time algorithm for seeds computation | 2019-05-10 | Paper |
On Abelian Longest Common Factor with and without RLE
Fundamenta Informaticae | 2019-01-17 | Paper |
Linear search by a pair of distinct-speed robots
Algorithmica | 2019-01-11 | Paper |
Near-optimal computation of runs over general alphabet via non-crossing LCE queries
(available as arXiv preprint) | 2018-10-17 | Paper |
Sparse suffix tree construction in optimal time and space
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On periodicity lemma for partial words
(available as arXiv preprint) | 2018-06-26 | Paper |
Pattern matching and consensus problems on weighted sequences and profiles
(available as arXiv preprint) | 2018-04-19 | Paper |
| scientific article; zbMATH DE number 6850408 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850408 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
Efficient algorithms for shortest partial seeds in words
Theoretical Computer Science | 2018-02-16 | Paper |
On the string consensus problem and the Manhattan sequence consensus problem
Theoretical Computer Science | 2018-02-16 | Paper |
String powers in trees
Algorithmica | 2017-11-09 | Paper |
Covering problems for partial words and for indeterminate strings
Theoretical Computer Science | 2017-11-06 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Faster longest common extension queries in strings over general alphabets
(available as arXiv preprint) | 2017-10-17 | Paper |
scientific article; zbMATH DE number 6792413 (Why is no real title available?)
(available as arXiv preprint) | 2017-10-17 | Paper |
Minimal suffix and rotation of a substring in optimal time
(available as arXiv preprint) | 2017-10-17 | Paper |
Internal pattern matching queries in a text and applications
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Wavelet trees meet suffix trees
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Approximating upper degree-constrained partial orientations
(available as arXiv preprint) | 2017-08-31 | Paper |
Efficient indexes for jumbled pattern matching with constant-sized alphabet
Algorithmica | 2017-05-02 | Paper |
Constant Factor Approximation for Capacitated k-Center with Outliers
(available as arXiv preprint) | 2017-03-03 | Paper |
Fast computation of abelian runs
Theoretical Computer Science | 2017-02-06 | Paper |
| Fast algorithms for abelian periods in words and greatest common divisor queries | 2017-01-30 | Paper |
Linear search by a pair of distinct-speed robots
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Fast algorithms for abelian periods in words and greatest common divisor queries
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
SIAM Journal on Discrete Mathematics | 2016-10-28 | Paper |
Maximum number of distinct and nonequivalent nonstandard squares in a word
Theoretical Computer Science | 2016-09-12 | Paper |
Computing minimal and maximal suffixes of a substring
Theoretical Computer Science | 2016-06-16 | Paper |
Order-preserving indexing
Theoretical Computer Science | 2016-06-16 | Paper |
Subquadratic-time algorithms for abelian stringology problems
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
A fast branching algorithm for cluster vertex deletion
Theory of Computing Systems | 2016-03-09 | Paper |
On the greedy algorithm for the shortest common superstring problem with reversals
Information Processing Letters | 2016-01-05 | Paper |
Approximating LZ77 via Small-Space Multiple-Pattern Matching
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Universal reconstruction of a string
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Linear-time version of Holub's algorithm for morphic imprimitivity testing
Theoretical Computer Science | 2015-09-25 | Paper |
Covering problems for partial words and for indeterminate strings
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Fast algorithm for partial covers in words
Algorithmica | 2015-09-03 | Paper |
A note on the longest common compatible prefix problem for partial words
Journal of Discrete Algorithms | 2015-08-24 | Paper |
String Powers in Trees
Combinatorial Pattern Matching | 2015-08-20 | Paper |
On the string consensus problem and the Manhattan sequence consensus problem
String Processing and Information Retrieval | 2015-02-10 | Paper |
An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph
Information Processing Letters | 2014-12-09 | Paper |
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
Developments in Language Theory | 2014-10-14 | Paper |
Sublinear space algorithms for the longest common substring problem
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Efficient counting of square substrings in a tree
Theoretical Computer Science | 2014-07-07 | Paper |
Computing k-th Lyndon word and decoding lexicographically minimal de Bruijn sequence
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Efficient Algorithms for Shortest Partial Seeds in Words
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Computing minimal and maximal suffixes of a substring revisited
Combinatorial Pattern Matching | 2014-06-30 | Paper |
A fast branching algorithm for cluster vertex deletion
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Faster deterministic \textsc{Feedback Vertex Set}
Information Processing Letters | 2014-06-23 | Paper |
Enhanced string covering
Theoretical Computer Science | 2014-01-16 | Paper |
Efficient indexes for jumbled pattern matching with constant-sized alphabet
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Fast Algorithm for Partial Covers in Words
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Efficient counting of square substrings in a tree
Algorithms and Computation | 2013-03-21 | Paper |
A note on efficient computation of all abelian periods in a string
Information Processing Letters | 2013-03-20 | Paper |
Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing
Language and Automata Theory and Applications | 2013-03-18 | Paper |
The maximum number of squares in a tree
Combinatorial Pattern Matching | 2012-08-14 | Paper |
