( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Palindromic k-Factorization in Pure Linear Time.

, и . MFCS, том 170 из LIPIcs, стр. 81:1-81:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Shurmedin Njama

Arseny Sokolov

Arseny Kovyrshin

Simon M M Laimer

M. Biswas M. Dam

 

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

The Number of Distinct Subpalindromes in Random Words., и . CoRR, (2015)Combinatorial Characterization of Formal Languages. CoRR, (2010)On Searching Zimin Patterns., и . CoRR, (2014)On the Combinatorics of Palindromes and Antipalindromes., , и . CoRR, (2015)Growth of Power-Free Languages over Large Alphabets.. Theory Comput. Syst., 54 (2): 224-243 (2014)On Abelian repetition threshold., и . RAIRO Theor. Informatics Appl., 46 (1): 147-163 (2012)On the growth rates of complexity of threshold languages., и . RAIRO Theor. Informatics Appl., 44 (1): 175-192 (2010)Pal k is Linear Recognizable Online., , и . SOFSEM, том 8939 из Lecture Notes in Computer Science, стр. 289-301. Springer, (2015)Ternary Square-Free Partial Words with Many Wildcards., и . DLT, том 9840 из Lecture Notes in Computer Science, стр. 177-189. Springer, (2016)Growth rates of complexity of power-free languages.. Theor. Comput. Sci., 411 (34-36): 3209-3223 (2010)