It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...