Tomasz Kociumaka
Tomasz Kociumaka
University of California, Berkeley
כתובת אימייל מאומתת בדומיין berkeley.edu - דף הבית
כותרת
צוטט על ידי
צוטט על ידי
שנה
Faster deterministic feedback vertex set‏
T Kociumaka, M Pilipczuk‏
Information Processing Letters 114 (10), 556-560, 2014‏
892014
Order-preserving indexing‏
M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ...‏
Theoretical Computer Science 638, 122-135, 2016‏
66*2016
Internal pattern matching queries in a text and applications‏
T Kociumaka, J Radoszewski, W Rytter, T Waleń‏
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014‏
522014
A linear time algorithm for seeds computation‏
T Kociumaka, M Kubica, J Radoszewski, W Rytter, T Waleń‏
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012‏
46*2012
Efficient indexes for jumbled pattern matching with constant-sized alphabet‏
T Kociumaka, J Radoszewski, W Rytter‏
Algorithmica 77 (4), 1194-1215, 2017‏
41*2017
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‏
412016
Efficient data structures for the factor periodicity problem‏
T Kociumaka, J Radoszewski, W Rytter, T Waleń‏
International Symposium on String Processing and Information Retrieval, 284-294, 2012‏
402012
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‏
382014
Approximating LZ77 via small-space multiple-pattern matching‏
J Fischer, T Gagie, P Gawrychowski, T Kociumaka‏
Algorithms-ESA 2015, 533-544, 2015‏
362015
Indexing weighted sequences: neat and efficient‏
C Barton, T Kociumaka, C Liu, SP Pissis, J Radoszewski‏
Information and Computation 270, 104462, 2020‏
34*2020
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‏
332018
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‏
312019
Enhanced string covering‏
T Flouri, CS Iliopoulos, T Kociumaka, SP Pissis, SJ Puglisi, WF Smyth, ...‏
Theoretical Computer Science 506, 102-114, 2013‏
292013
Fast algorithms for abelian periods in words and greatest common divisor queries‏
T Kociumaka, J Radoszewski, W Rytter‏
Journal of Computer and System Sciences 84, 205-218, 2017‏
26*2017
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‏
252016
Pattern matching and consensus problems on weighted sequences and profiles‏
T Kociumaka, SP Pissis, J Radoszewski‏
27th International Symposium on Algorithms and Computation (ISAAC 2016), 46 …, 2016‏
242016
A note on efficient computation of all Abelian periods in a string‏
M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, J Pachocki, ...‏
Information Processing Letters 113 (3), 74-77, 2013‏
242013
Sublinear space algorithms for the longest common substring problem‏
T Kociumaka, T Starikovskaya, HW Vildhøj‏
European Symposium on Algorithms, 605-617, 2014‏
232014
Fast algorithm for partial covers in words‏
T Kociumaka, SP Pissis, J Radoszewski, W Rytter, T Waleń‏
Algorithmica 73 (1), 217-233, 2015‏
222015
Resolution of the Burrows-Wheeler transform conjecture‏
D Kempa, T Kociumaka‏
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020‏
212020
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20