( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Online Parallel Paging with Optimal Makespan.

, , , , , и . SPAA, стр. 205-216. ACM, (2022)

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.

Michele Ocken

Michele Ferrari

Michele Galletti

Hannelore Michele

Michèle Mattusch

 

Другие публикации лиц с тем же именем

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