I am an Associate Professor at the Dipartimento di Ingegneria dell'Impresa "Mario Lucertini" of the University of Rome "Tor Vergata". I received my MSc in Mathematics in 2005 from the University of Rome "Tor Vergata" and my PhD in Computer Science from the University of L'Aquila in 2009. From 2009 to 2016 I was postdoc at the University of Salerno and Sapienza University of Rome. From 2016 to 2019 I was Assistant Professor at the University of Rome "Tor Vergata".
I coauthored more than forty papers appeared in international journals and conference proceedings, mostly in the area of Distributed Computing. My research interests are mainly focused on randomized algorithms and random structures. In 2017 I received the Italian Young Researcher Award from the Italian Chapter of the European Association for Theoretical Computer Science.
Publications
Journals
[1] A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. “Broadcasting in Dynamic Radio Networks”. In: Journal of Computer and System Sciences 75.4 (2009), pp. 213–230.
[2] A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. “Flooding Time of edge-Markovian Evolving Graphs”. In: SIAM Journal on Discrete Mathematics 24.4 (2010), pp. 1694–1712.
[3] A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. “Information Spread- ing in Stationary Markovian Evolving Graphs”. In: IEEE Transactions on Parallel and Distributed Systems 22.9 (2011), pp. 1425–1432.
[4] A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. “Optimal gossiping in geometric radio networks in the presence of dynamical faults”. In: Networks 59.3 (2012), pp. 289–298.
[5] C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet. “A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model”. In: Theoretical Computer Science 453 (2012), pp. 2–13.
[6] A. Clementi, F. Pasquale, and R. Silvestri. “Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power”. In: IEEE/ACM Transactions on Networking 21.2 (2013), pp. 610–620.
[7] V. Auletta, D. Ferraioli, F. Pasquale, and G. Persiano. “Mixing Time and Stationary Expected Social Welfare of Logit Dynamics”. In: Theory of Computing Systems 53.1 (2013), pp. 3–40.
[8] L. Becchetti, A. Clementi, F. Pasquale, G. Resta, P. Santi, and R. Silvestri. “Flooding Time in Opportunistic Networks under Power Law and Exponential Inter-Contact Times”. In: IEEE Transactions on Parallel and Distributed Systems 25.9 (2014), pp. 2297–2306.
[9] V. Auletta, D. Ferraioli, F. Pasquale, P. Penna, and G. Persiano. “Logit Dynamics with Concurrent Updates for Local Interaction Potential Games”. In: Algorithmica 73.3 (2015), pp. 511–546.
[10] A. Clementi, P. Crescenzi, C. Doerr, P. Fraigniaud, F. Pasquale, and R. Silvestri. “Rumor Spreading in Random Evolving Graphs”. In: Random Structures and Algorithms 48.2 (2016), pp. 290–312.
[11] V. Auletta, D. Ferraioli, F. Pasquale, P. Penna, and G. Persiano. “Con- vergence to Equilibrium of Logit Dynamics for Strategic Games”. In: Algorithmica 76.1 (2016), pp. 110–142.
[12] L. Becchetti, A. Clementi, E. Natale, F. Pasquale, R. Silvestri, and L. Trevisan. “Simple dynamics for plurality consensus”. In: Distributed Computing 30.4 (2017), pp. 293–306.
[13] V. Auletta, D. Ferraioli, F. Pasquale, and G. Persiano. “Metastability of Logit Dynamics for Coordination Games”. In: Algorithmica 80.11 (2018), pp. 3078–3131.
[14] F. Pasquale. “Randomness and Metastability in Game Theory and Distributed Computing”. In: Bulletin of EATCS 2.125 (2018).
[15] L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and G. Posta. “Self- stabilizing repeated balls-into-bins”. In: Distributed Computing 32.1 (2019), pp. 59–68.
[16] L Becchetti, A. Clementi, E. Natale, F. Pasquale, and L. Trevisan. "Find Your Place: Simple Distributed Algorithms for Community Detection". In: SIAM Journal on Computing, 49(4):821-864, 2020.
[17] L. Becchetti, E. Cruciani, F. Pasquale, and S. Rizzo. Step-by-step community detection in volume-regular graphs. In: Theoretical Computer Science, 847:49-67, 2020.
[18] A. Anagnostopoulos, L. Becchetti, E. Cruciani, F. Pasquale, and S. Rizzo. Biased opinion dynamics: when the devil is in the details. In: Information Sciences, 593:49-63, 2022.
[19] L. Becchetti, A. E. F. Clementi, F. Pasquale, L. Trevisan, I. Ziccardi. Expansion and flooding in dynamic random networks with node churn. In: Random Struct. Algorithms 63(1):61-101, 2023
Conference Proceedings
[20] A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. “Communication in Dynamic Radio Networks”. In: Proceedings of the 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’07). ACM, 2007, pp. 205–214.
[21] A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. “Optimal Gos- siping in Geometric Radio Networks in Presence of Dynamical Faults”. In: Proceedings of the 32nd International Symposium on Mathemat- ical Foundations of Computer Science (MFCS’07). Vol. 4708. LNCS. Springer, 2007, pp. 430–441.
[22] A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. “Flooding Time in edge-Markovian Dynamic Graphs”. In: Proceedings of the 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’08). ACM, 2008, pp. 213–222.
[23] A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. “Information Spread- ing in Stationary Markovian Evolving Graphs”. In: Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS’09). IEEE, 2009, pp. 1–12.
[24] A. Clementi, F. Pasquale, and R. Silvestri. “MANETS: High mobility can make up for low transmission power”. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP’09). Vol. 5556. LNCS. Springer, 2009, pp. 387–398.
[25] C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet. “A Note on Uniform Power Connectivity in the SINR Model”. In: Proceedings of the 5th Inter- national Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors’09). Vol. 5804. LNCS. Springer, 2009, pp. 116–127.
[26] V. Auletta, D. Ferraioli, F. Pasquale, and G. Persiano. “Mixing Time and Stationary Expected Social Welfare of Logit Dynamics”. In: Proceed- ings of the 3rd International Symposium on Algorithmic Game Theory (SAGT’10). Vol. 6386. LNCS. Springer, 2010, pp. 54–65.
[27] V. Auletta, D. Ferraioli, F. Pasquale, P. Penna, and G. Persiano. “Con- vergence to Equilibrium of Logit Dynamics for Strategic Games”. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’11). ACM, 2011, pp. 197–206.
[28] V. Auletta, D. Ferraioli, F. Pasquale, and G. Persiano. “Metastabil- ity of Logit Dynamics for Coordination Games”. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’12). SIAM, 2012, pp. 1006–1024.
[29] A. Clementi, P. Crescenzi, C. Doerr, P. Fraigniaud, M. Isopi, A. Pan- conesi, F. Pasquale, and R. Silvestri. “Rumor Spreading in Random Evolving Graphs”. In: Proceedings of the 21st European Symposium on Algorithms (ESA’13). Vol. 8125. LNCS. Springer, 2013, pp. 325–336.
[30] V. Auletta, D. Ferraioli, F. Pasquale, P. Penna, and G. Persiano. “Logit Dynamics with Concurrent Updates for Local Interaction Games”. In: Proceedings of the 21st European Symposium on Algorithms (ESA’13). Vol. 8125. LNCS. Springer, 2013, pp. 73–84.
[31] L. Becchetti, A. Clementi, E. Natale, F. Pasquale, R. Silvestri, and L. Tre- visan. “Simple Dynamics for Plurality Consensus”. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’14). ACM, 2014, pp. 247–256.
[32] L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and R. Silvestri. “Plu- rality Consensus in the Gossip Model”. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’15). SIAM, 2015, pp. 371– 390.
[33] L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and G. Posta. “Self- Stabilizing Repeated Balls-into-Bins”. In: Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’15). ACM, 2015, pp. 332–339.
[34] L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and L. Trevisan. “Sta- bilizing Consensus with Many Opinions”. In: Proceedings of the ACM- SIAM Symposium on Discrete Algorithms (SODA’16). SIAM, 2016, pp. 620–635.
[35] L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and L. Trevisan. “Find Your Place: Simple Distributed Algorithms for Community Detection”. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’17). SIAM, 2017, pp. 940–959.
[36] A. Clementi, L. Gualà, F. Pasquale, and G. Scornavacca. “Brief Announce- ment: On the Parallel Undecided-State Dynamics with Two Colors”. In: Proceedings of the 31st International Symposium on Distributed Com- puting (DISC’17). Vol. 91. LIPIcs-Leibniz International Proceedings in Informatics. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 2017.
[37] A. Clementi, M. Ghaffari, L. Gualà, E. Natale, F. Pasquale, and G. Scornavacca. “A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors”. In: Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS’18). Vol. 117. LIPIcs-Leibniz International Proceedings in Informatics. Schloss Dagstuhl- Leibniz-Zentrum fuer Informatik. 2018.
[38] L. Becchetti, A. Clementi, P. Manurangsi, E. Natale, F. Pasquale, P. Raghavendra, and L. Trevisan. “Average Whenever You Meet: Oppor- tunistic Protocols for Community Detection”. In: Proceedings of the 26th Annual European Symposium on Algorithms (ESA’18). Vol. 112. Leib- niz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl– Leibniz-Zentrum fuer Informatik, 2018, 7:1–7:13. doi: 10.4230/LIPIcs. ESA.2018.7.
[39] L. Becchetti, E. Cruciani, F. Pasquale, and S. Rizzo. “Step-By-Step Com- munity Detection in Volume-Regular Graphs”. In: Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC’19). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 2019.
[40] L. Becchetti, A. Clementi, E. Natale, F. Pasquale, and L. Trevisan. “Finding a bounded-degree expander inside a dense one”. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’20). SIAM. 2020, pp. 1320–1336.
[41] A. Clementi, L. Gualà, E. Natale, F. Pasquale, G. Scornavacca, and L. Trevisan. “Consensus vs Broadcast, with and without Noise”. In: Proceedings of the 11th Innovations in Theoretical Computer Science Conference (ITCS’20). Schloss Dagstuhl-Leibniz-Zentrum für Informatik. 2020.
[42] A. Anagnostopoulos, L. Becchetti, E. Cruciani, F. Pasquale, and S. Rizzo. Biased Opinion Dynamics: When the Devil is in the Details. In: Proceedings of the 29th Int. Joint Conference on Artificial Intelligence, (IJCAI'20), pp. 53-59. International Joint Conferences on Artificial Intelligence, 2020.
[43] L. Becchetti, A. E.F. Clementi, F. Pasquale, L. Trevisan, and I. Ziccardi. Expansion and Flooding in Dynamic Random Networks with Node Churn. In: Proceedings of the 41st IEEE International Conference on Distributed Computing Systems (ICDCS'21), pp. 976-986. IEEE, 2021.
[44] L. Becchetti, A. E.F. Clementi, R. Denni, F. Pasquale, L. Trevisan, and I. Ziccardi. Percolation and Epidemic Processes in One-Dimensional Small-World Networks. In: Proceedings of the 15th Latin American Theoretical Informatics Symposium (LATIN'22), pp. 476-492. Springer, 2022.
[45] A. Cruciani and F. Pasquale. Dynamic graph models inspired by the Bitcoin network-formation process. In Proceedings of the 24th International Conference On Distributed Computing And Networking (ICDCN'23), pp. 125-134. ACM, 2023.
Book Chapters
[46] A. Clementi and F. Pasquale. “Information Spreading in Dynamic Net- works: An Analytical Approach”. In: Theoretical Aspects of Distributed Computing in Sensor Networks. Ed. by S. Nikoletseas and J. D. Rolim. EATCS Monographs in Theoretical Computer Science. Springer, 2011, pp. 591–619.