( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond.

, , , и . STOC, стр. 1487-1500. ACM, (2022)

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

 

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

Improved Distributed Approximations for Maximum Independent Set., , , и . DISC, том 179 из LIPIcs, стр. 35:1-35:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Constant-Round Spanners and Shortest Paths in Congested Clique and MPC., , , и . PODC, стр. 223-233. ACM, (2021)A Composition-Based Method for Combinatorial Test Design., , , и . ICST Workshops, стр. 249-252. IEEE Computer Society, (2017)Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond., , , и . STOC, стр. 1487-1500. ACM, (2022)Listing 4-Cycles., , , и . FSTTCS, том 284 из LIPIcs, стр. 25:1-25:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Communication Complexity of Secure Multi-Party Computation With Aborts., , , , и . CoRR, (2024)Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set., , , и . PODC, стр. 283-285. ACM, (2020)Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST., , и . PODC, стр. 511-520. ACM, (2020)Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model., , и . DISC, том 91 из LIPIcs, стр. 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks., , и . DISC, том 9888 из Lecture Notes in Computer Science, стр. 29-42. Springer, (2016)