
Deterministic (1+Ξ΅)Approximate Maximum Matching with πππ π(1/Ξ΅) Passes in the SemiStreaming Model
We present a deterministic (1+Ξ΅)approximate maximum matching algorithm ...
read it

Deterministic 3Coloring of Trees in the Sublinear MPC model
We present deterministic O(log^2 log n) time sublinear Massively Paralle...
read it

Massively Parallel Correlation Clustering in Bounded Arboricity Graphs
Identifying clusters of similar elements in a set is a common objective ...
read it

Tight Bounds for Deterministic HighDimensional Grid Exploration
We study the problem of exploring an oriented grid with autonomous agent...
read it

Efficient LoadBalancing through Distributed Token Dropping
We introduce a new graph problem, the token dropping game, and we show h...
read it

A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovasz Local Lemma
The LovΓ‘sz Local Lemma (LLL) says that, given a set of bad events that d...
read it

Navigating an Infinite Space with Unreliable Movements
We consider a search problem on a 2dimensional infinite grid with a sin...
read it

On the Complexity of Distributed Splitting Problems
One of the fundamental open problems in the area of distributed graph al...
read it

Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation
We present a very simple randomized partitioning procedure for graph col...
read it

Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
We introduce a method for sparsifying distributed algorithms and exhibit...
read it

Matching and MIS for Uniformly Sparse Graphs in the LowMemory MPC Model
The Massively Parallel Computation (MPC) model serves as a common abstra...
read it

Breaking the LinearMemory Barrier in MPC: Fast MIS on Trees with n^ Memory per Machine
Recently, studying fundamental graph problems in the Massive Parallel Co...
read it

Distributed Recoloring
Given two colorings of a graph, we consider the following problem: can w...
read it

Deterministic Distributed EdgeColoring with Fewer Colors
We present a deterministic distributed algorithm, in the LOCAL model, th...
read it
Jara Uitto
is this you? claim profile