Author of the publication

Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars.

, and . CPM, volume 78 of LIPIcs, page 12:1-12:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Faster Approximate Pattern Matching: A Unified Approach., , and . FOCS, page 978-989. IEEE, (2020)Shining Light on Periodic Dominating Sets in Bounded-Treewidth Graphs., , and . CoRR, (2024)Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory., and . SODA, page 2161-2180. SIAM, (2020)From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs., , and . CoRR, (2024)Counting Small Induced Subgraphs with Edge-Monotone Properties., , and . STOC, page 1517-1525. ACM, (2024)On the Communication Complexity of Approximate Pattern Matching., , and . STOC, page 1758-1768. ACM, (2024)Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders., , and . CoRR, (2020)Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices., , and . FOCS, page 698-707. IEEE, (2022)Faster Minimization of Tardy Processing Time on a Single Machine., , , , and . ICALP, volume 168 of LIPIcs, page 19:1-19:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders., , and . ICALP, volume 198 of LIPIcs, page 108:1-108:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)