( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set.

, , , и . PODC, стр. 283-285. ACM, (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.

Roy Jay Schwartzman

Britta Budde-Schwartzman

Gregory Kroon

Robert Gregory

Isa Gregory

 

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

Adapting Local Sequential Algorithms to the Distributed Setting., и . DISC, том 121 из LIPIcs, стр. 35:1-35:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Improved Distributed Approximations for Maximum Independent Set., , , и . DISC, том 179 из LIPIcs, стр. 35:1-35:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set., , , и . PODC, стр. 283-285. ACM, (2020)On the Complexity of Load Balancing in Dynamic Networks., , , и . SPAA, стр. 254-264. ACM, (2021)Mini-batch k-means terminates within O(d/ϵ) iterations.. ICLR, OpenReview.net, (2023)Stochastic Distance in Property Testing., , и . CoRR, (2024)Finding Subgraphs in Highly Dynamic Networks., , и . SPAA, стр. 140-150. ACM, (2021)Fast Deterministic Algorithms for Highly-Dynamic Networks., , , , и . OPODIS, том 184 из LIPIcs, стр. 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Smoothed Analysis of Population Protocols., и . DISC, том 209 из LIPIcs, стр. 34:1-34:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds., , и . PODC, стр. 3-8. ACM, (2016)