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

Constant Approximating Parameterized k-SetCover is W2-hard., , , and . CoRR, (2022)Automated Tail Bound Analysis for Probabilistic Recurrence Relations., , , and . CAV (3), volume 13966 of Lecture Notes in Computer Science, page 16-39. Springer, (2023)TreeGen: A Tree-Based Transformer Architecture for Code Generation., , , , , and . CoRR, (2019)On Lower Bounds of Approximating Parameterized k-Clique., , , and . ICALP, volume 229 of LIPIcs, page 90:1-90:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH., , , , and . Electron. Colloquium Comput. Complex., (2024)Guiding dynamic programing via structural probability for accelerating programming by example., , , and . Proc. ACM Program. Lang., 4 (OOPSLA): 224:1-224:29 (2020)Quantitative Analysis of Assertion Violations in Probabilistic Programs., , , , and . CoRR, (2020)On Lower Bounds of Approximating Parameterized k-Clique., , , and . CoRR, (2021)Improved Hardness of Approximating k-Clique under ETH., , , and . FOCS, page 285-306. IEEE, (2023)Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations., , , , , and . CoRR, (2020)