5 citations · 5 across the 2 of their papers we have counts for
3 papers
cs.DC2008
Distributed Averaging in the presence of a Sparse Cut
Hariharan Narayanan
We consider the question of averaging on a graph that has one sparse cut separating two subgraphs that are internally well connected. While there has been a large body of work devo…
cs.MA2006
Geographic Gossip on Geometric Random Graphs via Affine Combinations
Hariharan Narayanan
In recent times, a considerable amount of work has been devoted to the development and analysis of gossip algorithms in Geometric Random Graphs. In a recently introduced model term…
math.CO2005★ 5 cited
The computation of Kostka Numbers and Littlewood-Richardson Coefficients is #P-complete
Hariharan Narayanan
Kostka numbers and Littlewood-Richardson coefficients play an essential role in the representation theory of the symmetric groups and the special linear groups. There has been a si…