We consider the distributed complexity of the (degree+1)-list coloring
p...
In the study of radio networks, the tasks of broadcasting (propagating a...
Beeping models are models for networks of weak devices, such as sensor
n...
Graph coloring problems are arguably among the most fundamental graph
pr...
The Lovász Local Lemma is a classic result in probability theory that is...
We present a deterministic O(logloglog n)-round low-space Massively
Para...
In this note, we introduce a distributed twist on the classic coupon
col...
We study efficient distributed algorithms for the fundamental problem of...
We study the power and limitations of component-stable algorithms in the...
We investigate fast and communication-efficient algorithms for the class...
We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list
coloring p...
Existing approaches to cyber security and regulation in the automotive s...
Motivated by applications to distributed optimization and machine learni...
The Massively Parallel Computation (MPC) model is an emerging model whic...
We introduce a principled and theoretically sound spectral method for k-...
Radio networks are a long-studied model for distributed system of device...
Ad-hoc radio networks and multiple access channels are classical and
wel...