( en | de | ru )

 

Disambiguation of "Grossi, Roberto"

Author of the publication

copydeleteadd this publication to your clipboard
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs.

, , , and . SDM, page 289-297. SIAM, (2023)

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 Fornari

Roberto Cruccolini

Roberto Sala

 

Other publications of authors with the same name

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)Optimal Trade-Offs for Succinct String Indexes., , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 678-689. Springer, (2010)A fully-dynamic data structure for external substring search (Extended Abstract)., and . STOC, page 693-702. ACM, (1995)Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing., , , , , and . CoRR, (2013)Inferring Mobile Elements in S. Cerevisiae Strains., , , , and . BIOINFORMATICS, page 131-136. SciTePress, (2011)On Breaking Truss-Based Communities., , , , , and . KDD, page 117-126. ACM, (2021)On the Complexity of String Matching for Graphs., , , and . ICALP, volume 132 of LIPIcs, page 55:1-55:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Succinct Representations for (Non)Deterministic Finite Automata., , , and . LATA, volume 12638 of Lecture Notes in Computer Science, page 55-67. Springer, (2021)Large-scale clique cover of real-world networks., , and . Inf. Comput., (2020)Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform., , and . ANALCO, page 191-202. SIAM, (2008)