Gopal Pandurangan

Publications
Influence

Distributed verification and hardness of distributed approximation

A. D. Sarma, Stephan Holzer, +5 authors Roger Wattenhofer
Computer Science
STOC '11
12 November 2010

We study the verification problem in distributed networks, stated as follows. Expand

Using PageRank to Characterize Web Structure

Gopal Pandurangan, P. Raghavan, E. Upfal
Computer Science
COCOON
15 August 2002

We show that PageRank values on the Web follow a power law and develop detailed models for the Web graph that explain this observation, and moreover remain faithful to previously studied degree distributions. Expand

Efficient distributed approximation algorithms via probabilistic tree embeddings

M. Khan, F. Kuhn, D. Malkhi, Gopal Pandurangan, Kunal Talwar
Computer Science
Distributed Computing
28 January 2012

We present a uniform approach to design efficient distributed approximation algorithms for various fundamental network optimization problems. Expand

Distance Matrix Reconstruction from Incomplete Distance Information for Sensor Network Localization

Petros Drineas, M. Magdon-Ismail, Gopal Pandurangan, Reino Virrankoski, A. Savvides
Computer Science
3rd Annual IEEE Communications Society on Sensor…
2006

We address an important issue in node localization by showing that a highly incomplete set of inter-node distance measurements obtained in ad-hoc node deployments carries sufficient information for the accurate reconstruction of the missing distances, even in the presence of noise and sensor node failures. Expand

Building low-diameter peer-to-peer networks

Gopal Pandurangan, P. Raghavan, E. Upfal
Computer Science
IEEE J. Sel. Areas Commun.
4 August 2003

We propose a protocol for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. Expand

Improved random graph isomorphism

T. Czajka, Gopal Pandurangan
Mathematics, Computer Science
J. Discrete Algorithms
1 March 2008

We give a simple, linear time, high probability algorithm for the canonical labeling of a G(n,p) random graph for p@?[@w(ln^4n/nlnlnn). Expand

Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis

J. Chen, Gopal Pandurangan, D. Xu
Computer Science
24 April 2005

A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. Expand

On the Complexity of Information Spreading in Dynamic Networks

C. Dutta, Gopal Pandurangan, R. Rajaraman, Zhifeng Sun, E. Viola
Computer Science
SODA
6 January 2013

We show that Ω(nk/log n + n) rounds are needed for any randomized (centralized or distributed) token-forwarding algorithm to disseminate the k tokens, thus resolving an open problem raised in [KLO10]. Expand

Building low-diameter P2P networks

Gopal Pandurangan, P. Raghavan, E. Upfal
Computer Science
Proceedings IEEE International Conference on…
14 October 2001

In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. Expand

A fast distributed approximation algorithm for minimum spanning trees

M. Khan, Gopal Pandurangan
Mathematics, Computer Science
Distributed Computing
1 April 2008

We present a distributed algorithm that constructs an O(log n)-approximate minimum spanning tree (MST) in any arbitrary network in almost optimal Õ(D(G)) time. Expand

Recommended Authors