Share This Author
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.
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds
- A. Panconesi, A. Srinivasan
- Computer Science, MathematicsSIAM journal on computing (Print)
- 1 April 1997
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.
On compressing social networks
- Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, M. Mitzenmacher, A. Panconesi, P. Raghavan
- Computer ScienceKnowledge Discovery and Data Mining
- 28 June 2009
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.
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.
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  it is much faster and also more accurate.
SoK: The Evolution of Sybil Defense via Social Networks
- L. Alvisi, Allen Clement, Alessandro Epasto, Silvio Lattanzi, A. Panconesi
- Computer ScienceIEEE Symposium on Security and Privacy
- 19 May 2013
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.
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. As…
Improved distributed algorithms for coloring and network decomposition problems
- A. Panconesi, A. Srinivasan
- Computer Science, MathematicsSymposium on the Theory of Computing
- 1 July 1992
It is shown that A-coloring G is reducible in 0(log3 n/log A) time to (A+ I)-vertex coloring G in a distributed model, which leads to fast distributed algorithms, and a linear–processor NC algorithm, for Acoloring.
Concentration of Measure for the Analysis of Randomized Algorithms: Contents