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

Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy., , , , and . CoRR, (2017)Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity., , , and . SPAA, page 213-222. ACM, (2018)Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems., , and . ITCS, volume 215 of LIPIcs, page 7:1-7:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing., , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 263-275. Springer, (2015)Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers., and . SPAA, page 195-204. ACM, (2018)Kibitz: End-to-End Recommendation System Builder., and . RecSys, page 335-336. ACM, (2015)Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling., , and . IACR Cryptology ePrint Archive, (2018)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 fuer Informatik, (2018)Upward Partitioned Book Embeddings., , , and . Graph Drawing, volume 10692 of Lecture Notes in Computer Science, page 210-223. Springer, (2017)Arboral satisfaction: Recognition and LP approximation., , , , , , , , , and . Inf. Process. Lett., (2017)