default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomasz Kociumaka
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation (former): University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c101]Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz:
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. SODA 2025: 517-534- 2024
- [j48]Hideo Bannai
, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica 86(3): 735-756 (2024) - [j47]Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares:
Near-Optimal Search Time in δ-Optimal Space, and Vice Versa. Algorithmica 86(4): 1031-1056 (2024) - [j46]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Pattern Matching Queries in a Text and Applications. SIAM J. Comput. 53(5): 1524-1577 (2024) - [j45]Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. ACM Trans. Algorithms 20(3): 26 (2024) - [c100]Dominik Kempa, Tomasz Kociumaka:
Lempel-Ziv (LZ77) Factorization in Sublinear Time. FOCS 2024: 2045-2055 - [c99]Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. SODA 2024: 208-242 - [c98]Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka:
Faster Sublinear-Time Edit Distance. SODA 2024: 3274-3301 - [c97]Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan:
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. SODA 2024: 3302-3332 - [c96]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. SPAA 2024: 293-295 - [c95]Anouk Duyster, Tomasz Kociumaka:
Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts. SPIRE 2024: 102-117 - [c94]Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz:
On the Communication Complexity of Approximate Pattern Matching. STOC 2024: 1758-1768 - [i90]Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz:
On the Communication Complexity of Approximate Pattern Matching. CoRR abs/2403.18812 (2024) - [i89]Egor Gorbachev, Tomasz Kociumaka:
Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights. CoRR abs/2404.06401 (2024) - [i88]Pawel Gawrychowski, Egor Gorbachev, Tomasz Kociumaka:
Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications. CoRR abs/2408.04613 (2024) - [i87]Dominik Kempa, Tomasz Kociumaka:
Lempel-Ziv (LZ77) Factorization in Sublinear Time. CoRR abs/2409.12146 (2024) - [i86]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Tomasz Kociumaka, Bojana Kodric, Alberto Policriti, Nicola Prezza:
On the Complexity of Computing the Co-lexicographic Width of a Regular Language. CoRR abs/2410.04771 (2024) - [i85]Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz:
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching. CoRR abs/2410.06808 (2024) - 2023
- [j44]Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Publisher Correction: Longest Common Substring with Approximately k Mismatches. Algorithmica 85(10): 3323 (2023) - [j43]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. Electron. J. Comb. 30(2) (2023) - [j42]Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Toward a Definitive Compressibility Measure for Repetitive Sequences. IEEE Trans. Inf. Theory 69(4): 2074-2092 (2023) - [c93]Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM 2023: 15:1-15:15 - [c92]Tomasz Kociumaka, Adam Polak:
Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. ESA 2023: 72:1-72:10 - [c91]Tomasz Kociumaka, Anish Mukherjee, Barna Saha:
Approximating Edit Distance in the Fully Dynamic Model. FOCS 2023: 1628-1638 - [c90]Dominik Kempa, Tomasz Kociumaka:
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. FOCS 2023: 1877-1886 - [c89]Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz:
Optimal Algorithms for Bounded Weighted Edit Distance. FOCS 2023: 2177-2187 - [c88]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
An Algorithmic Bridge Between Hamming and Levenshtein Distances. ITCS 2023: 58:1-58:23 - [c87]Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya:
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. ISAAC 2023: 10:1-10:17 - [c86]Dominik Kempa, Tomasz Kociumaka:
Breaking the 𝒪(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. SODA 2023: 5122-5202 - [c85]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees, and Dyck. STOC 2023: 377-390 - [i84]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees and Dyck. CoRR abs/2302.04229 (2023) - [i83]Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz:
Optimal Algorithms for Bounded Weighted Edit Distance. CoRR abs/2305.06659 (2023) - [i82]Tomasz Kociumaka, Anish Mukherjee, Barna Saha:
Approximating Edit Distance in the Fully Dynamic Model. CoRR abs/2307.07175 (2023) - [i81]Dominik Kempa, Tomasz Kociumaka:
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. CoRR abs/2308.03635 (2023) - [i80]Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya:
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. CoRR abs/2309.14788 (2023) - [i79]Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. CoRR abs/2310.18128 (2023) - [i78]Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan:
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. CoRR abs/2311.01793 (2023) - [i77]Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka:
Faster Sublinear-Time Edit Distance. CoRR abs/2312.01759 (2023) - 2022
- [j41]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. Algorithmica 84(5): 1418-1440 (2022) - [j40]Dominik Kempa, Tomasz Kociumaka:
Resolution of the burrows-wheeler transform conjecture. Commun. ACM 65(6): 91-98 (2022) - [j39]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A periodicity lemma for partial words. Inf. Comput. 283: 104677 (2022) - [j38]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Efficient representation and counting of antipower factors in words. Inf. Comput. 286: 104779 (2022) - [c84]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
The Dynamic k-Mismatch Problem. CPM 2022: 18:1-18:15 - [c83]Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching. ESA 2022: 35:1-35:19 - [c82]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. FOCS 2022: 674-685 - [c81]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh:
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. FOCS 2022: 686-697 - [c80]Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz:
Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. FOCS 2022: 698-707 - [c79]Debarati Das, Tomasz Kociumaka, Barna Saha:
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. ICALP 2022: 49:1-49:20 - [c78]Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest (Common) Lyndon Subsequences. IWOCA 2022: 128-142 - [c77]Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares:
Near-Optimal Search Time in δ-Optimal Space. LATIN 2022: 88-103 - [c76]Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha:
How Compression and Approximation Affect Efficiency in String Distance Measures. SODA 2022: 2867-2919 - [c75]Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. SODA 2022: 3650-3669 - [c74]Dominik Kempa, Tomasz Kociumaka:
Dynamic suffix array with polylogarithmic queries and updates. STOC 2022: 1657-1670 - [i76]Dominik Kempa, Tomasz Kociumaka:
Dynamic Suffix Array with Polylogarithmic Queries and Updates. CoRR abs/2201.01285 (2022) - [i75]Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest (Common) Lyndon Subsequences. CoRR abs/2201.06773 (2022) - [i74]Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz:
Faster Pattern Matching under Edit Distance. CoRR abs/2204.03087 (2022) - [i73]Tomasz Kociumaka, Gonzalo Navarro, Francisco Olivares:
Near-Optimal Search Time in δ-Optimal Space. CoRR abs/2206.00781 (2022) - [i72]Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching. CoRR abs/2208.08915 (2022) - [i71]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh:
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. CoRR abs/2209.07524 (2022) - [i70]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
An Algorithmic Bridge Between Hamming and Levenshtein Distances. CoRR abs/2211.12496 (2022) - 2021
- [j37]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Dictionary Matching. Algorithmica 83(7): 2142-2169 (2021) - [j36]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular pattern matching with k mismatches. J. Comput. Syst. Sci. 115: 73-85 (2021) - [j35]Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Optimal-Time Dictionary-Compressed Indexes. ACM Trans. Algorithms 17(1): 8:1-8:39 (2021) - [j34]Patrick Hagge Cording, Travis Gagie, Mathias Bæk Tejs Knudsen, Tomasz Kociumaka:
Maximal unbordered factors of random strings. Theor. Comput. Sci. 852: 78-83 (2021) - [c73]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Faster Algorithms for Longest Common Substring. ESA 2021: 30:1-30:17 - [c72]Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya:
Small-space and streaming pattern matching with $k$ edits. FOCS 2021: 885-896 - [c71]Tomasz Kociumaka, Saeed Seddighin:
Improved dynamic algorithms for longest increasing subsequence. STOC 2021: 640-653 - [i69]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Faster Algorithms for Longest Common Substring. CoRR abs/2105.03106 (2021) - [i68]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
The Dynamic k-Mismatch Problem. CoRR abs/2105.06166 (2021) - [i67]Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya:
Small space and streaming pattern matching with k edits. CoRR abs/2106.06037 (2021) - [i66]Dominik Kempa, Tomasz Kociumaka:
Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays. CoRR abs/2106.12725 (2021) - [i65]Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. CoRR abs/2111.02336 (2021) - [i64]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. CoRR abs/2111.12706 (2021) - [i63]Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha:
How Compression and Approximation Affect Efficiency in String Distance Measures. CoRR abs/2112.05836 (2021) - [i62]Debarati Das, Tomasz Kociumaka, Barna Saha:
Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding. CoRR abs/2112.05866 (2021) - 2020
- [j33]Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski:
Indexing weighted sequences: Neat and efficient. Inf. Comput. 270 (2020) - [j32]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String periods in the order-preserving model. Inf. Comput. 270 (2020) - [j31]Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A Linear-Time Algorithm for Seeds Computation. ACM Trans. Algorithms 16(2): 27:1-27:23 (2020) - [j30]Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Universal reconstruction of a string. Theor. Comput. Sci. 812: 174-186 (2020) - [c70]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski:
Improved Circular k-Mismatch Sketches. APPROX-RANDOM 2020: 46:1-46:24 - [c69]Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus:
Time-Space Tradeoffs for Finding a Long Common Substring. CPM 2020: 5:1-5:14 - [c68]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Counting Distinct Patterns in Internal Dictionary Matching. CPM 2020: 8:1-8:15 - [c67]Panagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes:
Dynamic String Alignment. CPM 2020: 9:1-9:13 - [c66]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. CPM 2020: 15:1-15:15 - [c65]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Approximating Longest Common Substring with k mismatches: Theory and Practice. CPM 2020: 16:1-16:15 - [c64]Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz:
Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ESA 2020: 39:1-39:20 - [c63]Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz:
Faster Approximate Pattern Matching: A Unified Approach. FOCS 2020: 978-989 - [c62]Dominik Kempa, Tomasz Kociumaka:
Resolution of the Burrows-Wheeler Transform Conjecture. FOCS 2020: 1002-1013 - [c61]Tomasz Kociumaka, Barna Saha:
Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance. FOCS 2020: 1168-1179 - [c60]Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Towards a Definitive Measure of Repetitiveness. LATIN 2020: 207-219 - [c59]Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE 2020: 247-261 - [c58]Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Approximating text-to-pattern Hamming distances. STOC 2020: 643-656 - [i61]Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Approximating Text-to-Pattern Hamming Distances. CoRR abs/2001.00211 (2020) - [i60]Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus:
Time-Space Tradeoffs for Finding a Long Common Substring. CoRR abs/2003.02016 (2020) - [i59]Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz:
Faster Approximate Pattern Matching: A Unified Approach. CoRR abs/2004.08350 (2020) - [i58]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time. CoRR abs/2004.12881 (2020) - [i57]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Approximating longest common substring with $k$ mismatches: Theory and practice. CoRR abs/2004.13389 (2020) - [i56]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Counting Distinct Patterns in Internal Dictionary Matching. CoRR abs/2005.05681 (2020) - [i55]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski:
Improved Circular k-Mismatch Sketches. CoRR abs/2006.13673 (2020) - [i54]Tomasz Kociumaka, Barna Saha:
Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance. CoRR abs/2007.12762 (2020) - [i53]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. CoRR abs/2008.13209 (2020) - [i52]Tomasz Kociumaka, Saeed Seddighin:
Improved Dynamic Algorithms for Longest Increasing Subsequence. CoRR abs/2011.10874 (2020)
2010 – 2019
- 2019
- [j29]Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak:
Linear Search by a Pair of Distinct-Speed Robots. Algorithmica 81(1): 317-342 (2019) - [j28]Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Longest Common Substring with Approximately k Mismatches. Algorithmica 81(6): 2633-2652 (2019) - [j27]Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Correction to: Longest Common Substring with Approximately k Mismatches. Algorithmica 81(7): 3074 (2019) - [j26]Tomasz Kociumaka, Marcin Pilipczuk:
Deleting Vertices to Graphs of Bounded Genus. Algorithmica 81(9): 3655-3691 (2019) - [j25]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. 37(2): 501-522 (2019) - [j24]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. Theory Comput. Syst. 63(3): 506-542 (2019) - [c57]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM 2019: 25:1-25:14 - [c56]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular Pattern Matching with k Mismatches. FCT 2019: 213-228 - [c55]Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid:
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. ICALP 2019: 109:1-109:16 - [c54]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Dictionary Matching. ISAAC 2019: 22:1-22:17 - [c53]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Efficient Representation and Counting of Antipower Factors in Words. LATA 2019: 421-433 - [c52]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
RLE Edit Distance in Near Optimal Time. MFCS 2019: 66:1-66:13 - [c51]Raphaël Clifford, Tomasz Kociumaka, Ely Porat:
The streaming k-mismatch problem. SODA 2019: 1106-1125 - [c50]Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka:
On Longest Common Property Preserved Substring Queries. SPIRE 2019: 162-174 - [c49]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Weighted Shortest Common Supersequence Problem Revisited. SPIRE 2019: 221-238 - [c48]Dominik Kempa, Tomasz Kociumaka:
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. STOC 2019: 756-767 - [c47]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Dynamic Dictionary Matching in the Online Model. WADS 2019: 409-422 - [i51]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR abs/1901.11305 (2019) - [i50]Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid:
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. CoRR abs/1902.10983 (2019) - [i49]Dominik Kempa, Tomasz Kociumaka:
String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure. CoRR abs/1904.04228 (2019) - [i48]Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin, Przemyslaw Uznanski:
RLE edit distance in near optimal time. CoRR abs/1905.01254 (2019) - [i47]Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka:
On Longest Common Property Preserved Substring Queries. CoRR abs/1906.05486 (2019) - [i46]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular Pattern Matching with k Mismatches. CoRR abs/1907.01815 (2019) - [i45]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Weighted Shortest Common Supersequence Problem Revisited. CoRR abs/1909.11433 (2019) - [i44]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Dictionary Matching. CoRR abs/1909.11577 (2019) - [i43]Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Towards a Definitive Measure of Repetitiveness. CoRR abs/1910.02151 (2019) - [i42]Dominik Kempa, Tomasz Kociumaka:
Resolution of the Burrows-Wheeler Transform Conjecture. CoRR abs/1910.10631 (2019) - 2018
- [j23]Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski:
On Abelian Longest Common Factor with and without RLE. Fundam. Informaticae 163(3): 225-244 (2018) - [j22]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the string consensus problem and the Manhattan sequence consensus problem. Theor. Comput. Sci. 710: 126-138 (2018) - [j21]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient algorithms for shortest partial seeds in words. Theor. Comput. Sci. 710: 139-147 (2018) - [c46]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CPM 2018: 23:1-23:16 - [c45]Michal Ganczorz, Pawel Gawrychowski, Artur Jez, Tomasz Kociumaka:
Edit Distance with Block Operations. ESA 2018: 33:1-33:14 - [c44]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) 2018: 168-178 - [c43]Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis:
Longest Unbordered Factor in Quasilinear Time. ISAAC 2018: 70:1-70:13 - [c42]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On Periodicity Lemma for Partial Words. LATA 2018: 232-244 - [c41]Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski:
Optimal Dynamic Strings. SODA 2018: 1509-1528 - [c40]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. SPIRE 2018: 12-26 - [c39]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Faster Recovery of Approximate Periods over Edit Distance. SPIRE 2018: 233-240 - [c38]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String Periods in the Order-Preserving Model. STACS 2018: 38:1-38:16 - [i41]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On Periodicity Lemma for Partial Words. CoRR abs/1801.01096 (2018) - [i40]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String Periods in the Order-Preserving Model. CoRR abs/1801.01404 (2018) - [i39]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CoRR abs/1802.06369 (2018) - [i38]Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski:
On Abelian Longest Common Factor with and without RLE. CoRR abs/1804.06809 (2018) - [i37]Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis:
Longest Unbordered Factor in Quasilinear Time. CoRR abs/1805.09924 (2018) - [i36]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Faster Recovery of Approximate Periods over Edit Distance. CoRR abs/1807.10483 (2018) - [i35]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. CoRR abs/1807.11702 (2018) - [i34]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Efficient Representation and Counting of Antipower Factors in Words. CoRR abs/1812.08101 (2018) - 2017
- [j20]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. Algorithmica 77(4): 1194-1215 (2017) - [j19]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
String Powers in Trees. Algorithmica 79(3): 814-834 (2017) - [j18]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Fast algorithms for Abelian periods in words and greatest common divisor queries. J. Comput. Syst. Sci. 84: 205-218 (2017) - [j17]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. 698: 25-39 (2017) - [j16]Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk:
Hardness of Approximation for Strip Packing. ACM Trans. Comput. Theory 9(3): 14:1-14:7 (2017) - [c37]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON 2017: 99-111 - [c36]Pawel Gawrychowski, Tomasz Kociumaka:
Sparse Suffix Tree Construction in Optimal Time and Space. SODA 2017: 425-439 - [c35]Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi:
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. SPIRE 2017: 51-67 - [i33]Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski:
Indexing Weighted Sequences: Neat and Efficient. CoRR abs/1704.07625 (2017) - [i32]Tomasz Kociumaka, Marcin Pilipczuk:
Deleting vertices to graphs of bounded genus. CoRR abs/1706.04065 (2017) - [i31]Raphaël Clifford, Tomasz Kociumaka, Ely Porat:
The streaming k-mismatch problem. CoRR abs/1708.05223 (2017) - [i30]Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya:
Longest common substring with approximately k mismatches. CoRR abs/1712.08573 (2017) - 2016
- [j15]Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the greedy algorithm for the Shortest Common Superstring problem with reversals. Inf. Process. Lett. 116(3): 245-251 (2016) - [j14]Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk:
A Fast Branching Algorithm for Cluster Vertex Deletion. Theory Comput. Syst. 58(2): 357-376 (2016) - [j13]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. SIAM J. Discret. Math. 30(4): 2027-2046 (2016) - [j12]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Ignat I. Kolesnichenko, Tatiana Starikovskaya:
Computing minimal and maximal suffixes of a substring. Theor. Comput. Sci. 638: 112-121 (2016) - [j11]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-preserving indexing. Theor. Comput. Sci. 638: 122-135 (2016) - [j10]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum number of distinct and nonequivalent nonstandard squares in a word. Theor. Comput. Sci. 648: 84-95 (2016) - [j9]Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Fast computation of abelian runs. Theor. Comput. Sci. 656: 256-264 (2016) - [c34]Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Efficient Index for Weighted Sequences. CPM 2016: 4:1-4:13 - [c33]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. CPM 2016: 5:1-5:13 - [c32]Tomasz Kociumaka:
Minimal Suffix and Rotation of a Substring in Optimal Time. CPM 2016: 28:1-28:12 - [c31]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. ISAAC 2016: 46:1-46:12 - [c30]Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak:
Linear Search by a Pair of Distinct-Speed Robots. SIROCCO 2016: 195-211 - [c29]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE 2016: 22-34 - [i29]Tomasz Kociumaka:
Minimal Suffix and Rotation of a Substring in Optimal Time. CoRR abs/1601.08051 (2016) - [i28]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. CoRR abs/1602.00447 (2016) - [i27]Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Efficient Index for Weighted Sequences. CoRR abs/1602.01116 (2016) - [i26]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. CoRR abs/1604.02238 (2016) - [i25]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Parameterizing PWM- and Profile-Matching and Knapsack by the feasible-weight solutions count. CoRR abs/1604.07581 (2016) - [i24]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR abs/1606.08275 (2016) - [i23]Pawel Gawrychowski, Tomasz Kociumaka:
Sparse Suffix Tree Construction in Optimal Time and Space. CoRR abs/1608.00865 (2016) - [i22]Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk:
Hardness of approximation for strip packing. CoRR abs/1610.07766 (2016) - 2015
- [j8]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. Algorithmica 73(1): 217-233 (2015) - [j7]Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk:
An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. Inf. Process. Lett. 115(2): 182-185 (2015) - [j6]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34: 49-53 (2015) - [j5]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theor. Comput. Sci. 602: 7-21 (2015) - [c28]Marek Cygan, Tomasz Kociumaka:
Approximating Upper Degree-Constrained Partial Orientations. APPROX-RANDOM 2015: 212-224 - [c27]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
String Powers in Trees. CPM 2015: 284-294 - [c26]Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka:
Approximating LZ77 via Small-Space Multiple-Pattern Matching. ESA 2015: 533-544 - [c25]Tomasz Kociumaka, Jakub Radoszewski, Bartlomiej Wisniewski:
Subquadratic-Time Algorithms for Abelian Stringology Problems. MACIS 2015: 320-334 - [c24]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Pattern Matching Queries in a Text and Applications. SODA 2015: 532-551 - [c23]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Wavelet Trees Meet Suffix Trees. SODA 2015: 572-591 - [c22]Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen:
Efficient Algorithms for Longest Closed Factor Array. SPIRE 2015: 95-102 - [c21]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE 2015: 270-276 - [c20]Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Universal Reconstruction of a String. WADS 2015: 386-397 - [i21]Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka:
Approximating LZ77 via Small-Space Multiple-Pattern Matching. CoRR abs/1504.06647 (2015) - [i20]Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Fast Computation of Abelian Runs. CoRR abs/1506.08518 (2015) - [i19]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. CoRR abs/1510.02637 (2015) - [i18]Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski:
Optimal Dynamic Strings. CoRR abs/1511.02612 (2015) - [i17]Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals. CoRR abs/1511.08431 (2015) - 2014
- [j4]Tomasz Kociumaka, Marcin Pilipczuk:
Faster deterministic Feedback Vertex Set. Inf. Process. Lett. 114(10): 556-560 (2014) - [j3]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient counting of square substrings in a tree. Theor. Comput. Sci. 544: 60-73 (2014) - [c19]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Computing Minimal and Maximal Suffixes of a Substring Revisited. CPM 2014: 30-39 - [c18]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Algorithms for Shortest Partial Seeds in Words. CPM 2014: 192-201 - [c17]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. CPM 2014: 202-211 - [c16]Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk:
A Fast Branching Algorithm for Cluster Vertex Deletion. CSR 2014: 111-124 - [c15]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Developments in Language Theory 2014: 215-226 - [c14]Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Sublinear Space Algorithms for the Longest Common Substring Problem. ESA 2014: 605-617 - [c13]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. ISAAC 2014: 220-232 - [c12]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE 2014: 244-255 - [c11]Marek Cygan, Tomasz Kociumaka:
Constant Factor Approximation for Capacitated k-Center with Outliers. STACS 2014: 251-262 - [i16]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Solon P. Pissis, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. CoRR abs/1401.0163 (2014) - [i15]Tomasz Kociumaka, Marek Cygan:
Constant Factor Approximation for Capacitated k-Center with Outliers. CoRR abs/1401.2874 (2014) - [i14]Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk:
An LP-Rounding $2\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph. CoRR abs/1405.0456 (2014) - [i13]Tomasz Kociumaka, Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Sublinear Space Algorithms for the Longest Common Substring Problem. CoRR abs/1407.0522 (2014) - [i12]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. CoRR abs/1407.6144 (2014) - [i11]Marek Cygan, Tomasz Kociumaka:
Approximating Upper Degree-Constrained Partial Orientations. CoRR abs/1408.6157 (2014) - [i10]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Wavelet Trees Meet Suffix Trees. CoRR abs/1408.6182 (2014) - [i9]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. CoRR abs/1412.3696 (2014) - 2013
- [j2]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113(3): 74-77 (2013) - [j1]Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski:
Enhanced string covering. Theor. Comput. Sci. 506: 102-114 (2013) - [c10]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. CPM 2013: 177-188 - [c9]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. ESA 2013: 625-636 - [c8]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. LATA 2013: 383-394 - [c7]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE 2013: 84-95 - [c6]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. STACS 2013: 245-256 - [i8]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Suffix Trees and Their Algorithmic Applications. CoRR abs/1303.6872 (2013) - [i7]Tomasz Kociumaka, Marcin Pilipczuk:
Faster deterministic Feedback Vertex Set. CoRR abs/1306.3566 (2013) - [i6]Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk:
Fast branching algorithm for Cluster Vertex Deletion. CoRR abs/1306.3877 (2013) - [i5]Maxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya:
Substring Suffix Selection. CoRR abs/1309.5618 (2013) - [i4]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. CoRR abs/1311.6235 (2013) - [i3]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR abs/1312.2381 (2013) - 2012
- [c5]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
The Maximum Number of Squares in a Tree. CPM 2012: 27-40 - [c4]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Counting of Square Substrings in a Tree. ISAAC 2012: 207-216 - [c3]Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A linear time algorithm for seeds computation. SODA 2012: 1095-1112 - [c2]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Data Structures for the Factor Periodicity Problem. SPIRE 2012: 284-294 - [c1]Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, William F. Smyth, Wojciech Tyczynski:
New and Efficient Approaches to the Quasiperiodic Characterisation of a String. Stringology 2012: 75-88 - [i2]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A Note on Efficient Computation of All Abelian Periods in a String. CoRR abs/1208.3313 (2012) - 2011
- [i1]Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A Linear Time Algorithm for Seeds Computation. CoRR abs/1107.2422 (2011)
Coauthor Index
[j46] [j44] [c93] [j41] [j39] [j38] [c83] [i72] [j37] [j36] [c73] [i69] [j33] [j32] [j31] [j30] [c68] [c65] [c59] [i57] [i56] [j28] [j27] [j25] [j24] [c57] [c56] [c54] [c53] [c49] [i51] [i46] [i45] [i44] [j23] [j22] [j21] [c46] [c44] [c42] [c40] [c39] [c38] [i41] [i40] [i39] [i38] [i36] [i35] [i34] [j20] [j19] [j18] [j17] [c37] [i33] [i30] [j15] [j13] [j11] [j10] [c34] [c31] [c29] [i27] [i26] [i25] [i24] [j8] [j6] [j5] [c27] [c25] [c24] [c22] [c20] [i19] [i17] [j3] [c18] [c17] [c15] [c13] [c12] [i16] [i12] [i9] [j2] [c10] [c9] [c8] [c7] [c6] [i8] [i4] [i3] [c5] [c4] [c3] [c2] [i2] [i1]
[j46] [j43] [c93] [j39] [j38] [c83] [i72] [j37] [j36] [j32] [j31] [j30] [c68] [c59] [i56] [i53] [j25] [c57] [c56] [c54] [c53] [c49] [i51] [i46] [i45] [i44] [j22] [j21] [c46] [c44] [c42] [c39] [c38] [i41] [i40] [i39] [i36] [i34] [j20] [j19] [j18] [j17] [c37] [j15] [j13] [j11] [j10] [c33] [c29] [i28] [i26] [i24] [j8] [j6] [j5] [c27] [c24] [c22] [c21] [c20] [i19] [i17] [j3] [c18] [c17] [c15] [c13] [c12] [i16] [i12] [i9] [j2] [c10] [c9] [c8] [c7] [c6] [i8] [i4] [i3] [c5] [c4] [c3] [c2] [i2] [i1]
[j46] [j43] [c93] [j39] [j38] [c83] [i72] [j37] [j36] [j32] [j31] [j30] [c68] [c59] [i56] [i53] [j25] [c57] [c56] [c54] [c53] [c49] [i51] [i46] [i45] [i44] [j22] [j21] [c46] [c44] [c42] [c39] [c38] [i41] [i40] [i39] [i36] [i34] [j19] [j17] [c37] [j15] [j11] [j10] [c33] [c29] [i28] [i26] [i24] [j8] [j6] [j5] [c27] [c24] [c22] [c21] [c20] [i17] [j3] [c18] [c15] [c13] [c12] [i16] [i12] [i9] [j2] [c10] [c8] [c7] [i8] [i4] [i3] [c5] [c4] [c3] [c2] [i2] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-29 21:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
