Author of the publication

Tree Automata over Infinite Alphabets.

, and . Pillars of Computer Science, volume 4800 of Lecture Notes in Computer Science, page 386-423. Springer, (2008)

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

Tree Automata over Infinite Alphabets., and . Pillars of Computer Science, volume 4800 of Lecture Notes in Computer Science, page 386-423. Springer, (2008)Efficient reasoning about data trees via integer linear programming., , and . ACM Trans. Database Syst., 37 (3): 19:1-19:28 (2012)Efficient reasoning about data trees via integer linear programming., , and . ICDT, page 18-29. ACM, (2011)Reducing NEXP-complete problems to DQBF., , , and . FMCAD, page 199-204. IEEE, (2022)Distributed Streaming with Finite Memory., , , and . ICDT, volume 31 of LIPIcs, page 324-341. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Two Variable Logic with Ultimately Periodic Counting., , and . ICALP, volume 168 of LIPIcs, page 112:1-112:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Separating Counting from Non-Counting in Fragments of Two-Variable First-Order Logic (Extended Abstract)., , , and . Description Logics, volume 3739 of CEUR Workshop Proceedings, CEUR-WS.org, (2024)On the Complexity of k-DQBF., and . SAT, volume 271 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Automata for two-variable logic over trees with ordered data values. CoRR, (2012)Subdividing Alpha Complex., and . FSTTCS, volume 3328 of Lecture Notes in Computer Science, page 186-197. Springer, (2004)