From post

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.

 

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

Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles., , , , и . DISC, том 146 из LIPIcs, стр. 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A distributed algorithm for directed minimum-weight spanning tree., и . Distributed Comput., 36 (1): 57-87 (марта 2023)Constant-Round Spanners and Shortest Paths in Congested Clique and MPC., , , и . PODC, стр. 223-233. ACM, (2021)Massively Parallel Computation in a Heterogeneous Regime., , и . PODC, стр. 345-355. ACM, (2022)Tree Learning: Optimal Sample Complexity and Algorithms., , , , , и . AAAI, стр. 6701-6708. AAAI Press, (2023)Optimal Sample Complexity of Contrastive Learning., , , , и . CoRR, (2023)Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators., , и . OPODIS, том 217 из LIPIcs, стр. 21:1-21:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Distributed Property Testing for Subgraph-Freeness Revisited., , и . CoRR, (2017)A Distributed Algorithm for Directed Minimum-Weight Spanning Tree., и . DISC, том 146 из LIPIcs, стр. 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Distributed Uniformity Testing., , и . PODC, стр. 455-464. ACM, (2018)