World's Best Scientists 2026 revealed!
Andrea E. F. Clementi

Andrea E. F. Clementi

D-Index & Metrics

Computer Science

D-Index
31
Citations
3955
World Ranking
13693
National Ranking
499

Overview

Andrea E. F. Clementi is affiliated with the University of Rome Tor Vergata in Italy. Their research primarily spans the fields of Computer Science and Physics and Astronomy, with significant work in specialized subfields such as Statistical and Nonlinear Physics, Computer Networks and Communications, Mathematical Physics, Artificial Intelligence, and Computational Theory and Mathematics.

Their main topics of research cover Complex Network Analysis Techniques, Opinion Dynamics and Social Influence, Distributed Systems and Fault Tolerance, Stochastic Processes and Statistical Mechanics, Opportunistic and Delay-Tolerant Networks, Complexity and Algorithms in Graphs, and Quantum Many-Body Systems.

Among the recent papers authored or coauthored by Andrea E. F. Clementi are:

  • Consensus Dynamics, 2020, ACM SIGACT News
  • Find Your Place: Simple Distributed Algorithms for Community Detection, 2020, SIAM Journal on Computing
  • Phase Transition of a Nonlinear Opinion Dynamics with Noisy Interactions, 2022, Swarm Intelligence
  • Consensus vs Broadcast, with and Without Noise (Extended Abstract), 2020, arXiv (Cornell University)
  • Parallel Load Balancing on Constrained Client-Server Topologies, 2021, Theoretical Computer Science

The scientist frequently collaborates with a group of coauthors, including Luca Becchetti, Luca Trevisan, Francesco Pasquale, Emanuele Natale, and Isabella Ziccardi.

Andrea E. F. Clementi has published extensively in various venues, with notable recurring publications in:

  • arXiv (Cornell University)
  • Theoretical Computer Science
  • ACM SIGACT News
  • SIAM Journal on Computing
  • Random Structures and Algorithms

Best Publications

  • On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs

    Andrea E. F. Clementi;Pierluigi Crescenzi;Paolo Penna;Gianluca Rossi

  • On the power assignment problem in radio networks

    Andrea E. F. Clementi;Paolo Penna;Riccardo Silvestri

  • Selective families, superimposed codes, and broadcasting on unknown radio networks

    Andrea E. F. Clementi;Angelo Monti;Riccardo Silvestri

  • Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks

    Andrea E. F. Clementi;Paolo Penna;Riccardo Silvestri

  • Flooding Time of Edge-Markovian Evolving Graphs

    Andrea E. F. Clementi;Claudio Macci;Angelo Monti;Francesco Pasquale

  • Distributed broadcast in radio networks of unknown topology

    Andrea E. F. Clementi;Angelo Monti;Riccardo Silvestri

  • Flooding time in edge-Markovian dynamic graphs

    Andrea E.F. Clementi;Claudio Macci;Angelo Monti;Francesco Pasquale

  • Information spreading in stationary Markovian evolving graphs

    Andrea E.F. Clementi;Francesco Pasquale;Angelo Monti;Riccardo Silvestri

  • Information Spreading in Stationary Markovian Evolving Graphs

    A. Clementi;A. Monti;F. Pasquale;R. Silvestri

  • The Power Range Assignment Problem in Radio Networks on the Plane

    Andrea E. F. Clementi;Paolo Penna;Riccardo Silvestri

  • Weak random sources, hitting sets, and BPP simulations

    A.E. Andreev;A.E.F. Clementi;J.D.P. Rolim;L. Trevisan

  • Plurality consensus in the gossip model

    L. Becchetti;A. Clementi;E. Natale;F. Pasquale

  • Distributed multi-broadcast in unknown radio networks

    Andrea E. F. Clementi;Angelo Monti;Riccardo Silvestri

  • Round Robin is optimal for fault-tolerant broadcasting on wireless networks

    Andrea E. F. Clementi;Angelo Monti;Riccardo Silvestri

  • Information spreading in dynamic graphs

    Andrea Clementi;Riccardo Silvestri;Luca Trevisan

  • A new general derandomization method

    Alexander E. Andreev;Andrea E. F. Clementi;José D. P. Rolim

  • Information spreading in dynamic graphs

    Andrea Clementi;Riccardo Silvestri;Luca Trevisan

  • Improved non-approximability results for minimum vertex cover with density constraints

    Andrea E. F. Clementi

  • The Minimum Range Assignment Problem on Linear Radio Networks

    Andrea E. F. Clementi;Afonso Ferreira;Paolo Penna;Stephane Perennes

  • The minimum broadcast range assignment problem on linear multi-hop wireless networks

    Andrea E. F. Clementi;Miriam Di Ianni;Riccardo Silvestri

  • Stabilizing consensus with many opinions

    L. Becchetti;A. Clementi;E. Natale;F. Pasquale

  • Weak Random Sources, Hitting Sets, and BPP Simulations

    Alexander E. Andreev;Andrea E. F. Clementi;José D. P. Rolim;Luca Trevisan

  • Rumor Spreading in Random Evolving Graphs

    Andrea E. F. Clementi;Pierluigi Crescenzi;Carola Doerr;Pierre Fraigniaud

Frequent Co-Authors

Luca Trevisan
Luca Trevisan Bocconi University
Alexander E. Andreev
Alexander E. Andreev Institute of Physics
Pierluigi Crescenzi
Pierluigi Crescenzi Gran Sasso Science Institute
Pierre Fraigniaud
Pierre Fraigniaud Université Paris Cité
David Peleg
David Peleg Weizmann Institute of Science
Alessandro Panconesi
Alessandro Panconesi Sapienza University of Rome
Prasad Raghavendra
Prasad Raghavendra University of California, Berkeley

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a wide range of related fields and online study options. Learners interested in engineering might consider online mechanical engineering degrees, which offer flexible and affordable ways to develop in-demand technical skills.

For those drawn to scientific analysis and theory, you might wonder, can you get a physics degree online? Many accredited institutions now offer fully online physics programs, allowing you to deepen your knowledge from anywhere.

If your interests lean toward analytics or technology, you may ask, what is the cheapest data science course in the us? With smart research, you can find high-quality, affordable data science pathways that lead to rewarding tech careers.

Additionally, pursuing an online master’s in electrical engineering degree can prepare you for advanced roles in industries ranging from renewable energy to robotics. These online degree programs provide the flexibility and specialized skills needed to thrive in today's digital workforce.

Best Scientists Citing Andrea E. F. Clementi

Trending Scientists