• Publications
  • Influence
Distributed verification and hardness of distributed approximation
TLDR
We study the verification problem in distributed networks, stated as follows. Expand
  • 255
  • 14
  • PDF
Using PageRank to Characterize Web Structure
TLDR
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
  • 127
  • 13
Efficient distributed approximation algorithms via probabilistic tree embeddings
TLDR
We present a uniform approach to design efficient distributed approximation algorithms for various fundamental network optimization problems. Expand
  • 62
  • 10
  • PDF
Distance Matrix Reconstruction from Incomplete Distance Information for Sensor Network Localization
TLDR
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
  • 71
  • 10
  • PDF
Building low-diameter peer-to-peer networks
TLDR
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
  • 160
  • 9
  • PDF
Improved random graph isomorphism
TLDR
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
  • 48
  • 9
  • PDF
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
TLDR
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
  • 104
  • 7
On the Complexity of Information Spreading in Dynamic Networks
TLDR
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
  • 69
  • 7
  • PDF
Building low-diameter P2P networks
TLDR
In a peer-to-peer (P2P) network, nodes connect into an existing network and participate in providing and availing of services. Expand
  • 223
  • 6
  • PDF
A fast distributed approximation algorithm for minimum spanning trees
TLDR
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
  • 106
  • 6
  • PDF