Author of the publication

Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis.

, , , , , and . SMT@CAV, volume 3725 of CEUR Workshop Proceedings, page 75. CEUR-WS.org, (2024)

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

k-Spectra of c-Balanced Words., , , and . CoRR, (2019)The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability., , , , and . CoRR, (2018)Word Equations in the Context of String Solving.. DLT, volume 13257 of Lecture Notes in Computer Science, page 13-32. Springer, (2022)k-Spectra of Weakly-c-Balanced Words., , , and . DLT, volume 11647 of Lecture Notes in Computer Science, page 265-277. Springer, (2019)Local Patterns., , , and . FSTTCS, volume 93 of LIPIcs, page 24:1-24:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On restricting the ambiguity in morphic images of words.. Loughborough University, UK, (2016)British Library, EThOS.Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number., , , , , and . ICALP, volume 132 of LIPIcs, page 109:1-109:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Edit Distance to k-Subsequence Universality., , , , , and . STACS, volume 187 of LIPIcs, page 25:1-25:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems., , , and . ISAAC, volume 248 of LIPIcs, page 64:1-64:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the Structure of Solution Sets to Regular Word Equations., and . ICALP, volume 168 of LIPIcs, page 124:1-124:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)