Seguir
Tomasz Kociumaka
Tomasz Kociumaka
Max Planck Institute for Informatics, Saarland Informatics Campus
Dirección de correo verificada de mpi-inf.mpg.de - Página principal
Título
Citado por
Citado por
Año
Faster deterministic feedback vertex set
T Kociumaka, M Pilipczuk
Information Processing Letters 114 (10), 556-560, 2014
1322014
Resolution of the Burrows-Wheeler transform conjecture
D Kempa, T Kociumaka
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
1042020
Towards a definitive compressibility measure for repetitive sequences
T Kociumaka, G Navarro, N Prezza
IEEE Transactions on Information Theory, 2022
101*2022
Internal pattern matching queries in a text and applications
T Kociumaka, J Radoszewski, W Rytter, T Waleń
SIAM Journal on Computing 53 (5), 1524-1577, 2024
972024
Order-preserving indexing
M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ...
Theoretical Computer Science 638, 122-135, 2016
94*2016
A fast branching algorithm for cluster vertex deletion
A Boral, M Cygan, T Kociumaka, M Pilipczuk
Theory of Computing Systems 58 (2), 357-376, 2016
802016
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
D Kempa, T Kociumaka
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
792019
Optimal-time dictionary-compressed indexes
AR Christiansen, MB Ettienne, T Kociumaka, G Navarro, N Prezza
ACM Transactions on Algorithms (TALG) 17 (1), 1-39, 2020
762020
Optimal dynamic strings
P Gawrychowski, A Karczmarz, T Kociumaka, J Łącki, P Sankowski
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
722018
A linear time algorithm for seeds computation
T Kociumaka, M Kubica, J Radoszewski, W Rytter, T Waleń
ACM Transactions on Algorithms 16 (2), 2020
64*2020
Wavelet trees meet suffix trees
M Babenko, P Gawrychowski, T Kociumaka, T Starikovskaya
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
622014
Faster approximate pattern matching: A unified approach
P Charalampopoulos, T Kociumaka, P Wellnitz
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
522020
Efficient indexes for jumbled pattern matching with constant-sized alphabet
T Kociumaka, J Radoszewski, W Rytter
Algorithmica 77, 1194-1215, 2017
51*2017
Efficient data structures for internal queries in texts
T Kociumaka
PhD thesis, University of Warsaw, 2018
502018
Indexing weighted sequences: Neat and efficient
C Barton, T Kociumaka, C Liu, SP Pissis, J Radoszewski
Information and Computation 270, 104462, 2020
46*2020
Approximating LZ77 via small-space multiple-pattern matching
J Fischer, T Gagie, P Gawrychowski, T Kociumaka
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
462015
Efficient data structures for the factor periodicity problem
T Kociumaka, J Radoszewski, W Rytter, T Waleń
String Processing and Information Retrieval: 19th International Symposium …, 2012
412012
Linear search by a pair of distinct-speed robots
E Bampas, J Czyzowicz, L Gąsieniec, D Ilcinkas, R Klasing, T Kociumaka, ...
Algorithmica 81, 317-342, 2019
402019
Faster longest common extension queries in strings over general alphabets
P Gawrychowski, T Kociumaka, W Rytter, T Waleń
27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 5:1-5:13, 2016
382016
Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
T Kociumaka, J Radoszewski, W Rytter
SIAM Journal on Discrete Mathematics 30 (4), 2027-2046, 2016
37*2016
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20