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 | 88 | 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 | 66* | 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 | 53* | 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 | 45* | 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 | 42 | 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 | 37 | 2012 |
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 | 35 | 2009 |
Area–Oriented Technology Mapping for LUT–Based Logic Blocks M Kubica, D Kania International Journal of Applied Mathematics and Computer Science 27 (1 …, 2017 | 29 | 2017 |
Decomposition of multi-output functions oriented to configurability of logic blocks M Kubica, D Kania Bulletin of the Polish Academy of Sciences. Technical Sciences 65 (3), 2017 | 26 | 2017 |
Order-preserving indexing M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ... Theoretical Computer Science 638, 122-135, 2016 | 25 | 2016 |
Efficient seeds computation revisited M Christou, M Crochemore, CS Iliopoulos, M Kubica, SP Pissis, ... Annual Symposium on Combinatorial Pattern Matching, 350-363, 2011 | 25 | 2011 |
Logic synthesis for FPGAs based on cutting of BDD M Kubica, A Opara, D Kania Microprocessors and Microsystems 52, 173-187, 2017 | 24 | 2017 |
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 | 24 | 2013 |
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 | 24 | 2011 |
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 | 23 | 2013 |
Polish olympiad in informatics–14 years of experience K Diks, M Kubica, K Stencel Olympiads in Informatics 1 (1), 50-56, 2007 | 19 | 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 | 18 | 2012 |
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 | 18 | 2007 |
Strategy of logic synthesis using MTBDD dedicated to FPGA A Opara, M Kubica, D Kania Integration 62, 142-158, 2018 | 17 | 2018 |