( 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.

Marcello Seri

Persephone Seri

Alexander Khoury

Paolo Seri

Akdes Serin

 

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

Smaller Cuts, Higher Lower Bounds., , , и . ACM Trans. Algorithms, 17 (4): 30:1-30:40 (2021)A Composition-Based Method for Combinatorial Test Design., , , и . ICST Workshops, стр. 249-252. IEEE Computer Society, (2017)Listing 4-Cycles., , , и . FSTTCS, том 284 из LIPIcs, стр. 25:1-25:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond., , , и . STOC, стр. 1487-1500. ACM, (2022)Constant-Round Spanners and Shortest Paths in Congested Clique and MPC., , , и . PODC, стр. 223-233. ACM, (2021)Improved Distributed Approximations for Maximum Independent Set., , , и . DISC, том 179 из LIPIcs, стр. 35:1-35:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fooling views: a new lower bound technique for distributed computations under congestion., , , и . Distributed Comput., 33 (6): 545-559 (2020)Listing 4-Cycles., , , и . CoRR, (2022)On the Communication Complexity of Secure Multi-Party Computation With Aborts., , , , и . PODC, стр. 480-491. ACM, (2024)Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks., , и . DISC, том 9888 из Lecture Notes in Computer Science, стр. 29-42. Springer, (2016)