| 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 | 114 | 2013 |
| 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 | 83* | 2014 |
| 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 | 77 | 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 | 51 | 2013 |
| Efficient indexes for jumbled pattern matching with constant-sized alphabet T Kociumaka, J Radoszewski, W Rytter European Symposium on Algorithms, 625-636, 2013 | 46* | 2013 |
| 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 |
| Order-preserving indexing M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... Theoretical Computer Science 638, 122-135, 2016 | 39 | 2016 |
| 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 | 38 | 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 | 33 | 2015 |
| 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 | 29 | 2013 |
| Dynamic and internal longest common substring A Amir, P Charalampopoulos, SP Pissis, J Radoszewski Algorithmica 82 (12), 3707-3743, 2020 | 27 | 2020 |
| 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 | 27 | 2019 |
| The maximal number of cubic runs in a word M Crochemore, CS Iliopoulos, M Kubica, J Radoszewski, W Rytter, ... Journal of Computer and System Sciences 78 (6), 1828-1836, 2012 | 26 | 2012 |
| Indexing weighted sequences: neat and efficient C Barton, T Kociumaka, C Liu, SP Pissis, J Radoszewski Information and Computation 270, 104462, 2020 | 25 | 2020 |
| Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence T Kociumaka, J Radoszewski, W Rytter Combinatorial Pattern Matching: 25th Annual Symposium, CPM 2014, Moscow …, 2014 | 25 | 2014 |
| 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 | 25 | 2012 |
| 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 | 24 | 2017 |
| Efficient index for weighted sequences C Barton, T Kociumaka, SP Pissis, J Radoszewski arXiv preprint arXiv:1602.01116, 2016 | 24 | 2016 |
| Fast algorithms for abelian periods in words and greatest common divisor queries T Kociumaka, J Radoszewski, W Rytter 30th International Symposium on Theoretical Aspects of Computer Science …, 2013 | 24 | 2013 |
Wojciech RytterWarsaw UniversityVerifierad e-postadress på mimuw.edu.pl
