Author of the publication

Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection.

, and . Theory Comput. Syst., 65 (1): 3-41 (2021)

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

Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection., and . Theory Comput. Syst., 65 (1): 3-41 (2021)A characterization of efficiently compilable constraint languages., , and . CoRR, (2023)Constant-Delay Enumeration for Nondeterministic Document Spanners., , , and . CoRR, (2020)Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation., and . AAAI, page 5564-5572. AAAI Press, (2022)Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity., and . ICDT, volume 290 of LIPIcs, page 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Constant-Delay Enumeration for Nondeterministic Document Spanners., , , and . ICDT, volume 127 of LIPIcs, page 22:1-22:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Tractable QBF by Knowledge Compilation., and . STACS, volume 126 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Characterizing Tseitin-Formulas with Short Regular Resolution Refutations., and . SAT, volume 12831 of Lecture Notes in Computer Science, page 116-133. Springer, (2021)Bounds on BDD-Based Bucket Elimination.. SAT, volume 271 of LIPIcs, page 16:1-16:11. 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)