( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Brief Announcement: Temporal Locality in Online Algorithms.

, , , , , и . DISC, том 246 из LIPIcs, стр. 52:1-52:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Parham Shafé

Parham Rooshenas

Parham Mashayekhi

Mahmoud Mahmoud

Amir Hossain Parham

 

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

Traffic engineering with joint link weight and segment optimization., , , , и . CoNEXT, стр. 313-327. ACM, (2021)Waypoint Routing in Special Networks., , , , и . Networking, стр. 496-504. IFIP, (2018)Local Fast Segment Rerouting on Hypercubes., , , и . OPODIS, том 125 из LIPIcs, стр. 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning., , и . PODC, стр. 461-463. ACM, (2020)On Polynomial-Time Congestion-Free Software-Defined Network Updates., , , , и . Networking, стр. 1-9. IEEE, (2019)Optimal Online Balanced Graph Partitioning., , и . INFOCOM, стр. 1-9. IEEE, (2021)Brief Announcement: Temporal Locality in Online Algorithms., , , , , и . DISC, том 246 из LIPIcs, стр. 52:1-52:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Maximally Resilient Replacement Paths for a Family of Product Graphs., , , и . OPODIS, том 184 из LIPIcs, стр. 26:1-26:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)