| 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 | 75 | 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 | 53* | 2014 |
| Improved algorithms for the range next value problem and applications M Crochemore, CS Iliopoulos, M Kubica, MS Rahman, G Tischler, ... Theoretical Computer Science 434, 23-34, 2012 | 47* | 2012 |
| Efficient algorithms for three variants of the LPF table M Crochemore, CS Iliopoulos, M Kubica, W Rytter, T Waleń Journal of Discrete Algorithms 11, 51-61, 2012 | 40* | 2012 |
| Order-preserving incomplete suffix trees and order-preserving indexes M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... International Symposium on String Processing and Information Retrieval, 84-95, 2013 | 38 | 2013 |
| A formal approach to computer systems requirements documentation M Engel, M Kubica, J Madey, DL Parnas, AP Ravn, AJ van Schouwen Hybrid Systems, 452-474, 1992 | 36 | 1992 |
| LPF computation revisited M Crochemore, L Ilie, CS Iliopoulos, M Kubica, W Rytter, T Waleń International Workshop on Combinatorial Algorithms, 158-169, 2009 | 33 | 2009 |
| 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 | 28 | 2012 |
| Efficient seeds computation revisited M Christou, M Crochemore, CS Iliopoulos, M Kubica, SP Pissis, ... Annual Symposium on Combinatorial Pattern Matching, 350-363, 2011 | 22 | 2011 |
| On the Maximal Sum of Exponents of Runs in a String M Crochemore, M Kubica, J Radoszewski, W Rytter, T Waleń Combinatorial Algorithms, 10-19, 2011 | 22 | 2011 |
| Order-preserving indexing M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... Theoretical Computer Science 638, 122-135, 2016 | 21 | 2016 |
| 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 | 20 | 2013 |
| Computing the longest previous factor M Crochemore, L Ilie, CS Iliopoulos, M Kubica, W Rytter, T Waleń European Journal of Combinatorics 34 (1), 15-26, 2013 | 19 | 2013 |
| Polish olympiad in informatics–14 years of experience K Diks, M Kubica, K Stencel Olympiads in Informatics 1 (1), 50-56, 2007 | 17 | 2007 |
| Algorithms for computing the longest parameterized common subsequence CS Iliopoulos, M Kubica, MS Rahman, T Waleń Annual Symposium on Combinatorial Pattern Matching, 265-273, 2007 | 16 | 2007 |
| RNA multiple structural alignment with longest common subsequences S Bereg, M Kubica, T Waleń, B Zhu Journal of Combinatorial Optimization 13 (2), 179-188, 2007 | 16 | 2007 |
| 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 | 15 | 2012 |
| TAM'97: the Trace Assertion Method of Module Interface Specification. Reference Manual M Iglewski, M Kubica, J Madey, J Mincer-Daszkiewicz, K Stencel | 15 | 1997 |
| Order-preserving suffix trees and their algorithmic applications M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... arXiv preprint arXiv:1303.6872, 2013 | 13 | 2013 |
| Algorithms without Programming. M Kubica, J Radoszewski Olympiads in Informatics 4, 2010 | 13 | 2010 |
Tomasz WalenUniversity of WarsawEmail verificata su mimuw.edu.pl
