( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity of Distributed Splitting Problems.

, , , , и . PODC, стр. 280-289. ACM, (2019)

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.

Jara Uitto

Jara Fernández

Martin Jara

Jara Wanger

Alexander Jarasch

 

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

Efficient Load-Balancing through Distributed Token Dropping., , , , и . CoRR, (2020)Conditionally Optimal Parallel Coloring of Forests., , , , и . DISC, том 281 из LIPIcs, стр. 23:1-23:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation., , , , и . PODC, стр. 471-480. ACM, (2019)Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory., , и . Theor. Comput. Sci., (2021)Efficient CONGEST Algorithms for the Lovasz Local Lemma., и . CoRR, (2021)Optimal Deterministic Massively Parallel Connectivity on Forests., , , , и . CoRR, (2022)Deterministic (1+ε)-approximate maximum matching with poly(1/ε) passes in the semi-streaming model and beyond., , и . STOC, стр. 248-260. ACM, (2022)Massively Parallel Correlation Clustering in Bounded Arboricity Graphs., , , и . DISC, том 209 из LIPIcs, стр. 15:1-15:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Exponential Speedup over Locality in MPC with Optimal Memory., , , , , , и . DISC, том 246 из LIPIcs, стр. 9:1-9:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Navigating an Infinite Space with Unreliable Movements., и . SODA, стр. 1170-1179. SIAM, (2020)