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.

 

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

Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time., и . FOCS, стр. 436-455. IEEE Computer Society, (2019)Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds., , и . FOCS, стр. 456-480. IEEE Computer Society, (2019)Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary., и . SODA, стр. 3027-3039. SIAM, (2024)A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow., , , , , , , и . FOCS, стр. 503-514. IEEE, (2023)Fast Deterministic Fully Dynamic Distance Approximation., , и . FOCS, стр. 1011-1022. IEEE, (2022)Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary., , , , , , и . ICALP, том 229 из LIPIcs, стр. 20:1-20:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Faster maxflow via improved dynamic spectral vertex sparsifiers., , , , , , и . STOC, стр. 543-556. ACM, (2022)Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary., , , , , , и . CoRR, (2020)Deterministic Fully Dynamic SSSP and More., и . FOCS, стр. 2312-2321. IEEE, (2023)Nearly Optimal Communication and Query Complexity of Bipartite Matching., , , , и . FOCS, стр. 1174-1185. IEEE, (2022)