2026 Andrea E. F. Clementi: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	31	13690	13276	499	495	163	3955

Andrea E. F. Clementi publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Andrea E. F. Clementi sits on this spectrum.

32 publications 991+

This scientist: 163 publications — 32nd percentile

32% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Andrea E. F. Clementi D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Andrea E. F. Clementi sits on this spectrum.

30 D-Index 131+

This scientist: 31 D-Index — 6th percentile

6% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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

303
Citations
On the power assignment problem in radio networks

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

281
Citations
Selective families, superimposed codes, and broadcasting on unknown radio networks

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

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

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

228
Citations
Flooding Time of Edge-Markovian Evolving Graphs

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

187
Citations
Distributed broadcast in radio networks of unknown topology

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

153
Citations
Flooding time in edge-Markovian dynamic graphs

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

150
Citations
Information spreading in stationary Markovian evolving graphs

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

134
Citations
Information Spreading in Stationary Markovian Evolving Graphs

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

112
Citations
The Power Range Assignment Problem in Radio Networks on the Plane

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

109
Citations
Weak random sources, hitting sets, and BPP simulations

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

95
Citations
Plurality consensus in the gossip model

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

89
Citations
Distributed multi-broadcast in unknown radio networks

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

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

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

83
Citations
Information spreading in dynamic graphs

Andrea Clementi;Riccardo Silvestri;Luca Trevisan

73
Citations
A new general derandomization method

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

72
Citations
Information spreading in dynamic graphs

Andrea Clementi;Riccardo Silvestri;Luca Trevisan

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

Andrea E. F. Clementi

65
Citations
The Minimum Range Assignment Problem on Linear Radio Networks

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

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

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

59
Citations
Stabilizing consensus with many opinions

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

56
Citations
Weak Random Sources, Hitting Sets, and BPP Simulations

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

45
Citations
Rumor Spreading in Random Evolving Graphs

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

30
Citations

Frequent Co-Authors

Luca Trevisan Bocconi University

Alexander E. Andreev Institute of Physics

Pierluigi Crescenzi Gran Sasso Science Institute

Paolo Santi MIT

Pierre Fraigniaud Université Paris Cité

David Peleg Weizmann Institute of Science

Alessandro Panconesi Sapienza University of Rome

Mohsen Ghaffari MIT

Prasad Raghavendra University of California, Berkeley

External Links

Personal website of Andrea E. F. Clementi

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

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.