High-order entropy-compressed text indexes R Grossi, A Gupta, JS Vitter Society for Industrial and Applied Mathematics Philadelphia, 2003 | 934 | 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 | 825* | 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 | 438 | 1999 |

Squeezing succinct data structures into entropy bounds K Sadakane, R Grossi SODA 6, 1230-1239, 2006 | 150 | 2006 |

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 | 105 | 1997 |

When indexing equals compression: experiments with compressing suffix arrays and applications. R Grossi, A Gupta, JS Vitter SODA 4, 636-645, 2004 | 103 | 2004 |

Simple and efficient string matching with k mismatches R Grossi, F Luccio Information Processing Letters 33 (3), 113-120, 1989 | 93 | 1989 |

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 | 90 | 2013 |

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 | 84 | 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 | 80 | 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 | 79 | 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 | 77 | 2006 |

On the size of succinct indices A Golynski, R Grossi, A Gupta, R Raman, SS Rao European Symposium on Algorithms, 371-382, 2007 | 76 | 2007 |

IP address lookupmade fast and simple P Crescenzi, L Dardini, R Grossi European Symposium on Algorithms, 65-76, 1999 | 69 | 1999 |

Fast compressed tries through path decompositions R Grossi, G Ottaviano Journal of Experimental Algorithmics (JEA) 19, 1.1-1.20, 2015 | 63 | 2015 |

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 | 61 | 1995 |

Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. P Ferragina, R Grossi SODA 96, 373-382, 1996 | 60 | 1996 |

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 | 58 | 2016 |

More haste, less waste: Lowering the redundancy in fully indexable dictionaries R Grossi, A Orlandi, R Raman, SS Rao arXiv preprint arXiv:0902.2648, 2009 | 55 | 2009 |

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 | 55 | 2008 |