Obserwuj
andrea clementi
andrea clementi
Full Professor, Dipartimento di Ingegneria dell'Impresa, Università Tor Vergata, Roma
Zweryfikowany adres z mat.uniroma2.it
Tytuł
Cytowane przez
Cytowane przez
Rok
On the complexity of computing minimum energy consumption broadcast subgraphs
AEF Clementi, P Crescenzi, P Penna, G Rossi, P Vocca
Annual Symposium on Theoretical Aspects of Computer Science, 121-131, 2001
3022001
On the power assignment problem in radio networks
AEF Clementi, P Penna, R Silvestri
Mobile Networks and Applications 9 (2), 125-140, 2004
2402004
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
2402001
Hardness results for the power range assignment problem in packet radio networks
AEF Clementi, P Penna, R Silvestri
Randomization, Approximation, and Combinatorial Optimization. Algorithms and …, 1999
2291999
Distributed broadcast in radio networks of unknown topology
AEF Clementi, A Monti, R Silvestri
Theoretical Computer Science 302 (1-3), 337-364, 2003
1422003
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
1412008
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
1342009
The power range assignment problem in radio networks on the plane
AEF Clementi, P Penna, R Silvestri
Annual Symposium on Theoretical Aspects of Computer Science, 651-660, 2000
1102000
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
1042002
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
962010
Weak random sources, hitting sets, and BPP simulations
AE Andreev, AEF Clementi, JDP Rolim, L Trevisan
Proceedings 38th Annual Symposium on Foundations of Computer Science, 264-272, 1997
931997
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
782014
Information spreading in dynamic graphs
A Clementi, R Silvestri, L Trevisan
Distributed Computing 28 (1), 55-73, 2015
722015
Simple dynamics for plurality consensus
L Becchetti, A Clementi, E Natale, F Pasquale, R Silvestri, L Trevisan
Distributed Computing 30 (4), 293-306, 2017
702017
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
682004
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
652016
A new general derandomization method
AE Andreev, AEF Clementi, JDP Rolim
Journal of the ACM (JACM) 45 (1), 179-213, 1998
641998
Improved non-approximability results for minimum vertex cover with density constraints
AEF Clementi, L Trevisan
Theoretical Computer Science 225 (1-2), 113-128, 1999
611999
The minimum range assignment problem on linear radio networks
AEF Clementi, A Ferreira, P Penna, S Perennes, R Silvestri
European symposium on algorithms, 143-154, 2000
592000
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
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20