We present a new approach for solving (minimum disagreement) correlation clustering that
results in sublinear algorithms with highly efficient time and space complexity for this …

We present a new approach to randomized distributed graph coloring that is simpler and
more efficient than previous ones. In particular, it allows us to tackle the (deg+ 1)-list-coloring …

A streaming algorithm is considered to be adversarially robust if it provides correct outputs
with high probability even when the stream updates are chosen by an adversary who may …

Every graph with maximum degree Δ can be colored with (Δ+ 1) colors using a simple
greedy algorithm. Remarkably, recent work has shown that one can find such a coloring …

Distributed vertex coloring is one of the classic problems and probably also the most widely
studied problems in the area of distributed graph algorithms. We present a new randomized …

Graph coloring is a fundamental problem with wide reaching applications in various areas
including ata mining and databases, eg, in parallel query optimization. In recent years, there …

We present a new technique to efficiently sample and communicate a large number of
elements from a distributed sampling space. When used in the context of a recent Local …

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 …

We prove that for $ n\in\mathbb N $ and an absolute constant $ C $, if $ p\geq C\log^ 2 n/n $
and $ L_ {i, j}\subseteq [n] $ is a random subset of $[n] $ where each $ k\in [n] $ is included …

The celebrated palette sparsification result of [Assadi, Chen, and Khanna SODA'19] shows
that to compute a Δ+ 1 coloring of the graph, where Δ denotes the maximum degree, it …