A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
Milena Mihail, Christos H. Papadimitriou, Amin Sab...
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...