26 citations · 100 across the 29 of their papers we have counts for
5 papers · 1 filter
Conditionally Optimal Parallel Coloring of Forests
Christoph Grunau, Rustam Latypov, Yannic Maus +2
We show the first conditionally optimal deterministic algorithm for -coloring forests in the low-space massively parallel computation (MPC) model. Our algorithm runs in $O(\log…
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem
Mélanie Cambus, Fabian Kuhn, Shreyas Pai +1
In this work, we present a constant-round algorithm for the -ruling set problem in the Congested Clique model. As a direct consequence, we obtain a constant round algorithm in t…
Fast Dynamic Programming in Trees in the MPC Model
Chetan Gupta, Rustam Latypov, Yannic Maus +6
We present a deterministic algorithm for solving a wide range of dynamic programming problems in trees in rounds in the massively parallel computation model (MPC), with…
Distributed Symmetry Breaking on Power Graphs via Sparsification
Yannic Maus, Saku Peltonen, Jara Uitto
In this paper, we present efficient distributed algorithms for classical symmetry breaking problems, maximal independent sets (MIS) and ruling sets, in power graphs. We work in the…
Adaptive Massively Parallel Connectivity in Optimal Space
Rustam Latypov, Jakub Łącki, Yannic Maus +1
We study the problem of finding connected components in the Adaptive Massively Parallel Computation (AMPC) model. We show that when we require the total space to be linear in the s…