Tomasz Kociumaka
University of California, Berkeley
H-index: 27
North America-United States
Top articles of Tomasz Kociumaka
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Dynamic Dynamic Time Warping | Karl Bringmann Nick Fischer Ivor van der Hoog Evangelos Kipouridis Tomasz Kociumaka | 2024 | |
Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights | arXiv preprint arXiv:2404.06401 | Egor Gorbachev Tomasz Kociumaka | 2024/4/9 |
On the Communication Complexity of Approximate Pattern Matching | arXiv preprint arXiv:2403.18812 | Tomasz Kociumaka Jakob Nogler Philip Wellnitz | 2024/3/27 |
Faster Sublinear-Time Edit Distance | Karl Bringmann Alejandro Cassis Nick Fischer Tomasz Kociumaka | 2024 | |
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization | Daniel Gibney Ce Jin Tomasz Kociumaka Sharma V Thankachan | 2024 | |
Weighted edit distance computation: Strings, trees, and Dyck | Debarati Das Jacob Gilbert MohammadTaghi Hajiaghayi Tomasz Kociumaka Barna Saha | 2023/6/2 | |
Leibniz International Proceedings in Informatics (LIPIcs): 14th Innovations in Theoretical Computer Science Conference (ITCS 2023) | European Conference on Object-Oriented Programming | Feiyang Jin Lechen Yu Tiago Cogumbreiro Jun Shirako Vivek Sarkar | 2023/1 |
Collapsing the hierarchy of compressed data structures: Suffix arrays in optimal compressed space | Dominik Kempa Tomasz Kociumaka | 2023/11/6 | |
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String | Costas S Iliopoulos Tomasz Kociumaka Jakub Radoszewski Wojciech Rytter Tomasz Waleń | 2023 | |
Approximating edit distance in the fully dynamic model | Tomasz Kociumaka Anish Mukherjee Barna Saha | 2023/11/6 | |
Breaking the ????(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees | Dominik Kempa Tomasz Kociumaka | 2023 | |
Optimal algorithms for bounded weighted edit distance | Alejandro Cassis Tomasz Kociumaka Philip Wellnitz | 2023/11/6 | |
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares | arXiv preprint arXiv:2309.14788 | Gabriel Bathie Tomasz Kociumaka Tatiana Starikovskaya | 2023/9/26 |
Computing longest (common) Lyndon subsequences | Hideo Bannai Tomohiro I Tomasz Kociumaka Dominik Köppl Simon J Puglisi | 2022/5/29 | |
Near-Optimal Search Time in -Optimal Space | Tomasz Kociumaka Gonzalo Navarro Francisco Olivares | 2022/10/29 | |
An algorithmic bridge between Hamming and Levenshtein distances | arXiv preprint arXiv:2211.12496 | Elazar Goldenberg Tomasz Kociumaka Robert Krauthgamer Barna Saha | 2022/11/22 |
Small-space and streaming pattern matching with edits | Tomasz Kociumaka Ely Porat Tatiana Starikovskaya | 2022/2/7 | |
Approximate circular pattern matching | arXiv preprint arXiv:2208.08915 | Panagiotis Charalampopoulos Tomasz Kociumaka Jakub Radoszewski Solon P Pissis Wojciech Rytter | 2022/8/18 |
Bellman-Ford is optimal for shortest hop-bounded paths | arXiv preprint arXiv:2211.07325 | Tomasz Kociumaka Adam Polak | 2022/11/14 |
A periodicity lemma for partial words | Information and Computation | Tomasz Kociumaka Jakub Radoszewski Wojciech Rytter Tomasz Waleń | 2022/2/1 |
Co-Authors
