Paweł Gawrychowski
Paweł Gawrychowski
Verified email at
Cited by
Cited by
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
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
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
P Gawrychowski
European Symposium on Algorithms, 421-432, 2011
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
Optimal pattern matching in LZW compressed strings
P Gawrychowski
ACM Transactions on Algorithms (TALG) 9 (3), 1-17, 2013
Alphabet-dependent string searching with wexponential search trees
J Fischer, P Gawrychowski
Annual Symposium on Combinatorial Pattern Matching, 160-171, 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
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
Approximating LZ77 via small-space multiple-pattern matching
J Fischer, T Gagie, P Gawrychowski, T Kociumaka
Algorithms-ESA 2015, 533-544, 2015
Order-preserving pattern matching with k mismatches
P Gawrychowski, P Uznański
Theoretical Computer Science 638, 136-144, 2016
Weighted ancestors in suffix trees
P Gawrychowski, M Lewenstein, PK Nicholson
European Symposium on Algorithms, 455-466, 2014
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
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
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
Strong inapproximability of the shortest reset word
P Gawrychowski, D Straszak
International Symposium on Mathematical Foundations of Computer Science, 243-255, 2015
Validating the Knuth-Morris-Pratt failure function, fast and online
P Gawrychowski, A Jeż, Ł Jeż
Theory of Computing Systems 54 (2), 337-372, 2014
Faster approximate pattern matching in compressed repetitive texts
T Gagie, P Gawrychowski, SJ Puglisi
International Symposium on Algorithms and Computation, 653-662, 2011
Faster algorithm for computing the edit distance between SLP-compressed strings
P Gawrychowski
International Symposium on String Processing and Information Retrieval, 229-236, 2012
Hyper-minimisation made efficient
P Gawrychowski, A Jeż
International Symposium on Mathematical Foundations of Computer Science, 356-368, 2009
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
The system can't perform the operation now. Try again later.
Articles 1–20