( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On recognising words that are squares for the shuffle product.

, и . Theor. Comput. Sci., (мая 2023)

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.

Stéphane Klein

Stéphane Haussler

Stéphane Müller

Stéphane Clinchant

Stéphane Aubry

 

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

Permutation Pattern matching in (213, 231)-avoiding permutations., , и . Discret. Math. Theor. Comput. Sci., (2016)Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms., , , , , и . Bioinform., 22 (11): 1359-1366 (2006)Finding approximate and constrained motifs in graphs., , и . Theor. Comput. Sci., (2013)The Maximum Zero-Sum Partition Problem., , , и . ICS, том 1723 из Communications in Computer and Information Science, стр. 73-85. Springer, (2022)RECOMB-Comparative Genomics Special Issue., и . J. Comput. Biol., 16 (10): 1285-1286 (2009)The Minimum Substring Cover Problem., , , и . WAOA, том 4927 из Lecture Notes in Computer Science, стр. 170-183. Springer, (2007)Parity Permutation Pattern Matching., , и . WALCOM, том 13973 из Lecture Notes in Computer Science, стр. 384-395. Springer, (2023)Recognizing Unit Multiple Intervals Is Hard., , , и . ISAAC, том 283 из LIPIcs, стр. 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Disorders and Permutations., , и . CPM, том 191 из LIPIcs, стр. 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Finding a Small Number of Colourful Components., , , , , и . CPM, том 128 из LIPIcs, стр. 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)