Alessandro Panconesi
Alessandro Panconesi
Computer Science - Sapienza, University of Rome
Verified email at - Homepage
Cited by
Cited by
Concentration of measure for the analysis of randomized algorithms
DP Dubhashi, A Panconesi
Cambridge University Press, 2009
On compressing social networks
F Chierichetti, R Kumar, S Lattanzi, M Mitzenmacher, A Panconesi, ...
Proceedings of the 15th ACM SIGKDD international conference on Knowledge …, 2009
Fast randomized algorithms for distributed edge coloring
A Panconesi, A Srinivasan
Proceedings of the eleventh annual ACM symposium on Principles of …, 1992
Localized protocols for ad hoc clustering and backbone formation: A performance comparison
S Basagni, M Mastrogiovanni, A Panconesi, C Petrioli
IEEE Transactions on Parallel and Distributed Systems 17 (4), 292-306, 2006
Rumor spreading in social networks
F Chierichetti, S Lattanzi, A Panconesi
Theoretical Computer Science 412 (24), 2602-2610, 2011
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
D Dubhashi, A Mei, A Panconesi, J Radhakrishnan, A Srinivasan
Journal of Computer and System Sciences 71 (4), 467-479, 2005
Sok: The evolution of sybil defense via social networks
L Alvisi, A Clement, A Epasto, S Lattanzi, A Panconesi
2013 ieee symposium on security and privacy, 382-396, 2013
On the distributed complexity of computing maximal matchings
M Hanckowiak, M Karonski, A Panconesi
SIAM Journal on Discrete Mathematics 15 (1), 41-57, 2001
Completeness in approximation classes
P Crescenzi, A Panconesi
Information and Computation 93 (2), 241-262, 1991
On the complexity of distributed network decomposition
A Panconesi, A Srinivasan
Journal of Algorithms 20 (2), 356-374, 1996
Some simple distributed algorithms for sparse networks
A Panconesi, R Rizzi
Distributed computing 14 (2), 97-100, 2001
Improved distributed algorithms for coloring and network decomposition problems
A Panconesi, A Srinivasan
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
Fast hare: A fast heuristic for single individual SNP haplotype reconstruction
A Panconesi, M Sozio
International workshop on algorithms in bioinformatics, 266-277, 2004
Almost tight bounds for rumour spreading with conductance
F Chierichetti, S Lattanzi, A Panconesi
Proceedings of the forty-second ACM symposium on Theory of computing, 399-408, 2010
Quantifiers and approximation
A Panconesi, D Ranjan
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds
D Grable, A Panconesi
Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms …, 0
Rumour spreading and graph conductance
F Chierichetti, S Lattanzi, A Panconesi
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
Redoubtable sensor networks
R Di Pietro, LV Mancini, A Mei, A Panconesi, J Radhakrishnan
ACM Transactions on Information and System Security (TISSEC) 11 (3), 1-22, 2008
On the Hardness of Approximating Max k-Cut and Its Dual.
V Kann, S Khanna, J Lagergren, A Panconesi
Kungliga Tekniska Högskolan. Institut för Numerisk Analys och Datalogi, 1995
An experimental analysis of simple, distributed vertex coloring algorithms
I Finocchi, A Panconesi, R Silvestri
Algorithmica 41 (1), 1-23, 2005
The system can't perform the operation now. Try again later.
Articles 1–20