Roberto Grossi

4.6k total citations
97 papers, 1.7k citations indexed

About

Roberto Grossi is a scholar working on Artificial Intelligence, Molecular Biology and Computational Theory and Mathematics. According to data from OpenAlex, Roberto Grossi has authored 97 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 75 papers in Artificial Intelligence, 43 papers in Molecular Biology and 31 papers in Computational Theory and Mathematics. Recurrent topics in Roberto Grossi's work include Algorithms and Data Compression (67 papers), DNA and Biological Computing (33 papers) and Network Packet Processing and Optimization (25 papers). Roberto Grossi is often cited by papers focused on Algorithms and Data Compression (67 papers), DNA and Biological Computing (33 papers) and Network Packet Processing and Optimization (25 papers). Roberto Grossi collaborates with scholars based in Italy, United States and France. Roberto Grossi's co-authors include Jeffrey Scott Vitter, Paolo Ferragina, Ankur Gupta, Kunihiko Sadakane, Giuseppe F. Italiano, Andrea Marino, Raffaele Giancarlo, Nadia Pisanti, Giuseppe Ottaviano and Alessio Conte and has published in prestigious journals such as Nature Communications, IEEE Access and BMC Bioinformatics.

In The Last Decade

Roberto Grossi

92 papers receiving 1.5k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Roberto Grossi Italy 20 1.4k 624 466 394 387 97 1.7k
Alberto Apostolico United States 25 1.8k 1.2× 1.1k 1.8× 407 0.9× 708 1.8× 219 0.6× 117 2.2k
Amihood Amir United States 26 1.5k 1.1× 782 1.3× 493 1.1× 712 1.8× 184 0.5× 159 1.9k
Venkatesh Raman India 22 970 0.7× 357 0.6× 201 0.4× 1.0k 2.6× 639 1.7× 111 1.9k
Gad M. Landau Israel 23 1.5k 1.1× 949 1.5× 489 1.0× 559 1.4× 168 0.4× 108 1.8k
Rajeev Raman United Kingdom 17 789 0.6× 223 0.4× 208 0.4× 319 0.8× 341 0.9× 67 1.1k
Wojciech Rytter Poland 24 1.2k 0.9× 471 0.8× 361 0.8× 902 2.3× 518 1.3× 152 1.9k
Shmuel T. Klein Israel 18 836 0.6× 140 0.2× 190 0.4× 185 0.5× 396 1.0× 116 1.1k
Ely Porat Israel 17 594 0.4× 270 0.4× 189 0.4× 258 0.7× 241 0.6× 100 874
Thomas G. Szymanski United States 18 1.0k 0.7× 388 0.6× 485 1.0× 504 1.3× 412 1.1× 42 1.8k
Moshe Lewenstein Israel 19 604 0.4× 350 0.6× 197 0.4× 494 1.3× 188 0.5× 64 1.0k

Countries citing papers authored by Roberto Grossi

Since Specialization
Citations

This map shows the geographic impact of Roberto Grossi'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 Roberto Grossi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Roberto Grossi more than expected).

Fields of papers citing papers by Roberto Grossi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Roberto Grossi. 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 Roberto Grossi. The network helps show where Roberto Grossi may publish in the future.

Co-authorship network of co-authors of Roberto Grossi

This figure shows the co-authorship network connecting the top 25 collaborators of Roberto Grossi. A scholar is included among the top collaborators of Roberto Grossi 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 Roberto Grossi. Roberto Grossi 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.
Chen, Huiping, et al.. (2024). On Breaking Truss-based and Core-based Communities. ACM Transactions on Knowledge Discovery from Data. 18(6). 1–43.
2.
Teramo, Antonella, Elena Ciabatti, Gianluca Schiavoni, et al.. (2022). Defining TCRγδ lymphoproliferative disorders by combined immunophenotypic and molecular evaluation. Nature Communications. 13(1). 3298–3298. 6 indexed citations
3.
Chen, Huiping, Alessio Conte, Roberto Grossi, et al.. (2021). Combinatorial Algorithms for String Sanitization. ArTS Archivio della ricerca di Trieste (University of Trieste https://www.units.it/). 3 indexed citations
4.
Versari, Luca, et al.. (2020). Zuckerli: A New Compressed Representation for Graphs. CINECA IRIS Institutial research information system (University of Pisa). 4 indexed citations
5.
Conte, Alessio, Daniele De Sensi, Roberto Grossi, Andrea Marino, & Luca Versari. (2020). Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs. IEEE Access. 8. 139096–139109. 8 indexed citations
6.
Alzamel, Mai, Roberto Grossi, Costas S. Iliopoulos, et al.. (2020). Comparing Degenerate Strings. Fundamenta Informaticae. 175(1-4). 41–58. 9 indexed citations
7.
Grossi, Roberto, et al.. (2019). On the Complexity of String Matching for Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 11 indexed citations
8.
Conte, Alessio, Roberto Grossi, Andrea Marino, Lorenzo Tattini, & Luca Versari. (2019). A fast discovery algorithm for large common connected induced subgraphs. Discrete Applied Mathematics. 268. 210–222. 1 indexed citations
9.
Grossi, Roberto, et al.. (2016). New bounds for approximating extremal distances in undirected graphs. Symposium on Discrete Algorithms. 1. 363–376. 6 indexed citations
10.
Grossi, Roberto, Fabrizio Sebastiani, & Fabrizio Silvestri. (2011). String processing and information retrieval : 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 7024. 1 indexed citations
11.
Sadakane, Kunihiko & Roberto Grossi. (2006). Squeezing succinct data structures into entropy bounds. Symposium on Discrete Algorithms. 1230–1239. 43 indexed citations
12.
Grossi, Roberto & Jeffrey Scott Vitter. (2005). Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching Read More: http://epubs.siam.org/doi/abs/10.1137/S0097539702402354. KU ScholarWorks (The University of Kansas). 225 indexed citations
13.
Grossi, Roberto, Ankur Gupta, & Jeffrey Scott Vitter. (2004). When indexing equals compression: experiments with compressing suffix arrays and applications. Symposium on Discrete Algorithms. 636–645. 38 indexed citations
14.
Grossi, Roberto, et al.. (2003). Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. Symposium on Discrete Algorithms. 670–678. 7 indexed citations
15.
Grossi, Roberto & Giuseppe F. Italiano. (2000). Revised version of ``Efficient Cross-Trees for External Memory''. UnipiEprints Open Archive (Università di Pisa). 2 indexed citations
16.
Grossi, Roberto & Giuseppe F. Italiano. (1999). Efficient techniques for maintaining multidimensional keys in linked data structures. CINECA IRIS Institutial research information system (University of Pisa). 8 indexed citations
17.
Ferragina, Paolo & Roberto Grossi. (1996). Fast string searching in secondary storage: theoretical developments and experimental results. Symposium on Discrete Algorithms. 373–382. 20 indexed citations
18.
Ferragina, Paolo & Roberto Grossi. (1995). Fast incremental text editing. Symposium on Discrete Algorithms. 531–540. 16 indexed citations
19.
Ferragina, Paolo & Roberto Grossi. (1995). A fully-dynamic data structure for external substring search (Extended Abstract).. 693–702. 1 indexed citations
20.
Grossi, Roberto & Giuseppe F. Italiano. (1993). Suffix trees and their applications in string algorithms. CINECA IRIS Institutial research information system (University of Pisa). 72(6). 57–76. 25 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

Breakdown of academic impact, for papers by Alberto Apostolico Breakdown of academic impact, for papers by Amihood Amir Breakdown of academic impact, for papers by Venkatesh Raman Breakdown of academic impact, for papers by Gad M. Landau Breakdown of academic impact, for papers by Rajeev Raman Breakdown of academic impact, for papers by Wojciech Rytter Breakdown of academic impact, for papers by Shmuel T. Klein Breakdown of academic impact, for papers by Ely Porat Breakdown of academic impact, for papers by Thomas G. Szymanski Breakdown of academic impact, for papers by Moshe Lewenstein
Rankless by CCL
2026