( en | de | ru )

 

Disambiguation of "Walen, Tomasz"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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

A Note on Efficient Computation of All Abelian Periods in a String, , , , , , , , and . CoRR, (2012)Unary Words Have the Smallest Levenshtein k-Neighbourhoods., , , , and . CPM, volume 161 of LIPIcs, page 10:1-10:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Efficient algorithms for shortest partial seeds in words., , , , and . Theor. Comput. Sci., (2018)Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set., and . WAOA, volume 4368 of Lecture Notes in Computer Science, page 279-289. Springer, (2006)Weighted Shortest Common Supersequence Problem Revisited., , , , , , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 221-238. Springer, (2019)Efficient Algorithms for Shortest Partial Seeds in Words., , , , and . CPM, volume 8486 of Lecture Notes in Computer Science, page 192-201. Springer, (2014)Efficient Representation and Counting of Antipower Factors in Words., , , , , and . CoRR, (2018)A note on efficient computation of all Abelian periods in a string., , , , , , , , and . Inf. Process. Lett., 113 (3): 74-77 (2013)Extracting powers and periods in a word from its runs structure., , , , , and . Theor. Comput. Sci., (2014)The Number of Repetitions in 2D-Strings., , , , and . ESA, volume 173 of LIPIcs, page 32:1-32:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)