Author of the publication

Chasing Convex Bodies and Functions.

, , , , , and . LATIN, volume 9644 of Lecture Notes in Computer Science, page 68-81. Springer, (2016)

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

Matching on the Line Admits No o(√log n)-Competitive Algorithm., and . ICALP, volume 198 of LIPIcs, page 103:1-103:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Matching on the line admits no $o(n)$-competitive algorithm., and . CoRR, (2020)Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST., , , , and . PODC, page 91-100. ACM, (2015)On the Distributed Complexity of Large-Scale Graph Computations., , and . SPAA, page 405-414. ACM, (2018)The Distributed Minimum Spanning Tree Problem., , and . Bull. EATCS, (2018)Tight Bounds for Parallel Paging and Green Paging., , , , , and . SODA, page 3022-3041. SIAM, (2021)Message Lower Bounds via Efficient Network Synchronization., , and . SIROCCO, volume 9988 of Lecture Notes in Computer Science, page 75-91. (2016)A Lower Bound Technique for Communication on BSP with Application to the FFT., , and . Euro-Par, volume 7484 of Lecture Notes in Computer Science, page 676-687. Springer, (2012)Communication Lower Bounds for Distributed-Memory Computations., and . STACS, volume 25 of LIPIcs, page 627-638. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Green Paging and Parallel Paging., , , , , and . SPAA, page 493-495. ACM, (2020)