Papers by Topics (in alphabetical order)
(the papers marked by an asterisk also appear as journal papers)
Dynamic Data Structures, Graph Algorithms, and Other Areas

• R. Grossi and E. Lodi, ``Simple Planar Graph Partition into Three Forests'', Discrete Applied Mathematics 84 (1998), pp.121--132, Elsevier Science (note).
• R. Grossi and G.F. Italiano, ``Efficient Splitting and Merging Algorithms for Order Decomposable Problems'', to appear in Information and Computation, Academic Press.
• *R. Grossi and G.F. Italiano, ``Efficient Splitting and Merging Algorithms for Order Decomposable Problems'', in 24th International Colloquium on Automata, Languages and Programming (ICALP'97), LNCS (1997) Springer-Verlag.
• R. Grossi, A. Pietracaprina and G. Pucci, ``Optimal Deterministic Protocols for Mobile Robots on a Grid''. Sixth Scandinavian Workshop on Algorithm Theory (SWAT'98), Stockholm, Sweden, to appear in LNCS, Springer-Verlag.
• 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.
• 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.

External Memory Algorithms and Data Structures

• 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.
• L. Arge, P. Ferragina, R. Grossi and J. S. Vitter, ``Sequence Sorting in Secondary Storage'', in Compression and Complexity of Sequences, Positano (1997), Italy, IEEE Press (invited speaker J. S. Vitter).
• P. Ferragina and R. Grossi, ``The String B-Tree: A New Data Structure for String Search in External Memory and its Applications'', accepted for publication in Journal of ACM, ACM Press. (download)
• *P. Ferragina and R. Grossi, ``A Fully-Dynamic Data Structure for External Substring Search'', Twenty-seventh ACM Symposium on Theory of Computing (STOC'95), Las Vegas, U.S.A. (1995) pp.693--702, ACM Press.
• P. Ferragina and R. Grossi, ``Fast String Searching in Secondary Storage: Theoretical Developments and Experimental Results'', Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'96), Atlanta, U.S.A. (1996) pp.373--382, ACM-SIAM Press.
• R. Grossi and G.F. Italiano, ``Efficient Cross-Trees for External Memory'', accepted for publication in AMS-DIMACS Volume Series, AMS press, USA. (download)
• *R. Grossi and G.F. Italiano, ``Efficient Cross-Trees for External Memory''. DIMACS Workshop on External Memory Algorithms and Visualization 1998, Rutgers University, USA.

Multi-Dimensional Pattern Matching

• R. Giancarlo and R. Grossi, ``Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices'', Fifth ACM Symposium on Parallel Algorithms and Architectures (SPAA'93), Velen, Germany (1993), pp. 79--90, ACM Press.
• R. Giancarlo and R. Grossi, ``On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications'', Information and Computation 130 (1996) pp. 151--182, Academic Press.
• *R. Giancarlo and R. Grossi, ``On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications'', 22nd International Colloquium on Automata, Languages and Programming (ICALP'95), Z. Fulop and F. Gecseg eds, LNCS vol. 944, (1995) pp. 111-122, Springer-Verlag.
• 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, ``Multi-dimensional Pattern Matching with Dimensional Wildcards'', Combinatorial Pattern Matching (CPM'95), Z. Galil and E. Ukkonen, eds, LNCS, vol. 937 (1995) pp.90--101, Springer-Verlag.
• 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.
• R. Giancarlo and R. Grossi, ``Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices'', to appear in Journal of Complexity .

String Algorithms and Text Indexing

• R. Grossi and F. Luccio, ``Simple and Efficient String Matching with $k$ Mismatches'', Information Processing Letters 33 (1989) pp.113--120, North-Holland.
• R. Grossi and G.F. Italiano, ``Suffix Trees and their Application in String Algorithms'', Invited talk in First South American Workshop on String Processing (WSP'93), Belo Horizonte, Brazil (1993), pp. 57--76, UFMG Press (invited speaker G.F. Italiano).
• 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.
• *P. Ferragina and R. Grossi, ``Optimal On-Line Search and Sublinear Time Update in String Matching'', Thirty-sixth IEEE Symposium on Foundations of Computer Science (FOCS'95), Milwaukee, U.S.A. (1995) pp.604--612, IEEE Press.
• 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).
• *P. Ferragina, M. Montangero and R. Grossi, ``A Note on Updating Suffix Tree Labels'', Italian Conference on Algorithms and Complexity (CIAC `97), Rome, Italy, LNCS vol. 1203 (1997) pp.181--192, Springer-Verlag.
• P. Ferragina and R. Grossi, ``Improved Dynamic Text Indexing'', to appear in Journal of Algorithms under major revision, Academic Press.
• *P. Ferragina and R. Grossi, ``Fast Incremental Text Editing'', Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'95), San Francisco, U.S.A. (1995) pp.531--540, ACM-SIAM Press.

Topics in Tree Pattern Matching

• B. De Iaco, R. Grossi, F. Luccio and L. Pagli, ``Instances of Pattern Detection and Matching in Discrete Structures'', 3rd Int. Conf. on Advances in Pattern Recognition and Digital Techniques, Calcutta, India (1993), IAPR, 25--32 (invited speaker F. Luccio).
• R. Grossi, ``A Note on the Subtree Isomorphism for Ordered Trees and Related Problems'', Information Processing Letters 39 (1991) pp.81--84, North-Holland.
• R. Grossi, ``Further Comments on the Subtree Isomorphism for Ordered Trees'', Information Processing Letters 40 (1991) pp.255--256, North-Holland.
• R. Grossi, ``A Fast VLSI Solution for Approximate String Matching'', Integration - the VLSI journal 13 (1992) pp.195--206, Elsevier Science Pub.
• R. Grossi, ``On Finding Common Subtrees'', Theoretical Computer Science 108 (1993) pp.345--356, North-Holland (note).
• R. Grossi, F. Luccio and L. Pagli: ``Coding Trees as Strings in Approximate Tree Matching'', in SEQUENCES II: Methods in Communications, Security and Computer Science, Springer-Verlag (1991), pp. 245--259.