PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Grossi, Roberto"

Author of the publication

copydeleteadd this publication to your clipboard
When indexing equals compression: experiments with compressing suffix arrays and applications.

, , and . SODA, page 636-645. SIAM, (2004)

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.

No persons found for author name Grossi, Roberto
add a person with the name Grossi, Roberto
 

Other publications of authors with the same name

When indexing equals compression: experiments with compressing suffix arrays and applications., , and . SODA, page 636-645. SIAM, (2004)Optimal On-Line Search and Sublinear Time Update in String Matching., and . FOCS, page 604-612. IEEE Computer Society, (1995)Implicit B-Trees: New Results for the Dictionary Problem., , , and . FOCS, page 145-154. IEEE Computer Society, (2002)Wavelet Trees.. Encyclopedia of Algorithms, (2016)Mobilomics in Saccharomyces cerevisiae strains., , , , and . BMC Bioinformatics, (2013)Design of Practical Succinct Data Structures for Large Data Collections., and . SEA, volume 7933 of Lecture Notes in Computer Science, page 5-17. Springer, (2013)Constant-Time Word-Size String Matching., , and . CPM, volume 7354 of Lecture Notes in Computer Science, page 83-96. Springer, (2012)Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures., and . ICALP, volume 1644 of Lecture Notes in Computer Science, page 372-381. Springer, (1999)D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes., , , , , and . KDD, page 1272-1281. ACM, (2018)A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum., , , and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 622-631. Springer, (2003)