Follow
andrea clementi
andrea clementi
Full Professor, Dipartimento di Ingegneria dell'Impresa, Università Tor Vergata, Roma
Verified email at mat.uniroma2.it
Title
Cited by
Cited by
Year
On the complexity of computing minimum energy consumption broadcast subgraphs
AEF Clementi, P Crescenzi, P Penna, G Rossi, P Vocca
STACS 2001: 18th Annual Symposium on Theoretical Aspects of Computer Science …, 2001
3022001
Selective families, superimposed codes, and broadcasting on unknown radio networks
AEF Clementi, A Monti, R Silvestri
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001
2602001
On the power assignment problem in radio networks
AEF Clementi, P Penna, R Silvestri
Mobile Networks and Applications 9, 125-140, 2004
2412004
Hardness results for the power range assignment problem in packet radio networks
AEF Clementi, P Penna, R Silvestri
International Workshop on Randomization and Approximation Techniques in …, 1999
2251999
Distributed broadcast in radio networks of unknown topology
AEF Clementi, A Monti, R Silvestri
Theoretical Computer Science 302 (1-3), 337-364, 2003
1532003
Flooding time in edge-markovian dynamic graphs
AEF Clementi, C Macci, A Monti, F Pasquale, R Silvestri
Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008
1522008
Information spreading in stationary markovian evolving graphs
AEF Clementi, F Pasquale, A Monti, R Silvestri
2009 IEEE International Symposium on Parallel & Distributed Processing, 1-12, 2009
1362009
The power range assignment problem in radio networks on the plane
AEF Clementi, P Penna, R Silvestri
STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science …, 2000
1082000
Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks
AEF Clementi, G Huiban, P Penna, G Rossi, YC Verhoeven
Proceedings of the 3rd Workshop on Approximation and Randomization …, 2002
1062002
Weak random sources, hitting sets, and BPP simulations
AE Andreev, AEF Clementi, JDP Rolim, L Trevisan
SIAM Journal on Computing 28 (6), 2103-2116, 1999
1021999
Flooding time of edge-markovian evolving graphs
AEF Clementi, C Macci, A Monti, F Pasquale, R Silvestri
SIAM journal on discrete mathematics 24 (4), 1694-1712, 2010
1012010
Plurality consensus in the gossip model
L Becchetti, A Clementi, E Natale, F Pasquale, R Silvestri
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
902014
Stabilizing consensus with many opinions
L Becchetti, A Clementi, E Natale, F Pasquale, L Trevisan
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
882016
Simple dynamics for plurality consensus
L Becchetti, A Clementi, E Natale, F Pasquale, R Silvestri, L Trevisan
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and …, 2014
832014
Information spreading in dynamic graphs
A Clementi, R Silvestri, L Trevisan
Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012
782012
A new general derandomization method
AE Andreev, AEF Clementi, JDP Rolim
Journal of the ACM (JACM) 45 (1), 179-213, 1998
701998
Round robin is optimal for fault-tolerant broadcasting on wireless networks
AEF Clementi, A Monti, R Silvestri
Journal of Parallel and Distributed Computing 64 (1), 89-96, 2004
672004
Improved non-approximability results for minimum vertex cover with density constraints
AEF Clementi, L Trevisan
Theoretical Computer Science 225 (1-2), 113-128, 1999
641999
The minimum range assignment problem on linear radio networks
AEF Clementi, A Ferreira, P Penna, S Perennes, R Silvestri
Algorithms-ESA 2000: 8th Annual European Symposium Saarbrücken, Germany …, 2000
582000
The minimum broadcast range assignment problem on linear multi-hop wireless networks
AEF Clementi, M Di Ianni, R Silvestri
Theoretical Computer Science 299 (1-3), 751-761, 2003
572003
The system can't perform the operation now. Try again later.
Articles 1–20