Seguir
Alessandro Panconesi
Alessandro Panconesi
Computer Science - Sapienza, University of Rome
Dirección de correo verificada de di.uniroma1.it - Página principal
Título
Citado por
Citado por
Año
Concentration of measure for the analysis of randomized algorithms
DP Dubhashi, A Panconesi
Cambridge University Press, 2009
11352009
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
4062009
Fast randomized algorithms for distributed edge coloring
A Panconesi, A Srinivasan
Proceedings of the eleventh annual ACM symposium on Principles of …, 1992
364*1992
Rumor spreading in social networks
F Chierichetti, S Lattanzi, A Panconesi
Theoretical Computer Science 412 (24), 2602-2610, 2011
2252011
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
2132006
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
2062013
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
1952005
On the distributed complexity of computing maximal matchings
M Hanckowiak, M Karonski, A Panconesi
SIAM Journal on Discrete Mathematics 15 (1), 41-57, 2001
195*2001
Completeness in approximation classes
P Crescenzi, A Panconesi
Information and Computation 93 (2), 241-262, 1991
1941991
Some simple distributed algorithms for sparse networks
A Panconesi, R Rizzi
Distributed computing 14 (2), 97-100, 2001
1862001
On the complexity of distributed network decomposition
A Panconesi, A Srinivasan
Journal of Algorithms 20 (2), 356-374, 1996
1771996
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
1731992
Fast hare: A fast heuristic for single individual SNP haplotype reconstruction
A Panconesi, M Sozio
International workshop on algorithms in bioinformatics, 266-277, 2004
1502004
Quantifiers and approximation
A Panconesi, D Ranjan
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
1381990
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
1352010
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
119*
Rumour spreading and graph conductance
F Chierichetti, S Lattanzi, A Panconesi
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
1162010
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
1132008
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
1131995
Trace complexity of network inference
B Abrahao, F Chierichetti, R Kleinberg, A Panconesi
Proceedings of the 19th ACM SIGKDD international conference on Knowledge …, 2013
992013
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20