( en | de | ru )

 

Disambiguation of "Walen, Tomasz"

Author of the publication

copydeleteadd this publication to your clipboard
On the maximal sum of exponents of runs in a string

, , , , and . CoRR, (2010)

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.

Tomasz Kupka

Ascheablagerungsprobleme bei der Mitverbrennung von alternativen Brennstoffen in Steinkohlekraftwerken. TU Clausthal-Zellerfeld, (2009)

Tomasz Wocjan

Dynamics of DNA in nucleosomes and plasmids studied by Brownian dynamics. Uni Heidelberg, (2009)

Kurt Walenta

Kurt Walenta

Willy Walensky

 

Other publications of authors with the same name

Efficient Counting of Square Substrings in a Tree., , , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 207-216. Springer, (2012)Efficient counting of square substrings in a tree., , , , and . Theor. Comput. Sci., (2014)Approximate Circular Pattern Matching Under Edit Distance., , , , , and . STACS, volume 289 of LIPIcs, page 24:1-24:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Quasi-Linear-Time Algorithm for Longest Common Circular Factor., , , , , , , , and . CPM, volume 128 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Universal Reconstruction of a String., , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 386-397. Springer, (2015)On the Maximal Number of Cubic Runs in a String., , , , , and . LATA, volume 6031 of Lecture Notes in Computer Science, page 227-238. Springer, (2010)A linear time algorithm for seeds computation., , , , and . SODA, page 1095-1112. SIAM, (2012)The Maximum Number of Squares in a Tree., , , , , , , and . CPM, volume 7354 of Lecture Notes in Computer Science, page 27-40. Springer, (2012)Covering Problems for Partial Words and for Indeterminate Strings., , , , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 220-232. Springer, (2014)Tight Bound for the Number of Distinct Palindromes in a Tree., , , and . SPIRE, volume 9309 of Lecture Notes in Computer Science, page 270-276. Springer, (2015)