| 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 | 302 | 2001 |
| 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 | 260 | 2001 |
| On the power assignment problem in radio networks AEF Clementi, P Penna, R Silvestri Mobile Networks and Applications 9, 125-140, 2004 | 240 | 2004 |
| 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 | 225 | 1999 |
| Distributed broadcast in radio networks of unknown topology AEF Clementi, A Monti, R Silvestri Theoretical Computer Science 302 (1-3), 337-364, 2003 | 153 | 2003 |
| 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 | 152 | 2008 |
| 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 | 136 | 2009 |
| 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 | 108 | 2000 |
| 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 | 106 | 2002 |
| 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 | 101 | 2010 |
| 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 | 101 | 1999 |
| 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 | 89 | 2014 |
| 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 | 87 | 2016 |
| 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 | 82 | 2014 |
| Information spreading in dynamic graphs A Clementi, R Silvestri, L Trevisan Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012 | 78 | 2012 |
| 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 | 67 | 2004 |
| A new general derandomization method AE Andreev, AEF Clementi, JDP Rolim Journal of the ACM (JACM) 45 (1), 179-213, 1998 | 67 | 1998 |
| Improved non-approximability results for minimum vertex cover with density constraints AEF Clementi, L Trevisan Theoretical Computer Science 225 (1-2), 113-128, 1999 | 64 | 1999 |
| 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 | 58 | 2000 |
| 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 | 57 | 2003 |
Paolo PennaIOGEmail verificata su iohk.io
