( en | de | ru )

 

Disambiguation of "Gawrychowski, Pawel"

Author of the publication

copydeleteadd this publication to your clipboard
Universal Reconstruction of a String.

, , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 386-397. Springer, (2015)

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 Golak

Pawel Urbanski

Sascha Pawel

Pawel Durek

Pawel Silberring

 

Other publications of authors with the same name

Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings.. SPIRE, volume 7608 of Lecture Notes in Computer Science, page 229-236. Springer, (2012)Compressed Range Minimum Queries., , , and . CoRR, (2019)Slowing Down Top Trees for Better Worst-Case Bounds., and . CoRR, (2018)RLE Edit Distance in Near Optimal Time., , , , and . MFCS, volume 138 of LIPIcs, page 66:1-66:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search., , and . ACM Trans. Algorithms, 16 (2): 16:1-16:24 (2020)Computing minimal and maximal suffixes of a substring., , , , and . Theor. Comput. Sci., (2016)Fault-tolerant distance labeling for planar graphs., , , , and . Theor. Comput. Sci., (2022)Simple and efficient LZW-compressed multiple pattern matching.. J. Discrete Algorithms, (2014)Efficiently Testing Simon's Congruence., , , , and . CoRR, (2020)Average-Case Behavior of k-Shortest Path Algorithms., , , and . COMPLEX NETWORKS (1), volume 812 of Studies in Computational Intelligence, page 28-40. Springer, (2018)