( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tree Embeddings for Hop-Constrained Network Design.

, , и . CoRR, (2020)

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.

Milenko Zuzic

Sivahari Prasad Gorantla

Iwan Goranow

Adamantia Gorantonaki

Bengt Göransson

 

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

Hop-Constrained Oblivious Routing., , и . CoRR, (2020)Fast and Simple Algorithms for Computing both LCSk and LCSk+., , , , и . Stringology, стр. 50-62. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2018)Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms., , , , и . STOC, стр. 478-487. ACM, (2022)Sparse Semi-Oblivious Routing: Few Random Paths Suffice., , и . PODC, стр. 222-232. ACM, (2023)Fast and simple algorithms for computing both $LCS_k$ and $LCS_k+$., , , , и . CoRR, (2017)Universally-optimal distributed algorithms for known topologies., , и . STOC, стр. 1166-1179. ACM, (2021)Universally-Optimal Distributed Exact Min-Cut., и . PODC, стр. 281-291. ACM, (2022)Low-Congestion shortcuts without embedding., , и . Distributed Comput., 34 (1): 79-90 (2021)Tree embeddings for hop-constrained network design., , и . STOC, стр. 356-369. ACM, (2021)Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts., , , , и . DISC, том 246 из LIPIcs, стр. 6:1-6:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)