Some of my recent papers are listed below in chronological order. I plan to put their electronic versions asap. Please send me mail if you need a paper that is not yet available in electronic version or if you find any problems while downloading (some people reported that they could not download the files).

• P. Crescenzi, A. Del Lungo, R. Grossi, E. Lodi, L. Pagli, and G. Rossi, ``Text Sparsification via Local Maxima'' FSTTCS 2000 LNCS 1974, Springer-Verlag (2000) 290-301.
• R. Grossi and J. S. Vitter, ``Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching'', ACM Symposium on the Theory of Computing (STOC 2000), Portland, U.S.A. (2000) ACM Press. (download)
• R. Grossi, A. Pietracaprina and G. Pucci, `` Optimal Deterministic Protocols for Mobile Robots on a Grid'' in Information and Computation, Academic Press.
• P. Crescenzi, L. Dardini and R. Grossi, ``IP Lookup Made Easy and Fast'' in 7th Annual European Symposium on Algorithms (ESA '99). (download TR-99-01)
• R. Grossi and G.F. Italiano, ``Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures'' in 26-th International Colloquium on Automata, Languages, and Programming (ICALP '99). Electronic version not yet available.
• A. Bellini, A. Del Lungo, F. Gori, R. Grossi and M. Guarducci, ``A Fast H.261 Software Codec for High Quality Videoconferencing on Personal Computers'' in IEEE Multimedia Systems '99. (download)
• R. Giancarlo and R. Grossi, ``Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices'', Journal of Complexity .
• P. Ferragina and R. Grossi, ``The String B-Tree: A New Data Structure for String Search in External Memory and its Applications'', Journal of the ACM, ACM Press. (download)
• R. Grossi and G.F. Italiano, ``Efficient Cross-Trees for External Memory'', AMS-DIMACS Volume Series, AMS press, USA. Due to some mistake, the published version is not the revised one. Here is the technical report TR-00-16 giving the correct version: (download)
• P. Ferragina and R. Grossi, ``Improved Dynamic Text Indexing'', Journal of Algorithms under revision, Academic Press.
• R. Grossi, A. Pietracaprina and G. Pucci, ``Optimal Deterministic Protocols for Mobile Robots on a Grid'' in Sixth Scandinavian Workshop on Algorithm Theory (SWAT'98), Stockholm, Sweden, LNCS, Springer-Verlag.
• R. Grossi and G.F. Italiano, ``Efficient Splitting and Merging Algorithms for Order Decomposable Problems'', Information and Computation, Academic Press.
• P. Ferragina and R. Grossi, ``Optimal On-Line Search and Sublinear Time Update in String Matching'', SIAM Journal on Computing 27 (December 1998), SIAM Press.
• R. Grossi and E. Lodi, ``Simple Planar Graph Partition into Three Forests'', Discrete Applied Mathematics 84 (1998), pp.121--132, Elsevier Science (note).
• P. Ferragina, R. Grossi and M. Montangero, ``A Note on Updating Suffix Tree Labels'', Theoretical Computer Science 201 (1998), pp.249--262, North-Holland (note).
• L. Arge, P. Ferragina, R. Grossi and J. S. Vitter, ``On Sorting Strings in External Memory'', ACM Symposium on the Theory of Computing (STOC `97), El Paso, U.S.A. (1997) pp.540--548 ACM Press.
• R. Giancarlo and R. Grossi, ``Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms'', Journal of Algorithms, 24 (1997), pp. 223--265, Academic Press.
• R. Giancarlo and R. Grossi,``Suffix Tree Data Structures for Matrices'', Chap.~10 in Pattern Matching Algorithms, A. Apostolico and Z. Galil eds., Oxford University Press (1997), pp.293--340.