Author of the publication

Complexity-theoretic obstacles to achieving energy savings with near-threshold computing.

, , , , and . IGCC, page 1-8. IEEE Computer Society, (2014)

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

Tight Bounds for Distributed Graph Computations., , and . CoRR, (2016)A Lower Bound Technique for Communication in BSP., , and . ACM Trans. Parallel Comput., 4 (3): 14:1-14:27 (2018)A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line., , , , and . Algorithmica, 81 (7): 2917-2933 (2019)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)Equivalence classes and conditional hardness in massively parallel computations., and . Distributed Comput., 35 (2): 165-183 (2022)Almost Optimal Distributed Algorithms for Large-Scale Graph Problems., , and . CoRR, (2015)Matching on the line admits no $o(n)$-competitive algorithm., and . CoRR, (2020)On the Distributed Complexity of Large-Scale Graph Computations., , and . ACM Trans. Parallel Comput., 8 (2): 7:1-7:28 (2021)On the Distributed Complexity of Large-Scale Graph Computations., , and . SPAA, page 405-414. ACM, (2018)Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST., , , , and . PODC, page 91-100. ACM, (2015)