The Maximum Number of Squares in a Tree. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Wojciech Tyczynski; Tomasz Walen (CPM, 2012)

Efficient Data Structures for the Factor Periodicity Problem. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2012)

New and Efficient Approaches to the Quasiperiodic Characterisation of a String. - Tomás Flouri; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Simon J. Puglisi; William F. Smyth; Wojciech Tyczynski (Stringology, 2012)

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2013)

Substring Suffix Selection. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (CoRR, 2013)

Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CoRR, 2013)

Order-Preserving Suffix Trees and Their Algorithmic Applications - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CoRR, 2013)

A note on efficient computation of all Abelian periods in a string. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Jakub Pachocki; Jakub Radoszewski; Wojciech Rytter; Wojciech Tyczynski; Tomasz Walen (Inf. Process. Lett., 2013)

Enhanced string covering. - Tomás Flouri; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Simon J. Puglisi; W. F. Smyth; Wojciech Tyczynski (Theor. Comput. Sci., 2013)

Computing Minimal and Maximal Suffixes of a Substring Revisited. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (CPM, 2014)

Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter (CPM, 2014)

Sublinear Space Algorithms for the Longest Common Substring Problem. - Tomasz Kociumaka; Tatiana Starikovskaya; Hjalte Wedel Vildhøj (ESA, 2014)

Constant Factor Approximation for Capacitated k-Center with Outliers. - Marek Cygan; Tomasz Kociumaka (STACS, 2014)

An LP-Rounding $2 sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph. - Fabrizio Grandoni 001; Tomasz Kociumaka; Michal Wlodarczyk 001 (CoRR, 2014)

Faster deterministic Feedback Vertex Set. - Tomasz Kociumaka; Marcin Pilipczuk (Inf. Process. Lett., 2014)

Efficient counting of square substrings in a tree. - Tomasz Kociumaka; Jakub Pachocki; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2014)

Approximating Upper Degree-Constrained Partial Orientations. - Marek Cygan; Tomasz Kociumaka (APPROX-RANDOM, 2015)

Approximating LZ77 via Small-Space Multiple-Pattern Matching. - Johannes Fischer 001; Travis Gagie; Pawel Gawrychowski; Tomasz Kociumaka (ESA, 2015)

Subquadratic-Time Algorithms for Abelian Stringology Problems. - Tomasz Kociumaka; Jakub Radoszewski; Bartlomiej Wisniewski (MACIS, 2015)

Wavelet Trees Meet Suffix Trees. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Tatiana Starikovskaya (SODA, 2015)

Efficient Algorithms for Longest Closed Factor Array. - Hideo Bannai; Shunsuke Inenaga; Tomasz Kociumaka; Arnaud Lefebvre; Jakub Radoszewski; Wojciech Rytter; Shiho Sugimoto; Tomasz Walen (SPIRE, 2015)

Fast Algorithm for Partial Covers in Words. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Algorithmica, 2015)

An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. - Fabrizio Grandoni 001; Tomasz Kociumaka; Michal Wlodarczyk 001 (Inf. Process. Lett., 2015)

A note on the longest common compatible prefix problem for partial words. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (J. Discrete Algorithms, 2015)

Linear-time version of Holub's algorithm for morphic imprimitivity testing. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2015)

Efficient Index for Weighted Sequences. - Carl Barton; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (CPM, 2016)

Faster Longest Common Extension Queries in Strings over General Alphabets. - Pawel Gawrychowski; Tomasz Kociumaka; Wojciech Rytter; Tomasz Walen (CPM, 2016)

Minimal Suffix and Rotation of a Substring in Optimal Time. - Tomasz Kociumaka (CPM, 2016)

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Ritu Kundu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2016)

Parameterizing PWM- and Profile-Matching and Knapsack by the feasible-weight solutions count. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (CoRR, 2016)

On the greedy algorithm for the Shortest Common Superstring problem with reversals. - Gabriele Fici; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Inf. Process. Lett., 2016)

A Fast Branching Algorithm for Cluster Vertex Deletion. - Anudhyan Boral; Marek Cygan; Tomasz Kociumaka; Marcin Pilipczuk (Theory Comput. Syst., 2016)

Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter (SIAM J. Discret. Math., 2016)

Computing minimal and maximal suffixes of a substring. - Maxim A. Babenko; Pawel Gawrychowski; Tomasz Kociumaka; Ignat I. Kolesnichenko; Tatiana Starikovskaya (Theor. Comput. Sci., 2016)

Order-preserving indexing. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2016)

Fast computation of abelian runs. - Gabriele Fici; Tomasz Kociumaka; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston (Theor. Comput. Sci., 2016)

Maximum number of distinct and nonequivalent nonstandard squares in a word. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2016)

Sparse Suffix Tree Construction in Optimal Time and Space. - Pawel Gawrychowski; Tomasz Kociumaka (SODA, 2017)

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. - Golnaz Badkobeh; Travis Gagie; Shunsuke Inenaga; Tomasz Kociumaka; Dmitry Kosolobov; Simon J. Puglisi (SPIRE, 2017)

Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter (Algorithmica, 2017)

String Powers in Trees. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Algorithmica, 2017)

Fast algorithms for Abelian periods in words and greatest common divisor queries. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter (J. Comput. Syst. Sci., 2017)

Covering problems for partial words and for indeterminate strings. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2017)

Hardness of Approximation for Strip Packing. - Anna Adamaszek; Tomasz Kociumaka; Marcin Pilipczuk; Michal Pilipczuk (ACM Trans. Comput. Theory, 2017)

Linear-Time Algorithm for Long LCF with k Mismatches. - Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CPM, 2018)

Edit Distance with Block Operations. - Michal Ganczorz; Pawel Gawrychowski; Artur Jez; Tomasz Kociumaka (ESA, 2018)

How Much Different Are Two Words with Different Shortest Periods. - Mai Alzamel; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Ritu Kundu; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (AIAI (Workshops), 2018)

Longest Unbordered Factor in Quasilinear Time. - Tomasz Kociumaka; Ritu Kundu; Manal Mohamed 001; Solon P. Pissis (ISAAC, 2018)

Optimal Dynamic Strings. - Pawel Gawrychowski; Adam Karczmarz; Tomasz Kociumaka; Jakub Lacki; Piotr Sankowski (SODA, 2018)

Efficient Computation of Sequence Mappability. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Juliusz Straszynski (SPIRE, 2018)

Faster Recovery of Approximate Periods over Edit Distance. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 2018)

On Abelian Longest Common Factor with and without RLE. - Szymon Grabowski; Tomasz Kociumaka; Jakub Radoszewski (Fundam. Informaticae, 2018)

On the string consensus problem and the Manhattan sequence consensus problem. - Tomasz Kociumaka; Jakub Pachocki; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2018)

Efficient algorithms for shortest partial seeds in words. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2018)

Quasi-Linear-Time Algorithm for Longest Common Circular Factor. - Mai Alzamel; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2019)

Circular Pattern Matching with k Mismatches. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (FCT, 2019)

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. - Katrin Casel; Joel D. Day; Pamela Fleischmann; Tomasz Kociumaka; Florin Manea; Markus L. Schmid (ICALP, 2019)

RLE Edit Distance in Near Optimal Time. - Raphaël Clifford; Pawel Gawrychowski; Tomasz Kociumaka; Daniel P. Martin 001; Przemyslaw Uznanski (MFCS, 2019)

The streaming k-mismatch problem. - Raphaël Clifford; Tomasz Kociumaka; Ely Porat (SODA, 2019)

Weighted Shortest Common Supersequence Problem Revisited. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 2019)

On Longest Common Property Preserved Substring Queries. - Kazuki Kai; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Tomasz Kociumaka (SPIRE, 2019)

String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. - Dominik Kempa; Tomasz Kociumaka (STOC, 2019)

Dynamic Dictionary Matching in the Online Model. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (WADS, 2019)

Linear Search by a Pair of Distinct-Speed Robots. - Evangelos Bampas; Jurek Czyzowicz; Leszek Gasieniec; David Ilcinkas; Ralf Klasing; Tomasz Kociumaka; Dominik Pajak (Algorithmica, 2019)

Deleting Vertices to Graphs of Bounded Genus. - Tomasz Kociumaka; Marcin Pilipczuk (Algorithmica, 2019)

Longest Common Substring with Approximately k Mismatches. - Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (Algorithmica, 2019)

Correction to: Longest Common Substring with Approximately k Mismatches. - Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (Algorithmica, 2019)

Efficient enumeration of non-equivalent squares in partial words with few holes. - Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (J. Comb. Optim., 2019)

Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. - Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (Theory Comput. Syst., 2019)

Improved Circular k-Mismatch Sketches. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Przemyslaw Uznanski (APPROX-RANDOM, 2020)

Counting Distinct Patterns in Internal Dictionary Matching. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Manal Mohamed 001; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2020)

Dynamic String Alignment. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Shay Mozes (CPM, 2020)

The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (CPM, 2020)

Approximating Longest Common Substring with k mismatches: Theory and Practice. - Garance Gourdel; Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (CPM, 2020)

Time-Space Tradeoffs for Finding a Long Common Substring. - Stav Ben-Nun; Shay Golan 001; Tomasz Kociumaka; Matan Kraus (CPM, 2020)

Practical Performance of Space Efficient Data Structures for Longest Common Extensions. - Patrick Dinklage; Johannes Fischer 001; Alexander Herlez; Tomasz Kociumaka; Florian Kurpicz (ESA, 2020)

Faster Approximate Pattern Matching: A Unified Approach. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Philip Wellnitz (FOCS, 2020)

Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance. - Tomasz Kociumaka; Barna Saha (FOCS, 2020)

Towards a Definitive Measure of Repetitiveness. - Tomasz Kociumaka; Gonzalo Navarro 001; Nicola Prezza (LATIN, 2020)

Efficient Enumeration of Distinct Factors Using Package Representations. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (SPIRE, 2020)

Approximating text-to-pattern Hamming distances. - Timothy M. Chan; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (STOC, 2020)

Indexing weighted sequences: Neat and efficient. - Carl Barton; Tomasz Kociumaka; Chang Liu 035; Solon P. Pissis; Jakub Radoszewski (Inf. Comput., 2020)

String periods in the order-preserving model. - Garance Gourdel; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Arseny M. Shur; Tomasz Walen (Inf. Comput., 2020)

A Linear-Time Algorithm for Seeds Computation. - Tomasz Kociumaka; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (ACM Trans. Algorithms, 2020)

Universal reconstruction of a string. - Pawel Gawrychowski; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2020)

Faster Algorithms for Longest Common Substring. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski (ESA, 2021)

Small-space and streaming pattern matching with $k$ edits. - Tomasz Kociumaka; Ely Porat; Tatiana Starikovskaya (FOCS, 2021)

Improved dynamic algorithms for longest increasing subsequence. - Tomasz Kociumaka; Saeed Seddighin (STOC, 2021)

Internal Dictionary Matching. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Manal Mohamed 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Algorithmica, 2021)

Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays. - Dominik Kempa; Tomasz Kociumaka (CoRR, 2021)

Circular pattern matching with k mismatches. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (J. Comput. Syst. Sci., 2021)

Optimal-Time Dictionary-Compressed Indexes. - Anders Roy Christiansen; Mikko Berggren Ettienne; Tomasz Kociumaka; Gonzalo Navarro 001; Nicola Prezza (ACM Trans. Algorithms, 2021)

Maximal unbordered factors of random strings. - Patrick Hagge Cording; Travis Gagie; Mathias Bæk Tejs Knudsen; Tomasz Kociumaka (Theor. Comput. Sci., 2021)

The Dynamic k-Mismatch Problem. - Raphaël Clifford; Pawel Gawrychowski; Tomasz Kociumaka; Daniel P. Martin 001; Przemyslaw Uznanski (CPM, 2022)

Approximate Circular Pattern Matching. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Jakub Radoszewski; Solon P. Pissis; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (ESA, 2022)

Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. - Debarati Das 001; Jacob Gilbert; MohammadTaghi Hajiaghayi; Tomasz Kociumaka; Barna Saha; Hamed Saleh (FOCS, 2022)

Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Philip Wellnitz (FOCS, 2022)

Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. - Elazar Goldenberg; Tomasz Kociumaka; Robert Krauthgamer; Barna Saha (FOCS, 2022)

Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. - Debarati Das 001; Tomasz Kociumaka; Barna Saha (ICALP, 2022)

Computing Longest (Common) Lyndon Subsequences. - Hideo Bannai; Tomohiro I; Tomasz Kociumaka; Dominik Köppl; Simon J. Puglisi (IWOCA, 2022)

Near-Optimal Search Time in δ-Optimal Space. - Tomasz Kociumaka; Gonzalo Navarro 001; Francisco Olivares (LATIN, 2022)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (SODA, 2022)

How Compression and Approximation Affect Efficiency in String Distance Measures. - Arun Ganesh; Tomasz Kociumaka; Andrea Lincoln; Barna Saha (SODA, 2022)

Dynamic suffix array with polylogarithmic queries and updates. - Dominik Kempa; Tomasz Kociumaka (STOC, 2022)

Efficient Computation of Sequence Mappability. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Juliusz Straszynski (Algorithmica, 2022)

Resolution of the burrows-wheeler transform conjecture. - Dominik Kempa; Tomasz Kociumaka (Commun. ACM, 2022)

Faster Pattern Matching under Edit Distance. - Panagiotis Charalampopoulos; Tomasz Kociumaka; Philip Wellnitz (CoRR, 2022)

Efficient representation and counting of antipower factors in words. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (Inf. Comput., 2022)

A periodicity lemma for partial words. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Inf. Comput., 2022)

Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. - Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (CPM, 2023)

Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. - Tomasz Kociumaka; Adam Polak 001 (ESA, 2023)

Optimal Algorithms for Bounded Weighted Edit Distance. - Alejandro Cassis; Tomasz Kociumaka; Philip Wellnitz (FOCS, 2023)

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. - Dominik Kempa; Tomasz Kociumaka (FOCS, 2023)

Approximating Edit Distance in the Fully Dynamic Model. - Tomasz Kociumaka; Anish Mukherjee 001; Barna Saha (FOCS, 2023)

An Algorithmic Bridge Between Hamming and Levenshtein Distances. - Elazar Goldenberg; Tomasz Kociumaka; Robert Krauthgamer; Barna Saha (ITCS, 2023)

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. - Gabriel Bathie; Tomasz Kociumaka; Tatiana Starikovskaya (ISAAC, 2023)

Breaking the 𝒪(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. - Dominik Kempa; Tomasz Kociumaka (SODA, 2023)

Weighted Edit Distance Computation: Strings, Trees, and Dyck. - Debarati Das 001; Jacob Gilbert; MohammadTaghi Hajiaghayi; Tomasz Kociumaka; Barna Saha (STOC, 2023)

Tight Bound for the Number of Distinct Palindromes in a Tree. - Pawel Gawrychowski; Tomasz Kociumaka; Wojciech Rytter; Tomasz Walen (Electron. J. Comb., 2023)

Toward a Definitive Compressibility Measure for Repetitive Sequences. - Tomasz Kociumaka; Gonzalo Navarro 001; Nicola Prezza (IEEE Trans. Inf. Theory, 2023)

Publisher Correction: Longest Common Substring with Approximately k Mismatches. - Tomasz Kociumaka; Jakub Radoszewski; Tatiana Starikovskaya (Algorithmica, 2023)

Lempel-Ziv (LZ77) Factorization in Sublinear Time. - Dominik Kempa; Tomasz Kociumaka (FOCS, 2024)

Faster Sublinear-Time Edit Distance. - Karl Bringmann; Alejandro Cassis; Nick Fischer; Tomasz Kociumaka (SODA, 2024)

Dynamic Dynamic Time Warping. - Karl Bringmann; Nick Fischer; Ivor van der Hoog; Evangelos Kipouridis; Tomasz Kociumaka; Eva Rotenberg (SODA, 2024)

Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. - Daniel Gibney; Ce Jin 001; Tomasz Kociumaka; Sharma V. Thankachan (SODA, 2024)

Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. - Debarati Das 001; Jacob Gilbert; MohammadTaghi Hajiaghayi; Tomasz Kociumaka; Barna Saha (SPAA, 2024)

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. - Anouk Duyster; Tomasz Kociumaka (SPIRE, 2024)

On the Communication Complexity of Approximate Pattern Matching. - Tomasz Kociumaka; Jakob Nogler; Philip Wellnitz (STOC, 2024)

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications. - Pawel Gawrychowski; Egor Gorbachev; Tomasz Kociumaka (CoRR, 2024)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language. - Ruben Becker; Davide Cenzato; Sung-Hwan Kim; Tomasz Kociumaka; Bojana Kodric; Alberto Policriti; Nicola Prezza (CoRR, 2024)

Internal Pattern Matching Queries in a Text and Applications. - Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SIAM J. Comput., 2024)

Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. - Hideo Bannai; Tomohiro I; Tomasz Kociumaka; Dominik Köppl; Simon J. Puglisi (Algorithmica, 2024)

Near-Optimal Search Time in δ-Optimal Space, and Vice Versa. - Tomasz Kociumaka; Gonzalo Navarro 001; Francisco Olivares (Algorithmica, 2024)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (ACM Trans. Algorithms, 2024)

Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. - Tomasz Kociumaka; Jakob Nogler; Philip Wellnitz (SODA, 2025)

Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights. - Egor Gorbachev; Tomasz Kociumaka (STOC, 2025)

On the Hardness Hierarchy for the O(n√log n) Complexity in the Word RAM. - Dominik Kempa; Tomasz Kociumaka (STOC, 2025)

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds. - Itai Boneh; Egor Gorbachev; Tomasz Kociumaka (CoRR, 2025)

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime. - Tomasz Kociumaka; Ali Shahali (CoRR, 2025)