| A faster grammar-based self-index T Gagie, P Gawrychowski, J Kärkkäinen, Y Nekrich, SJ Puglisi International Conference on Language and Automata Theory and Applications …, 2012 | 83 | 2012 |
| LZ77-based self-indexing with faster pattern matching T Gagie, P Gawrychowski, J Kärkkäinen, Y Nekrich, SJ Puglisi Latin American Symposium on Theoretical Informatics, 731-742, 2014 | 64 | 2014 |
| Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic P Gawrychowski European Symposium on Algorithms, 421-432, 2011 | 47 | 2011 |
| Alphabet-dependent string searching with wexponential search trees J Fischer, P Gawrychowski Annual Symposium on Combinatorial Pattern Matching, 160-171, 2015 | 43 | 2015 |
| Queries on LZ-bounded encodings D Belazzougui, T Gagie, P Gawrychowski, J Kärkkäinen, A Ordónez, ... 2015 Data Compression Conference, 83-92, 2015 | 43 | 2015 |
| Optimal pattern matching in LZW compressed strings P Gawrychowski ACM Transactions on Algorithms (TALG) 9 (3), 1-17, 2013 | 42 | 2013 |
| Finding the growth rate of a regular or context-free language in polynomial time P Gawrychowski, D Krieger, N Rampersad, J Shallit International Journal of Foundations of Computer Science 21 (04), 597-618, 2010 | 41 | 2010 |
| Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks J Byrka, P Gawrychowski, KT Huber, S Kelk Journal of Discrete Algorithms 8 (1), 65-75, 2010 | 39 | 2010 |
| Order-preserving pattern matching with k mismatches P Gawrychowski, P Uznański Theoretical Computer Science 638, 136-144, 2016 | 38 | 2016 |
| Better tradeoffs for exact distance oracles in planar graphs P Gawrychowski, S Mozes, O Weimann, C Wulff-Nilsen Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 36 | 2018 |
| Approximating LZ77 via small-space multiple-pattern matching J Fischer, T Gagie, P Gawrychowski, T Kociumaka Algorithms-ESA 2015, 533-544, 2015 | 36 | 2015 |
| Tighter bounds and optimal algorithms for all maximal α-gapped repeats and palindromes P Gawrychowski, I Tomohiro, S Inenaga, D Köppl, F Manea Theory of Computing Systems 62 (1), 162-191, 2018 | 35* | 2018 |
| Weighted ancestors in suffix trees P Gawrychowski, M Lewenstein, PK Nicholson European Symposium on Algorithms, 455-466, 2014 | 35 | 2014 |
| 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 | 33 | 2014 |
| Strong inapproximability of the shortest reset word P Gawrychowski, D Straszak International Symposium on Mathematical Foundations of Computer Science, 243-255, 2015 | 32 | 2015 |
| 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 | 31 | 2018 |
| Faster algorithm for computing the edit distance between SLP-compressed strings P Gawrychowski International Symposium on String Processing and Information Retrieval, 229-236, 2012 | 30 | 2012 |
| Faster approximate pattern matching in compressed repetitive texts T Gagie, P Gawrychowski, SJ Puglisi International Symposium on Algorithms and Computation, 653-662, 2011 | 30 | 2011 |
| Validating the Knuth-Morris-Pratt failure function, fast and online P Gawrychowski, A Jeż, Ł Jeż Theory of Computing Systems 54 (2), 337-372, 2014 | 29* | 2014 |
| Hyper-minimisation made efficient P Gawrychowski, A Jeż International Symposium on Mathematical Foundations of Computer Science, 356-368, 2009 | 28 | 2009 |
Oren WeimannUniversity of HaifaVerified email at cs.haifa.ac.il
