In this paper, we present a low-diameter decomposition algorithm in the ...
An orthogonal drawing is an embedding of a plane graph into a grid. In a...
We consider the massively parallel computation (MPC) model, which is a
t...
In theoretical computer science, it is a common practice to show existen...
In the LOCAL model, low-diameter decomposition is a useful tool in desig...
We consider the time and energy complexities of randomized leader electi...
Many combinatorial optimization problems can be approximated within (1 ±...
We study complexity classes of local problems on regular trees from the
...
We give practical, efficient algorithms that automatically determine the...
We introduce a new type of examples of bounded degree acyclic Borel grap...
We study connections between distributed local algorithms, finitary fact...
We consider the energy complexity of the leader election problem in the
...
Network decomposition is a central concept in the study of distributed g...
Much progress has recently been made in understanding the complexity
lan...
Recent research revealed the existence of gaps in the complexity landsca...
There is a recent exciting line of work in distributed graph algorithms ...
We consider a model of energy complexity in Radio Networks in which
tran...
We study the following algorithm synthesis question: given the descripti...
The semi-streaming model is a variant of the streaming model frequently ...
An (ϵ,ϕ)-expander decomposition of a graph G=(V,E) is a
clustering of th...
Consider a computer network that consists of a path with n nodes. The no...
We present improved distributed algorithms for triangle detection and it...
Energy efficiency is a critical issue for wireless devices operated unde...
Vertex coloring is one of the classic symmetry breaking problems studied...