Author of the publication

On the Topological Complexity of MSO+U and Related Automata Models.

, , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 429-440. Springer, (2010)

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

Weak MSO+U over infinite trees., and . STACS, volume 14 of LIPIcs, page 648-660. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Register Automata with Extrema Constraints, and an Application to Two-Variable Logic., and . CoRR, (2021)Treelike Decompositions for Transductions of Sparse Graphs., , , , and . LICS, page 31:1-31:14. ACM, (2022)Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures., , , , and . ICALP, volume 229 of LIPIcs, page 102:1-102:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Turing Machines with Atoms., , , and . LICS, page 183-192. IEEE Computer Society, (2013)On ultralimits of sparse graph classes., and . CoRR, (2015)On the Topological Complexity of MSO+U and Related Automata Models., , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 429-440. Springer, (2010)Automata based verification over linearly ordered data domains., and . STACS, volume 9 of LIPIcs, page 81-92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Entropy Bounds for Conjunctive Queries with Functional Dependencies., and . ICDT, volume 68 of LIPIcs, page 15:1-15:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Imperative Programming in Sets with Atoms., and . FSTTCS, volume 18 of LIPIcs, page 4-15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)