Author of the publication

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)

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

Efficient reasoning about data trees via integer linear programming., , and . ICDT, page 18-29. ACM, (2011)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)Regular Expressions for Languages over Infinite Alphabets., and . Fundam. Informaticae, 69 (3): 301-318 (2006)Subsequence versus substring constraints in sequence pattern languages., , and . Acta Informatica, 58 (1-2): 35-56 (2021)Parallel Evaluation of Multi-Semi-Joins., , , and . Proc. VLDB Endow., 9 (10): 732-743 (2016)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)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)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)