We show the first conditionally optimal deterministic algorithm for
3-co...
In this work, we present a constant-round algorithm for the 2-ruling set...
We present a deterministic algorithm for solving a wide range of dynamic...
In this paper, we present efficient distributed algorithms for classical...
We study the problem of finding connected components in the Adaptive
Mas...
We show fast deterministic algorithms for fundamental problems on forest...
Locally Checkable Labeling (LCL) problems are graph problems in which a
...
Grouping together similar elements in datasets is a common task in data
...
In this work, we develop the low-space Massively Parallel Computation (M...
We present a poly loglog n time randomized CONGEST algorithm for a
natur...
We present a deterministic (1+ε)-approximate maximum matching
algorithm ...
We present deterministic O(log^2 log n) time sublinear Massively Paralle...
Identifying clusters of similar elements in a set is a common objective ...
We study the problem of exploring an oriented grid with autonomous agent...
We introduce a new graph problem, the token dropping game, and we show h...
The Lovász Local Lemma (LLL) says that, given a set of bad events that
d...
We consider a search problem on a 2-dimensional infinite grid with a sin...
One of the fundamental open problems in the area of distributed graph
al...
We present a very simple randomized partitioning procedure for graph
col...
We introduce a method for sparsifying distributed algorithms and exhibit...
The Massively Parallel Computation (MPC) model serves as a common abstra...
Recently, studying fundamental graph problems in the Massive Parallel
Co...
Given two colorings of a graph, we consider the following problem: can w...
We present a deterministic distributed algorithm, in the LOCAL model, th...