( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Sampling Multiple Nodes in Large Networks: Beyond Random Walks

, , , и . Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining, стр. 37–47. New York, NY, USA, Association for Computing Machinery, (15.02.2022)
DOI: 10.1145/3488560.3498383

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.

Hugo Eden

Werner Eden

Klaus Eden

Klaus Eden

Carsten Eden

 

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

Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism., , , , и . ACM Trans. Comput. Theory, 11 (4): 24:1-24:33 (2019)Provable and practical approximations for the degree distribution using sublinear graph samples., , , , и . CoRR, (2017)The Arboricity Captures the Complexity of Sampling Edges., , и . ICALP, том 132 из LIPIcs, стр. 52:1-52:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Testing bounded arboricity., , и . SODA, стр. 2081-2092. SIAM, (2018)Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism., , , , и . SODA, стр. 2113-2132. SIAM, (2018)Learning-based Support Estimation in Sublinear Time., , , , , и . ICLR, OpenReview.net, (2021)Bias Reduction for Sum Estimation., , , , и . CoRR, (2022)Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs., , и . ICALP, том 229 из LIPIcs, стр. 56:1-56:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection., , и . ICALP, том 80 из LIPIcs, стр. 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Testing bounded arboricity., , и . CoRR, (2017)