| A linear time algorithm for consecutive permutation pattern matching M Kubica, T Kulczyński, J Radoszewski, W Rytter, T Waleń Information Processing Letters 113 (12), 430-433, 2013 | 128 | 2013 |
| 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 | 96 | 2024 |
| Extracting powers and periods in a word from its runs structure M Crochemore, CS Iliopoulos, M Kubica, J Radoszewski, W Rytter, ... Theoretical Computer Science 521, 29-41, 2014 | 95* | 2014 |
| Order-preserving incomplete suffix trees and order-preserving indexes M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... String Processing and Information Retrieval: 20th International Symposium …, 2013 | 57 | 2013 |
| Efficient indexes for jumbled pattern matching with constant-sized alphabet T Kociumaka, J Radoszewski, W Rytter European Symposium on Algorithms, 625-636, 2013 | 50* | 2013 |
| Order-preserving indexing M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... Theoretical Computer Science 638, 122-135, 2016 | 47 | 2016 |
| 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 | 45 | 2012 |
| Dynamic and internal longest common substring A Amir, P Charalampopoulos, SP Pissis, J Radoszewski Algorithmica 82 (12), 3707-3743, 2020 | 40 | 2020 |
| 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 | 40 | 2012 |
| Efficient seed computation revisited M Christou, M Crochemore, CS Iliopoulos, M Kubica, SP Pissis, ... Theoretical Computer Science 483, 171-181, 2013 | 36 | 2013 |
| Fast algorithm for partial covers in words T Kociumaka, SP Pissis, J Radoszewski, W Rytter, T Waleń Algorithmica 73 (1), 217-233, 2015 | 32 | 2015 |
| Indexing weighted sequences: Neat and efficient C Barton, T Kociumaka, C Liu, SP Pissis, J Radoszewski Information and Computation 270, 104462, 2020 | 30 | 2020 |
| 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 | 30 | 2013 |
| Pattern matching and consensus problems on weighted sequences and profiles T Kociumaka, SP Pissis, J Radoszewski Theory of computing systems 63 (3), 506-542, 2019 | 28 | 2019 |
| On the maximal sum of exponents of runs in a string M Crochemore, M Kubica, J Radoszewski, W Rytter, T Waleń Journal of Discrete Algorithms 14, 29-36, 2012 | 28 | 2012 |
| Longest Common Substring with Approximately k Mismatches T Kociumaka, J Radoszewski, T Starikovskaya Algorithmica 81 (6), 2633-2652, 2019 | 27 | 2019 |
| Linear-Time Algorithm for Long LCF with Mismatches P Charalampopoulos, M Crochemore, CS Iliopoulos, T Kociumaka, ... arXiv preprint arXiv:1802.06369, 2018 | 27 | 2018 |
| Faster algorithms for longest common substring P Charalampopoulos, T Kociumaka, SP Pissis, J Radoszewski arXiv preprint arXiv:2105.03106, 2021 | 26 | 2021 |
| Longest common factor after one edit operation A Amir, P Charalampopoulos, CS Iliopoulos, SP Pissis, J Radoszewski International Symposium on String Processing and Information Retrieval, 14-26, 2017 | 26 | 2017 |
| Efficient index for weighted sequences C Barton, T Kociumaka, SP Pissis, J Radoszewski arXiv preprint arXiv:1602.01116, 2016 | 26 | 2016 |
Wojciech RytterWarsaw UniversityVerified email at mimuw.edu.pl
