Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Time-varying graphs and dynamic networks
2012258 citationsPaola Flocchini, Nicola Santoro et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Nicola Santoro
Since
Specialization
Citations
This map shows the geographic impact of Nicola Santoro'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 Nicola Santoro with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nicola Santoro more than expected).
This network shows the impact of papers produced by Nicola Santoro. 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 Nicola Santoro. The network helps show where Nicola Santoro may publish in the future.
Co-authorship network of co-authors of Nicola Santoro
This figure shows the co-authorship network connecting the top 25 collaborators of Nicola Santoro.
A scholar is included among the top collaborators of Nicola Santoro 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 Nicola Santoro. Nicola Santoro is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Luna, Giuseppe Antonio Di, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, & Giovanni Viglietta. (2018). Line recovery by programmable particles. CINECA IRIS Institutial research information system (University of Pisa).8 indexed citations
3.
Luna, Giuseppe Antonio Di, Stefan Dobrev, Paola Flocchini, & Nicola Santoro. (2016). Live Exploration of Dynamic Rings. IRIS Research product catalog (Sapienza University of Rome).9 indexed citations
4.
Luna, Giuseppe Antonio Di, Paola Flocchini, Federico Poloni, Nicola Santoro, & Giovanni Viglietta. (2014). The Mutual Visibility Problem for Oblivious Robots. CINECA IRIS Institutial research information system (University of Pisa). 348–354.15 indexed citations
5.
Flocchini, Paola, Giuseppe Prencipe, & Nicola Santoro. (2008). Self-deployment of mobile sensors on a ring. Theoretical Computer Science. 402(1). 67–80.48 indexed citations
6.
Dobrev, Stefan, Rastislav Kráľovič, Nicola Santoro, & Wei Shi. (2006). Black hole search in asynchronous rings using tokens.
7.
Santoro, Nicola. (2006). Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing). Wiley-Interscience eBooks.11 indexed citations
8.
Dobrev, Stefan, Paola Flocchini, Giuseppe Prencipe, & Nicola Santoro. (2004). Optimal Mobile Agent Protocols for Searching a Black Hole in Arbitrary Networks. UnipiEprints Open Archive (Università di Pisa).1 indexed citations
Barrière, Lali, Paola Flocchini, Pierre Fraigniaud, & Nicola Santoro. (2003). Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.. 17–32.4 indexed citations
11.
Dobrev, Stefan, Paola Flocchini, Rastislav Kráľovič, et al.. (2002). BLACK HOLE SEARCH BY MOBILE AGENTS IN HYPERCUBES AND RELATED NETWORKS. 169–180.4 indexed citations
12.
Flocchini, Paola, Giuseppe Prencipe, Nicola Santoro, & Peter Widmayer. (2001). Pattern Formation by Anonymous Robots Without Chirality.. 147–162.
13.
Zeh, Norbert & Nicola Santoro. (2001). On Finding Minimum Deadly Sets for Directed Networks.. 351–366.1 indexed citations
Flocchini, Paola, Elena Lodi, Fabrizio Luccio, Linda Pagli, & Nicola Santoro. (1999). Monotone Dynamos in Tori.. 152–165.9 indexed citations
16.
Bodlaender, Hans L., Gérard Tel, & Nicola Santoro. (1994). Trade-offs in non-reversing diameter. Utrecht University Repository (Utrecht University). 1(1). 111–134.17 indexed citations
17.
Dehne, Frank, Jörg-Rüdiger Sack, & Nicola Santoro. (1989). Algorithms and data structures : Workshop WADS '89, Ottawa, Canada, August 17-19, 1989 : proceedings. Springer eBooks.2 indexed citations
18.
Otoo, Ekow, Nicola Santoro, & Doron Rotem. (1987). Improving Semi-Join Evaluation in Distributed Query Processing.. International Conference on Distributed Computing Systems. 554–561.6 indexed citations
19.
Probert, Robert L., Michael J. Fischer, & Nicola Santoro. (1982). Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing.3 indexed citations
20.
Santoro, Nicola, et al.. (1979). Distributed Control of Updates in Multiple-Copy Databases: A Time Optimal Algorithm.. 191.6 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.