( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Connection caching under vaious models of communication.

, , и . SPAA, стр. 54-63. ACM, (2000)

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.

Gerhard Haim

Haim Taubenhaus

Haim Abramowitsch

Gerhard Haim

Gerhard Haim

 

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

Processing top k queries from samples., , и . CoNEXT, стр. 7. ACM, (2006)Get the most out of your sample: optimal unbiased estimators using partial information., и . PODS, стр. 13-24. ACM, (2011)Representations of Sparse Distributed Networks: A Locality-Sensitive Approach., и . CoRR, (2018)Reachability Oracles for Directed Transmission Graphs., , , и . CoRR, (2016)LP-based Analysis of Greedy-dual-size., и . SODA, стр. 879-880. ACM/SIAM, (1999)Path Minima in Incremental Unrooted Trees., и . ESA, том 5193 из Lecture Notes in Computer Science, стр. 565-576. Springer, (2008)Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs., , , и . FOCS, стр. 56-65. IEEE Computer Society, (2003)Optimal Cover of Points by Disks in a Simple Polygon., , , и . ESA (1), том 6346 из Lecture Notes in Computer Science, стр. 475-486. Springer, (2010)Balanced-Replication Algorithms for Distribution Trees., и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 297-309. Springer, (2002)Maximum Flows by Incremental Breadth-First Search., , , , и . ESA, том 6942 из Lecture Notes in Computer Science, стр. 457-468. Springer, (2011)