( en | de | ru )

 

Disambiguation of "Gawrychowski, Pawel"

Author of the publication

copydeleteadd this publication to your clipboard
The Nearest Colored Node in a Tree.

, , , and . CPM, volume 54 of LIPIcs, page 25:1-25:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pawel Urbanski

Pawel Golak

Sascha Pawel

Pawel Durek

Pawel Silberring

 

Other publications of authors with the same name

Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets., , , , and . Theory Comput. Syst., 62 (1): 162-191 (2018)Euclidean TSP with Few Inner Points in Linear Space., and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 701-713. Springer, (2014)Alphabetic Minimax Trees in Linear Time.. CSR, volume 7913 of Lecture Notes in Computer Science, page 36-48. Springer, (2013)Streaming Regular Expression Membership and Pattern Matching., , , and . SODA, page 670-694. SIAM, (2022)Cut Query Algorithms with Star Contraction., , , , , and . FOCS, page 507-518. IEEE, (2022)Chrobak Normal Form Revisited, with Applications.. CIAA, volume 6807 of Lecture Notes in Computer Science, page 142-153. Springer, (2011)Hyper-minimisation Made Efficient., and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 356-368. Springer, (2009)Faster Exponential Algorithm for Permutation Pattern Matching., and . SOSA, page 279-284. SIAM, (2022)Edit Distance with Block Operations., , , and . ESA, volume 112 of LIPIcs, page 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Almost optimal distance oracles for planar graphs., , , and . STOC, page 138-151. ACM, (2019)