| High-order entropy-compressed text indexes R Grossi, A Gupta, JS Vitter Society for Industrial and Applied Mathematics Philadelphia, 2003 | 1009 | 2003 |
| Compressed suffix arrays and suffix trees with applications to text indexing and string matching R Grossi, JS Vitter SIAM Journal on Computing 35 (2), 378-407, 2005 | 873* | 2005 |
| The string B-tree: A new data structure for string search in external memory and its applications P Ferragina, R Grossi Journal of the ACM (JACM) 46 (2), 236-280, 1999 | 464 | 1999 |
| Squeezing succinct data structures into entropy bounds K Sadakane, R Grossi Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 157 | 2006 |
| Optimal listing of cycles and st-paths in undirected graphs E Birmelé, R Ferreira, R Grossi, A Marino, N Pisanti, R Rizzi, G Sacomoto Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 119 | 2013 |
| When indexing equals compression: experiments with compressing suffix arrays and applications. R Grossi, A Gupta, JS Vitter SODA 4, 636-645, 2004 | 116 | 2004 |
| On sorting strings in external memory L Arge, P Ferragina, R Grossi, JS Vitter Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 111 | 1997 |
| Simple and efficient string matching with k mismatches R Grossi, F Luccio Information Processing Letters 33 (3), 113-120, 1989 | 97 | 1989 |
| D2K: scalable community detection in massive networks via small-diameter k-plexes A Conte, T De Matteis, D De Sensi, R Grossi, A Marino, L Versari Proceedings of the 24th ACM SIGKDD International Conference on Knowledge …, 2018 | 89 | 2018 |
| Suffix trees and their applications in string algorithms R Grossi, GF Italiano Proceedings of the 1st south American workshop on string processing, 57-76, 1993 | 85 | 1993 |
| Bases of motifs for generating repeated patterns with wild cards N Pisanti, M Crochemore, R Grossi, MF Sagot Computational Biology and Bioinformatics, IEEE/ACM Transactions on 2 (1), 40-50, 2005 | 83 | 2005 |
| On computing the diameter of real-world undirected graphs P Crescenzi, R Grossi, M Habib, L Lanzi, A Marino Theoretical Computer Science 514, 84-95, 2013 | 82 | 2013 |
| When indexing equals compression: Experiments with compressing suffix arrays and applications L Foschini, R Grossi, A Gupta, JS Vitter ACM Transactions on Algorithms (TALG) 2 (4), 611-639, 2006 | 79 | 2006 |
| Fast compressed tries through path decompositions R Grossi, G Ottaviano Journal of Experimental Algorithmics (JEA) 19, 1.1-1.20, 2015 | 75 | 2015 |
| Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques A Conte, R Grossi, A Marino, L Versari 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 74 | 2016 |
| On the size of succinct indices A Golynski, R Grossi, A Gupta, R Raman, SS Rao Algorithms–ESA 2007: 15th Annual European Symposium, Eilat, Israel, October …, 2007 | 72 | 2007 |
| IP address lookupmade fast and simple P Crescenzi, L Dardini, R Grossi Algorithms-ESA’99: 7th Annual European Symposium Prague, Czech Republic …, 1999 | 69 | 1999 |
| A fully-dynamic data structure for external substring search P Ferragina, R Grossi Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995 | 65 | 1995 |
| On searching compressed string collections cache-obliviously P Ferragina, R Grossi, A Gupta, R Shah, JS Vitter Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on …, 2008 | 63 | 2008 |
| Fast string searching in secondary storage: Theoretical developments and experimental results P Ferragina, R Grossi Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms …, 1996 | 62 | 1996 |
