Obserwuj
Paweł Gawrychowski
Paweł Gawrychowski
University of Wrocław
Zweryfikowany adres z cs.uni.wroc.pl
Tytuł
Cytowane przez
Cytowane przez
Rok
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
1102012
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
892014
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
622020
Alphabet-dependent string searching with wexponential search trees
J Fischer, P Gawrychowski
Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia …, 2015
552015
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
P Gawrychowski
European Symposium on Algorithms, 421-432, 2011
552011
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
532015
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
522018
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
522010
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
512018
Order-preserving pattern matching with k mismatches
P Gawrychowski, P Uznański
Theoretical Computer Science 638, 136-144, 2016
502016
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
502014
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
46*2018
Weighted ancestors in suffix trees
P Gawrychowski, M Lewenstein, PK Nicholson
Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014
462014
Optimal pattern matching in LZW compressed strings
P Gawrychowski
ACM Transactions on Algorithms (TALG) 9 (3), 1-17, 2013
462013
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
452021
Minimum Cut in Time
P Gawrychowski, S Mozes, O Weimann
arXiv preprint arXiv:1911.01145, 2019
442019
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
412010
Strong inapproximability of the shortest reset word
P Gawrychowski, D Straszak
International Symposium on Mathematical Foundations of Computer Science, 243-255, 2015
402015
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
392015
Faster algorithm for computing the edit distance between SLP-compressed strings
P Gawrychowski
International Symposium on String Processing and Information Retrieval, 229-236, 2012
372012
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20