Travelled to:
1 × Canada
1 × China
1 × France
1 × Greece
3 × USA
Collaborated with:
F.Chierichetti S.Lattanzi A.Srinivasan D.Ranjan P.Raghavan B.D.Abrahao R.Kleinberg R.Kumar M.Mitzenmacher M.Sozio A.Tiberi E.Upfal
Talks about:
network (4) spread (2) social (2) decomposit (1) distribut (1) algorithm (1) quantifi (1) neighbor (1) compress (1) approxim (1)
Person: Alessandro Panconesi
DBLP: Panconesi:Alessandro
Contributed to:
Wrote 7 papers:
- KDD-2013-AbrahaoCKP #complexity #network
- Trace complexity of network inference (BDA, FC, RK, AP), pp. 491–499.
- STOC-2010-ChierichettiLP #bound
- Almost tight bounds for rumour spreading with conductance (FC, SL, AP), pp. 399–408.
- ICALP-v2-2009-ChierichettiLP #network #social
- Rumor Spreading in Social Networks (FC, SL, AP), pp. 375–386.
- KDD-2009-ChierichettiKLMPR #network #on the #social
- On compressing social networks (FC, RK, SL, MM, AP, PR), pp. 219–228.
- PODS-2007-ChierichettiPRSTU #clustering
- Finding near neighbors through cluster pruning (FC, AP, PR, MS, AT, EU), pp. 103–112.
- STOC-1992-PanconesiS #algorithm #composition #distributed #network #problem
- Improved Distributed Algorithms for Coloring and Network Decomposition Problems (AP, AS), pp. 581–592.
- STOC-1990-PanconesiR #approximate #quantifier
- Quantifiers and Approximation (AP, DR), pp. 446–456.