• Publications
  • Influence
Concentration of Measure for the Analysis of Randomized Algorithms
This book presents a coherent and unified treatment of probabilistic techniques for obtaining high- probability estimates on the performance of randomized algorithms, covering the basic tool kit from the Chernoff-Hoeffding (CH) bounds to more sophisticated techniques like Martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities, and log-Sobolev inequalities. Expand
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds
Fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation and new techniques for proving upper bounds on the tail probabilities of certain random variables which are not stochastically independent are introduced. Expand
On compressing social networks
This work proposes simple combinatorial formulations that encapsulate efficient compressibility of graphs and shows that some of the problems are NP-hard yet admit effective heuristics, some of which can exploit properties of social networks such as link reciprocity. Expand
Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction
A simple heuristic is introduced and it is proved experimentally that is very fast and accurate and when compared with a dynamic programming of [8] it is much faster and also more accurate. Expand
Some simple distributed algorithms for sparse networks
It is shown that edge colourings with at most $2\Delta-1$ colours, and maximal matchings can be computed within deterministic rounds, where $\Delta$ is the maximum degree of the network. Expand
SoK: The Evolution of Sybil Defense via Social Networks
This paper surveys the evolution of sybil defense protocols that leverage the structural properties of the social graph underlying a distributed system to identify sybil identities and identifies a community detection algorithm that, for the first time, offers provable guarantees in the context of Sybil defense. Expand
On the Complexity of Distributed Network Decomposition
In this paper, we improve the bounds for computing a network decomposition distributively and deterministically. Our algorithm computes an (n?(n),n?(n))-decomposition innO(?(n))time, whereformula. AsExpand
Redoubtable Sensor Networks
In the context of wireless sensor networks where random predistribution of keys is employed, this work is the first to provide a mathematically precise proof, with a clear indication of parameter choice, that two crucial properties, connectivity via secure links and resilience against malicious attacks can be obtained simultaneously. Expand
Completeness in Approximation Classes
It is shown that the degree structure of NPO allows intermediate degrees, that is, if P≠NP, there are problems which are neither complete nor belong to a lower class, and natural approximation preserving reductions are defined. Expand