( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
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)

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)

Tomasz Chelmicki

Tomasz We̜cławski

Tomasz Piech

 

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

Weighted Shortest Common Supersequence Problem Revisited., , , , , , , и . SPIRE, том 11811 из Lecture Notes in Computer Science, стр. 221-238. Springer, (2019)Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares., , и . ISAAC, том 283 из LIPIcs, стр. 10:1-10:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Dynamic Dynamic Time Warping., , , , , и . SODA, стр. 208-242. SIAM, (2024)Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance., и . FOCS, стр. 1168-1179. IEEE, (2020)Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet., , и . ESA, том 8125 из Lecture Notes in Computer Science, стр. 625-636. Springer, (2013)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)Computing minimal and maximal suffixes of a substring., , , , и . Theor. Comput. Sci., (2016)Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays., и . CoRR, (2021)Resolution of the burrows-wheeler transform conjecture., и . Commun. ACM, 65 (6): 91-98 (2022)The Dynamic k-Mismatch Problem., , , , и . CoRR, (2021)