We show how to efficiently construct a small probability space on n binary random variables
such that for every subset, its parity is either zero or one with" almost" equal probability. They …

Pseudorandom generators are constructed which convert O (SlogR) truly random bits to R
bits that appear random to any algorithm that runs in SPACE (S). In particular, any …

Chernoff–Hoeffding (CH) bounds are fundamental tools used in bounding the tail
probabilities of the sums of bounded and independent random variables (rv's). We present a …

Certain types of routing, scheduling, and resource-allocation problems in a distributed
setting can be modeled as edge-coloring problems. We present fast and simple randomized …

Vizing's celebrated theorem states that every simple graph with maximum degree Δ admits a
(Δ+ 1) edge coloring which can be found in O (m· n) time on n-vertex m-edge graphs. This is …

A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is
exactly d. By Hall's theorem, one can represent such a multigraph as a combination of at …

Recent papers have addressed different variants of the (Δ+ 1)-edge-colouring problem by
concatenating or gluing together many Vizing chains to form what Bernshteyn coined multi …

The ubiquitous deployment of 5G New Radio (5G NR) accelerates the evolution in many
fields. With the enhancement of 5G NR, unmanned aerial vehicle (UAV) swarm networking …

We show that maximal matchings can be computed deterministically in O (log4 n) rounds in
the synchronous, message-passing model of computation. This is one of the very few cases …

In this paper, we improve the bounds for computing a network decomposition distributively
and deterministically. Our algorithm computes an (nϵ (n), nϵ (n))-decomposition innO (ϵ …