Author of the publication

Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures.

, , , , , and . SWAT, volume 101 of LIPIcs, page 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made., , , and . CoRR, (2015)Public-Key Cryptography in the Fine-Grained Setting., , and . CRYPTO (3), volume 11694 of Lecture Notes in Computer Science, page 605-635. Springer, (2019)RNA-Folding - From Hardness to Algorithms.. MFCS, volume 58 of LIPIcs, page 5:1-5:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Knockout Tournaments.. Handbook of Computational Social Choice, Cambridge University Press, (2016)Subtree Isomorphism Revisited., , , , and . ACM Trans. Algorithms, 14 (3): 27:1-27:23 (2018)Finding, Minimizing, and Counting Weighted Subgraphs., and . SIAM J. Comput., 42 (3): 831-854 (2013)Manipulating Stochastically Generated Single-Elimination Tournaments for Nearly All Players., and . WINE, volume 7090 of Lecture Notes in Computer Science, page 326-337. Springer, (2011)Equivalences between triangle and range query problems., , , and . CoRR, (2019)Listing Cliques from Smaller Cliques., , , and . CoRR, (2023)Simpler and Higher Lower Bounds for Shortcut Sets., , and . CoRR, (2023)