[go: up one dir, main page]

Follow
Paweł Gawrychowski
Paweł Gawrychowski
Verified email at cs.uni.wroc.pl
Title
Cited by
Cited by
Year
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
1222012
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
1002014
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
902018
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
872020
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
702014
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
692021
Alphabet-dependent string searching with wexponential search trees
J Fischer, P Gawrychowski
Annual Symposium on Combinatorial Pattern Matching, 160-171, 2015
692015
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
P Gawrychowski
European Symposium on Algorithms, 421-432, 2011
682011
Minimum Cut in Time
P Gawrychowski, S Mozes, O Weimann
arXiv preprint arXiv:1911.01145, 2019
642019
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
632010
Weighted ancestors in suffix trees
P Gawrychowski, M Lewenstein, PK Nicholson
European Symposium on Algorithms, 455-466, 2014
602014
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
592018
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 (1), 162-191, 2018
57*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
572015
Order-preserving pattern matching with k mismatches
P Gawrychowski, P Uznański
Theoretical Computer Science 638, 136-144, 2016
562016
Towards unified approximate pattern matching for hamming and l_1 distance
P Gawrychowski, P Uznanski
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
552018
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
522015
Elastic-degenerate string matching via fast matrix multiplication
G Bernardini, P Gawrychowski, N Pisanti, SP Pissis, G Rosone
SIAM Journal on Computing 51 (3), 549-576, 2022
51*2022
Optimal pattern matching in LZW compressed strings
P Gawrychowski
ACM Transactions on Algorithms (TALG) 9 (3), 1-17, 2013
512013
Efficiently testing Simon's congruence
P Gawrychowski, M Kosche, T Koß, F Manea, S Siemer
arXiv preprint arXiv:2005.01112, 2020
452020
The system can't perform the operation now. Try again later.
Articles 1–20