Roberto Grossi

Roberto Grossi is professor of Computer Science at the University of Pisa and Galilei International Ph.D school. His scientific background is in algorithms and data structures for combinatorial pattern matching and mining; design of algorithms and data structures for external and hierarchical memory; implicit, succinct and compressed data structures for (compressed) data sets; space- and time-efficient compressed indexing and fast searching in compressed text; text indexing and editing; graph algorithms and pattern discovery in graphs and sequences. His research results have been published in almost a hundred papers (many of them are available at DBLP). He his one of the few Italian authors cited in the second edition of the third volume of The Art of Computer Programming: Sorting and Searching by Donald Knuth for his contribution to the String B-Tree (along with P. Ferragina). His paper on Compressed Suffix Array (along with J.S. Vitter) has more than 450 citations in Google Scholar, that on High-Order Compressed Text Indexes (along with A. Gupta and J.S. Vitter) has more than 300 citations, and that on String B-tree has more than 260 citations. His h-index is 33 (computed with the Firefox plug-in Scholar H-Index Calculator). He visited several universities and research institutes to establish international contacts with Aarhus U., AT&T Bell Labs, IMS at Chennai, Columbia U., ICSI at Berkeley, Haifa U., King’s College at London, Tohoku U., Tokyo U., U. de Marne-la-Vallee, U. de Lyon. He has been Program Committee Member of the main conferences in his area, and is in the Editorial Board of the international journals Theory of Computing Systems, Springer-Verlag and RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, EDP Sciences.