( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Faster Cut Sparsification of Weighted Graphs.

, и . ICALP, том 229 из LIPIcs, стр. 61:1-61:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Sebastian Förster

Karina Förster

Mechanismen des rezeptorvermittelten Myokardschutzes nach akutem Herzinfarkt: Beteiligung von Adenosin-, _d63-Opioidrezeptoren delta-Opioidrezeptoren und GSK-3β GSK-3beta. Uni Greifswald, (2009)

Christian Förster

Thomas Förster

Martin Förster

 

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

Minor Sparsifiers and the Distributed Laplacian Paradigm., , , , , и . CoRR, (2020)Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models., , , и . SIAM J. Comput., 50 (3): 815-856 (2021)Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications., , и . SODA, стр. 1226-1245. SIAM, (2021)Faster Cut Sparsification of Weighted Graphs., и . ICALP, том 229 из LIPIcs, стр. 61:1-61:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Minor Sparsifiers and the Distributed Laplacian Paradigm., , , , , и . FOCS, стр. 989-999. IEEE, (2021)Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms., , , , и . SODA, стр. 2046-2065. SIAM, (2020)Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch., , и . STOC, стр. 1173-1186. ACM, (2023)Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique., и . PODC, стр. 75-78. ACM, (2023)A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching., , и . CoRR, (2018)Dynamic algorithms for k-center on graphs., , , , и . SODA, стр. 3441-3462. SIAM, (2024)