Roberto Grossi
Roberto Grossi
Professor of Computer Science, University of Pisa, Italy
Verified email at - Homepage
Cited by
Cited by
High-order entropy-compressed text indexes
R Grossi, A Gupta, JS Vitter
Society for Industrial and Applied Mathematics Philadelphia, 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
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
Squeezing succinct data structures into entropy bounds
K Sadakane, R Grossi
SODA 6, 1230-1239, 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
When indexing equals compression: experiments with compressing suffix arrays and applications.
R Grossi, A Gupta, JS Vitter
SODA 4, 636-645, 2004
Simple and efficient string matching with k mismatches
R Grossi, F Luccio
Information Processing Letters 33 (3), 113-120, 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
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
Su x trees and their applications in string algorithms
R Grossi, GF Italiano
Proc. 1st South American Workshop on String Processing, 57-76, 1993
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
On the size of succinct indices
A Golynski, R Grossi, A Gupta, R Raman, SS Rao
European Symposium on Algorithms, 371-382, 2007
IP address lookupmade fast and simple
P Crescenzi, L Dardini, R Grossi
European Symposium on Algorithms, 65-76, 1999
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
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
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
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
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
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
On the construction of classes of suffix trees for square matrices: Algorithms and applications
R Giancarlo, R Grossi
information and computation 130 (2), 151-182, 1996
The system can't perform the operation now. Try again later.
Articles 1–20