From post

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.

 

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

On the Expressive Power of String Constraints., , , и . Proc. ACM Program. Lang., 7 (POPL): 278-308 (января 2023)On Turing Machines Deciding According to the Shortest Computations.. Axioms, 10 (4): 304 (2021)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)String Theories Involving Regular Membership Predicates: From Practice to Theory and Back., , , , , , и . WORDS, том 12847 из Lecture Notes in Computer Science, стр. 50-64. Springer, (2021)Scattered Factor-Universality of Words., , , , и . DLT, том 12086 из Lecture Notes in Computer Science, стр. 14-28. Springer, (2020)Synchronized Shuffle on Backbones., , и . Fundam. Informaticae, 73 (1-2): 191-202 (2006)Matching Patterns with Variables Under Edit Distance., , и . SPIRE, том 13617 из Lecture Notes in Computer Science, стр. 275-289. Springer, (2022)Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets., , , , и . Theory Comput. Syst., 62 (1): 162-191 (2018)An SMT Solver for Regular Expressions and Linear Arithmetic over String Length., , , , , , и . CAV (2), том 12760 из Lecture Notes in Computer Science, стр. 289-312. Springer, (2021)