( en | de | ru )

 

Disambiguation of "Grossi, Roberto"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal Listing of Cycles and St-paths in Undirected Graphs

, , , , , , and . Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, page 1884--1896. SIAM, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Margherita Grossi

Davide Grossi

Roberto Cruccolini

Roberto Sala

Roberto Fornari

 

Other publications of authors with the same name

Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques.. CPM, volume 5577 of Lecture Notes in Computer Science, page 39-40. Springer, (2009)Simple Real-Time Constant-Space String Matching., , and . CPM, volume 6661 of Lecture Notes in Computer Science, page 173-183. Springer, (2011)Succinct Representation for (Non)Deterministic Finite Automata., , , and . CoRR, (2019)On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications., and . ICALP, volume 944 of Lecture Notes in Computer Science, page 111-122. Springer, (1995)A General Technique for Managing Strings in Comparison-Driven Data Structures., and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 606-617. Springer, (2004)Optimal Cache-Oblivious Implicit Dictionaries., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 316-331. Springer, (2003)Polynomial-Delay Enumeration of Maximal Common Subsequences., , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 189-202. Springer, (2019)A fast VLSI solution for approximate string matching.. Integr., 13 (2): 195-206 (1992)High-order entropy-compressed text indexes., , and . SODA, page 841-850. ACM/SIAM, (2003)Further Comments on the Subtree Isomorphism for Ordered Trees.. Inf. Process. Lett., 40 (5): 255-256 (1991)