Author of the publication

Descriptive Complexity for counting complexity classes.

, , and . LICS, page 1-12. IEEE Computer Society, (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

How to choose the root: centrality measures over tree structures, , and . (2021)cite arxiv:2112.13736Comment: submitted to PODS2022.Bounded repairability for regular tree languages., , and . ICDT, page 155-168. ACM, (2012)Efficient Enumeration for Annotated Grammars., , , and . PODS, page 291-300. ACM, (2022)When is approximate counting for conjunctive queries tractable?, , , and . STOC, page 1015-1027. ACM, (2021)Streaming Enumeration on Nested Documents., and . ICDT, volume 220 of LIPIcs, page 19:1-19:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Matrix Query Languages., , , , and . SIGMOD Rec., 50 (3): 6-19 (2021)The recovery of a schema mapping: bringing exchanged data back., , and . PODS, page 13-22. ACM, (2008)Expressive Power of Linear Algebra Query Languages., , , and . PODS, page 342-354. ACM, (2021)Regular Repair of Specifications., , and . LICS, page 335-344. IEEE Computer Society, (2011)Descriptive Complexity for counting complexity classes., , and . LICS, page 1-12. IEEE Computer Society, (2017)