4 citations · 5 across the 2 of their papers we have counts for
2 papers
math.PR2009★ 1 cited
Belief propagation : an asymptotically optimal algorithm for the random assignment problem
Justin Salez, Devavrat Shah
The random assignment problem asks for the minimum-cost perfect matching in the complete bipartite graph $\Knn$ with i.i.d. edge weights, say uniform on . In a r…
cs.NI2005★ 4 cited
Fast Distributed Algorithms for Computing Separable Functions
Damon Mosk-Aoyama, Devavrat Shah
The problem of computing functions of values at the nodes in a network in a totally distributed manner, where nodes do not have unique identities and make decisions based only on l…