Andrea Clementi

3.0k total citations
70 papers, 975 citations indexed

About

Andrea Clementi is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Statistical and Nonlinear Physics. According to data from OpenAlex, Andrea Clementi has authored 70 papers receiving a total of 975 indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Computer Networks and Communications, 23 papers in Computational Theory and Mathematics and 11 papers in Statistical and Nonlinear Physics. Recurrent topics in Andrea Clementi's work include Mobile Ad Hoc Networks (25 papers), Opportunistic and Delay-Tolerant Networks (21 papers) and Cooperative Communication and Network Coding (17 papers). Andrea Clementi is often cited by papers focused on Mobile Ad Hoc Networks (25 papers), Opportunistic and Delay-Tolerant Networks (21 papers) and Cooperative Communication and Network Coding (17 papers). Andrea Clementi collaborates with scholars based in Italy, Switzerland and United States. Andrea Clementi's co-authors include Riccardo Silvestri, Angelo Monti, Francesco Pasquale, Luca Trevisan, Paolo Penna, Andrea Roli, Claudio Macci, Luca Becchetti, Emanuele Natale and Gianluca Del Rossi and has published in prestigious journals such as Journal of the ACM, IEEE/ACM Transactions on Networking and SIAM Journal on Computing.

In The Last Decade

Andrea Clementi

65 papers receiving 921 citations

Peers

Andrea Clementi
Andrea Clementi
Citations per year, relative to Andrea Clementi Andrea Clementi (= 1×) peers Arthur L. Liestman

Countries citing papers authored by Andrea Clementi

Since Specialization
Citations

This map shows the geographic impact of Andrea Clementi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andrea Clementi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrea Clementi more than expected).

Fields of papers citing papers by Andrea Clementi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andrea Clementi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andrea Clementi. The network helps show where Andrea Clementi may publish in the future.

Co-authorship network of co-authors of Andrea Clementi

This figure shows the co-authorship network connecting the top 25 collaborators of Andrea Clementi. A scholar is included among the top collaborators of Andrea Clementi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Andrea Clementi. Andrea Clementi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Clementi, Andrea, et al.. (2025). Maintaining k -MinHash Signatures over Fully-Dynamic Data Streams with Recovery. Cineca Institutional Research Information System (Tor Vergata University). 79–87. 1 indexed citations
2.
Becchetti, Luca, et al.. (2023). On the Role of Memory in Robust Opinion Dynamics. Cineca Institutional Research Information System (Tor Vergata University). 29–37. 3 indexed citations
3.
Clementi, Andrea, et al.. (2017). Rational Fair Consensus in the Gossip Model. Cineca Institutional Research Information System (Tor Vergata University). 1 indexed citations
4.
Becchetti, Luca, Andrea Clementi, Emanuele Natale, et al.. (2017). Friend or Foe? Population Protocols can perform Community Detection. arXiv (Cornell University). 1 indexed citations
5.
Becchetti, Luca, Andrea Clementi, Emanuele Natale, Francesco Pasquale, & Luca Trevisan. (2017). Find your place: simple distributed algorithms for community detection. Symposium on Discrete Algorithms. 940–959. 4 indexed citations
6.
Clementi, Andrea & Riccardo Silvestri. (2014). Parsimonious flooding in geometric random-walks. Journal of Computer and System Sciences. 81(1). 219–233. 3 indexed citations
7.
Becchetti, Luca, Andrea Clementi, Emanuele Natale, et al.. (2013). Simple Dynamics for Majority Consensus. arXiv (Cornell University). 1 indexed citations
8.
Becchetti, Luca, Andrea Clementi, Francesco Pasquale, et al.. (2011). Information Spreading in Opportunistic Networks is Fast. arXiv (Cornell University). 244(Pt 1). 151–159. 3 indexed citations
9.
Calamoneri, Tiziana, et al.. (2008). Minimum-Energy Broadcast and disk cover in grid wireless networks. Theoretical Computer Science. 399(1-2). 38–53. 3 indexed citations
10.
Clementi, Andrea, Claudio Macci, Angelo Monti, Francesco Pasquale, & Riccardo Silvestri. (2008). Flooding time in edge-Markovian dynamic graphs. Cineca Institutional Research Information System (Tor Vergata University). 213–222. 52 indexed citations
11.
Clementi, Andrea, et al.. (2007). On the bounded-hop MST problem on random Euclidean instances. Theoretical Computer Science. 384(2-3). 161–167. 4 indexed citations
12.
Ambühl, Christoph, Andrea Clementi, Paolo Penna, Gianluca Del Rossi, & Riccardo Silvestri. (2005). On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theoretical Computer Science. 343(1-2). 27–41. 7 indexed citations
13.
Clementi, Andrea, Angelo Monti, & Riccardo Silvestri. (2001). Selective families, superimposed codes, and broadcasting on unknown radio networks. Symposium on Discrete Algorithms. 709–718. 100 indexed citations
14.
Clementi, Andrea, Paolo Penna, & Riccardo Silvestri. (2000). On the power assignment problem in radio networks. Electronic colloquium on computational complexity. 7. 22 indexed citations
15.
Clementi, Andrea, Pierluigi Crescenzi, & Gianluca Del Rossi. (1999). On the complexity of approximating colored-graph problems. 281–290. 9 indexed citations
16.
Clementi, Andrea, Andrea Roli, & Luca Trevisan. (1998). Recent Advances Towards Proving P = BPP.. Bulletin of the European Association for Theoretical Computer Science. 64. 11 indexed citations
17.
Clementi, Andrea, et al.. (1997). Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs. Electronic colloquium on computational complexity. 4. 2 indexed citations
18.
Clementi, Andrea, et al.. (1996). Hitting Properties of Hard Boolean Operators and their Consequences on BPP. Electronic colloquium on computational complexity. 3. 5 indexed citations
19.
Clementi, Andrea & Luca Trevisan. (1996). Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints. Electronic colloquium on computational complexity. 3. 2 indexed citations
20.
Clementi, Andrea, et al.. (1994). Fast Parallel Arithmetic on Cellular Automata. Complex Systems. 8. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026