( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the maximal sum of exponents of runs in a string

, , , , и . 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.

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)

Frank Walendzik

Tanja Walenski

Sabine Walentowski

 

Другие публикации лиц с тем же именем

Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set., и . WAOA, том 4368 из Lecture Notes in Computer Science, стр. 279-289. Springer, (2006)Weighted Shortest Common Supersequence Problem Revisited., , , , , , , и . SPIRE, том 11811 из Lecture Notes in Computer Science, стр. 221-238. Springer, (2019)Efficient Algorithms for Shortest Partial Seeds in Words., , , , и . CPM, том 8486 из Lecture Notes in Computer Science, стр. 192-201. Springer, (2014)Unary Words Have the Smallest Levenshtein k-Neighbourhoods., , , , и . CPM, том 161 из LIPIcs, стр. 10:1-10:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)New Simple Efficient Algorithms Computing Powers and Runs in Strings., , , , , , и . Stringology, стр. 138-149. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2010)Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word., , , и . Developments in Language Theory, том 8633 из Lecture Notes in Computer Science, стр. 215-226. Springer, (2014)Rectangular Tile Covers of 2D-Strings., , , , и . CPM, том 223 из LIPIcs, стр. 23:1-23:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Number of Repetitions in 2D-Strings., , , , и . ESA, том 173 из LIPIcs, стр. 32:1-32:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)String Periods in the Order-Preserving Model., , , , , и . STACS, том 96 из LIPIcs, стр. 38:1-38:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Efficient counting of square substrings in a tree., , , , и . Theor. Comput. Sci., (2014)