Author of the publication

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

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration., , , , and . CoRR, (2019)Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration., , , , and . PODS, page 393-409. ACM, (2020)A characterization of efficiently compilable constraint languages., , and . CoRR, (2023)Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration., , , , , and . ACM Trans. Database Syst., 47 (3): 9:1-9:49 (2022)Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form., , and . STACS, volume 289 of LIPIcs, page 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width., and . CoRR, (2020)Compiling Existential Positive Queries to Bounded-Variable Fragments., and . PODS, page 353-364. ACM, (2019)A dichotomy for succinct representations of homomorphisms., and . CoRR, (2022)A Dichotomy for Succinct Representations of Homomorphisms., and . ICALP, volume 261 of LIPIcs, page 113:1-113:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Characterization of Efficiently Compilable Constraint Languages., , and . STACS, volume 289 of LIPIcs, page 11:1-11:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)