( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Towards more efficient methods for solving regular-expression heavy string constraints.

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

Catalina-Oana Manea

Gheorghe Manea

Andrei Manea

Marilena Manea

Laura Manea

 

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

Longest Gapped Repeats and Palindromes., , и . CoRR, (2015)Synchronized Shuffle on Backbones., , и . Fundam. Informaticae, 73 (1-2): 191-202 (2006)On the Expressive Power of String Constraints., , , и . Proc. ACM Program. Lang., 7 (POPL): 278-308 (января 2023)Finding Pseudo-repetitions., , , , и . STACS, том 20 из LIPIcs, стр. 257-268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)The Hardness of Solving Simple Word Equations., , и . MFCS, том 83 из LIPIcs, стр. 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Scattered Factor-Universality of Words., , , , и . DLT, том 12086 из Lecture Notes in Computer Science, стр. 14-28. Springer, (2020)Accepting Networks of Splicing Processors with Filtered Connections., , , и . MCU, том 4664 из Lecture Notes in Computer Science, стр. 218-229. Springer, (2007)Hairpin Completion Versus Hairpin Reduction., и . CiE, том 4497 из Lecture Notes in Computer Science, стр. 532-541. Springer, (2007)Equations Enforcing Repetitions Under Permutations., , , и . WORDS, том 10432 из Lecture Notes in Computer Science, стр. 72-84. Springer, (2017)On the Solvability Problem for Restricted Classes of Word Equations., , и . DLT, том 9840 из Lecture Notes in Computer Science, стр. 306-318. Springer, (2016)