| 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 | 115 | 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 | 91 | 2014 |
| Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) K Bringmann, P Gawrychowski, S Mozes, O Weimann ACM Transactions on Algorithms (TALG) 16 (4), 1-22, 2020 | 75 | 2020 |
| 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 | 64 | 2018 |
| Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic P Gawrychowski European Symposium on Algorithms, 421-432, 2011 | 60 | 2011 |
| Alphabet-dependent string searching with wexponential search trees J Fischer, P Gawrychowski Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia …, 2015 | 58 | 2015 |
| 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 | 57 | 2010 |
| 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 | 55 | 2018 |
| 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 | 55 | 2015 |
| Minimum Cut in Time P Gawrychowski, S Mozes, O Weimann Theory of Computing Systems, 1-21, 2024 | 53 | 2024 |
| Order-preserving pattern matching with k mismatches P Gawrychowski, P Uznański Theoretical Computer Science 638, 136-144, 2016 | 53 | 2016 |
| 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 | 53 | 2014 |
| Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Time P Gawrychowski, H Kaplan, S Mozes, M Sharir, O Weimann SIAM Journal on Computing 50 (2), 509-554, 2021 | 51 | 2021 |
| Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes: Finding All Maximal α-gapped Repeats and Palindromes in Optimal … P Gawrychowski, T I, S Inenaga, D Köppl, F Manea Theory of Computing Systems 62, 162-191, 2018 | 51* | 2018 |
| Weighted ancestors in suffix trees P Gawrychowski, M Lewenstein, PK Nicholson Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014 | 49 | 2014 |
| Optimal pattern matching in LZW compressed strings P Gawrychowski ACM Transactions on Algorithms (TALG) 9 (3), 1-17, 2013 | 46 | 2013 |
| Approximating LZ77 via small-space multiple-pattern matching J Fischer, T Gagie, P Gawrychowski, T Kociumaka Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 44 | 2015 |
| 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 | 43 | 2010 |
| Faster algorithm for computing the edit distance between SLP-compressed strings P Gawrychowski International Symposium on String Processing and Information Retrieval, 229-236, 2012 | 42 | 2012 |
| Strong inapproximability of the shortest reset word P Gawrychowski, D Straszak International Symposium on Mathematical Foundations of Computer Science, 243-255, 2015 | 41 | 2015 |
Oren WeimannUniversity of Haifa在 cs.haifa.ac.il 的电子邮件经过验证
