We give simple, deterministic, distributed algorithms for computing maximal matchings,
maximal independent sets and colourings. We show that edge colourings with at most 2Δ-1 …

For over a decade now we have been witnessing the success of massive parallel
computation (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the …

We present distributed network algorithms to compute weighted and unweighted matchings
with improved approximation ratios and running times. The computational model is a …

We present a deterministic distributed algorithm that computes a (2Δ-1)-edge-coloring, or
even list-edge-coloring, in any n-node graph with maximum degree Δ, in O (log 8 Δ· log n) …

We present improved deterministic distributed algorithms for a number of well-studied
matching problems, which are simpler, faster, more accurate, and/or more general than their …

We provide new deterministic algorithms for the edge coloring problem, which is one of the
classic and highly studied distributed local symmetry breaking problems. As our main result …

We study distributed algorithms for the maximum matching problem in the CONGEST model,
where each message must be bounded in size. We give new deterministic upper bounds …

Wireless sensor networking continues to evolve as one of the most exciting and challenging
research areas of our time. Intrinsically, there are many applications of wireless sensor …

Abstract An (α, β)-ruling set of a graph G=(V, E) is a set R ⊆ V such that for any node v ∈ V
there is a node u ∈ R in distance at most β from v and such that any two nodes in R are at …

File swarming (or file sharing) is one of the most important applications in P2P networks. In
this paper, we propose a stochastic framework to analyze a file-swarming system under …