11 citations · 16 across the 4 of their papers we have counts for
9 papers · 1 filter
Optimal Deterministic Massively Parallel Connectivity on Forests
Alkida Balliu, Rustam Latypov, Yannic Maus +2
We show fast deterministic algorithms for fundamental problems on forests in the challenging low-space regime of the well-known Massive Parallel Computation (MPC) model. A recent b…
Efficient CONGEST Algorithms for the Lovasz Local Lemma
Yannic Maus, Jara Uitto
We present a poly time randomized CONGEST algorithm for a natural class of Lovasz Local Lemma (LLL) instances on constant degree graphs. This implies, among other thi…
Coloring Trees in Massively Parallel Computation
Rustam Latypov, Jara Uitto
We present time 3-coloring, maximal independent set and maximal matching algorithms for trees in the Massively Parallel Computation (MPC) model. Our algorithms a…
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs
Mélanie Cambus, Davin Choo, Havu Miikonen +1
Identifying clusters of similar elements in a set is a common task in data analysis. With the immense growth of data and physical limitations on single processor speed, it is neces…
Tight Bounds for Deterministic High-Dimensional Grid Exploration
Sebastian Brandt, Julian Portmann, Jara Uitto
We study the problem of exploring an oriented grid with autonomous agents governed by finite automata. In the case of a 2-dimensional grid, the question how many agents are require…
Efficient Load-Balancing through Distributed Token Dropping
Sebastian Brandt, Barbara Keller, Joel Rybicki +2
We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an e…