Author of the publication

The Hardness of Solving Simple Word Equations.

, , and . MFCS, volume 83 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Expressive Power of String Constraints., , , and . Proc. ACM Program. Lang., 7 (POPL): 278-308 (January 2023)On Turing Machines Deciding According to the Shortest Computations.. Axioms, 10 (4): 304 (2021)Finding Pseudo-repetitions., , , , and . STACS, volume 20 of LIPIcs, page 257-268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)The Hardness of Solving Simple Word Equations., , and . MFCS, volume 83 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)String Theories Involving Regular Membership Predicates: From Practice to Theory and Back., , , , , , and . WORDS, volume 12847 of Lecture Notes in Computer Science, page 50-64. Springer, (2021)Scattered Factor-Universality of Words., , , , and . DLT, volume 12086 of Lecture Notes in Computer Science, page 14-28. Springer, (2020)Synchronized Shuffle on Backbones., , and . Fundam. Informaticae, 73 (1-2): 191-202 (2006)Matching Patterns with Variables Under Edit Distance., , and . SPIRE, volume 13617 of Lecture Notes in Computer Science, page 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., , , , and . Theory Comput. Syst., 62 (1): 162-191 (2018)An SMT Solver for Regular Expressions and Linear Arithmetic over String Length., , , , , , and . CAV (2), volume 12760 of Lecture Notes in Computer Science, page 289-312. Springer, (2021)