Author of the publication

Delegation for Search Problems.

, , and . ICALP, volume 229 of LIPIcs, page 73:1-73:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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

Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy., , , , and . ITCS, volume 94 of LIPIcs, page 34:1-34:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs., and . ITCS, volume 151 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Monochromatic Triangles, Intermediate Matrix Products, and Convolutions., , and . ITCS, volume 151 of LIPIcs, page 53:1-53:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Delegation for Search Problems., , and . ICALP, volume 229 of LIPIcs, page 73:1-73:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Faster Random k-CNF Satisfiability., and . ICALP, volume 168 of LIPIcs, page 78:1-78:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Cache-Adaptive Analysis., , , , , , , and . SPAA, page 135-144. ACM, (2016)Public-Key Cryptography in the Fine-Grained Setting., , and . CRYPTO (3), volume 11694 of Lecture Notes in Computer Science, page 605-635. Springer, (2019)Dynamic Boolean Formula Evaluation., , , and . ISAAC, volume 212 of LIPIcs, page 61:1-61:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Tight Hardness for Shortest Cycles and Paths in Sparse Graphs., , and . SODA, page 1236-1252. SIAM, (2018)The Complexity of Average-Case Dynamic Subgraph Counting., , and . SODA, page 459-498. SIAM, (2022)