Author of the publication

Data Structures Lower Bounds and Popular Conjectures.

, , , and . ESA, volume 204 of LIPIcs, page 39:1-39:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Colouring (Pr + Ps)-Free Graphs., , , , , and . Algorithmica, 82 (7): 1833-1858 (2020)ARRIVAL: Next Stop in CLS., , , , , and . ICALP, volume 107 of LIPIcs, page 60:1-60:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Average-Case Hardness in TFNP from One-Way Functions., , , and . TCC (3), volume 12552 of Lecture Notes in Computer Science, page 614-638. Springer, (2020)Stronger Lower Bounds for Online ORAM., , , and . TCC (2), volume 11892 of Lecture Notes in Computer Science, page 264-284. Springer, (2019)Data Structures Lower Bounds and Popular Conjectures., , , and . ESA, volume 204 of LIPIcs, page 39:1-39:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Colouring (P_r+P_s)-Free Graphs., , , , , and . ISAAC, volume 123 of LIPIcs, page 5:1-5:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)