Roberto Grossi

Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni: Mobilomics in Saccharomyces cerevisiae strains. BMC Bioinformatics 14: 102 (2013)

Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri: Editorial. J. Discrete Algorithms 18: 1-2 (2013)

Dany Breslauer, Roberto Grossi, Filippo Mignosi: Simple real-time constant-space string matching. Theor. Comput. Sci. 483: 2-9 (2013)

Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau: A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. CPM 2013: 74-82

Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto: Optimal Listing of Cycles and st-Paths in Undirected Graphs. SODA 2013: 1884-1896

Giovanni Battaglia, Roberto Grossi, Noemi Scutellà: Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings. Inf. Comput. 219: 58-70 (2012)

Giuseppe Ottaviano, Roberto Grossi: Fast Compressed Tries through Path Decompositions. ALENEX 2012: 65-74

Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni: A Taste of Yeast Mobilomics. BIOINFORMATICS 2012: 271-274

Dany Breslauer, Leszek Gasieniec, Roberto Grossi: Constant-Time Word-Size String Matching. CPM 2012: 83-96

Roberto Grossi, Giuseppe Ottaviano: The wavelet trie: maintaining an indexed sequence of strings in compressed space. PODS 2012: 203-214

Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot: Efficient Bubble Enumeration in Directed Graphs. SPIRE 2012: 118-129

Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino: On Computing the Diameter of Real-World Directed (Weighted) Graphs. SEA 2012: 99-110

Roberto Grossi, Giuseppe Ottaviano: The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space. CoRR abs/1204.3581 (2012)

Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot: Optimal Listing of Cycles and st-Paths in Undirected Graphs. CoRR abs/1205.2766 (2012)

Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin: MADMX: A Strategy for Maximal Dense Motif Extraction. Journal of Computational Biology 18(4): 535-545 (2011)

Roberto Grossi: A quick tour on suffix arrays and compressed suffix arrays. Theor. Comput. Sci. 412(27): 2964-2973 (2011)

Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni: Inferring Mobile Elements in S. Cerevisiae Strains. BIOINFORMATICS 2011: 131-136

Roberto Grossi, Jeffrey Scott Vitter, Bojian Xu: Wavelet Trees: From Theory to Practice. CCP 2011: 210-221

Giuseppe Ottaviano, Roberto Grossi: Semi-indexing semi-structured data in tiny space. CIKM 2011: 1485-1494

Dany Breslauer, Roberto Grossi, Filippo Mignosi: Simple Real-Time Constant-Space String Matching. CPM 2011: 173-183

Giovanni Battaglia, Roberto Grossi, Noemi Scutellà: Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees. Developments in Language Theory 2011: 58-69

Rui A. Ferreira, Roberto Grossi, Romeo Rizzi: Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. ESA 2011: 275-286

Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann: Optimal Packed String Matching. FSTTCS 2011: 423-432

Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino: A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. TAPAS 2011: 92-103

Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri (Eds.): String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings. Lecture Notes in Computer Science 7024, Springer 2011, isbn 978-3-642-24582-4

Giovanni Battaglia, Roberto Grossi, Noemi Scutellà: Consecutive Ones Property and PQ-Trees for Multisets: Hardness of Counting Their Orderings. CoRR abs/1102.0041 (2011)

Gianni Franceschini, Roberto Grossi, S. Muthukrishnan: Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection. CoRR abs/1110.3381 (2011)

Roberto Grossi, Giuseppe Ottaviano: Fast Compressed Tries through Path Decompositions. CoRR abs/1111.5220 (2011)

Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino: Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. ESA (1) 2010: 302-313

Roberto Grossi, Alessio Orlandi, Giuseppe Ottaviano: Fun with Olympiad in Algorithmics. FUN 2010: 1-2

Roberto Grossi, Alessio Orlandi, Rajeev Raman: Optimal Trade-Offs for Succinct String Indexes. ICALP (1) 2010: 678-689

Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin: MADMX: A Novel Strategy for Maximal Dense Motif Extraction. CoRR abs/1002.0874 (2010)

Roberto Grossi, Alessio Orlandi, Rajeev Raman: Optimal Trade-Off for Succinct String Indexes. CoRR abs/1006.5354 (2010)

Giovanni Battaglia, Davide Cangelosi, Roberto Grossi, Nadia Pisanti: Masking patterns in sequences: A new class of motif discovery with don't cares. Theor. Comput. Sci. 410(43): 4327-4340 (2009)

Roberto Grossi: Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. CPM 2009: 39-40

Giovanni Battaglia, Roberto Grossi, Roberto Marangoni, Nadia Pisanti: Mining Biological Sequences with Masks. DEXA Workshops 2009: 193-197

Gianni Franceschini, Roberto Grossi, S. Muthukrishnan: Optimal Cache-Aware Suffix Selection. STACS 2009: 457-468

Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao: More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. STACS 2009: 517-528

Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin: MADMX: A Novel Strategy for Maximal Dense Motif Extraction. WABI 2009: 362-374

Gianni Franceschini, Roberto Grossi, S. Muthukrishnan: Optimal cache-aware suffix selection. CoRR abs/0902.1737 (2009)

Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao: More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. CoRR abs/0902.2648 (2009)

Gianni Franceschini, Roberto Grossi: No sorting? better searching!. ACM Transactions on Algorithms 4(1) (2008)

Ankur Gupta, Roberto Grossi, Jeffrey Scott Vitter: Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform. ANALCO 2008: 191-202

Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, Jeffrey Scott Vitter: On searching compressed string collections cache-obliviously. PODS 2008: 181-190

Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao: On the Size of Succinct Indices. ESA 2007: 371-382

Gianni Franceschini, Roberto Grossi: Optimal Implicit Dictionaries over Unbounded Universes. Theory Comput. Syst. 39(2): 321-345 (2006)

Paolo Ferragina, Roberto Grossi, Fabrizio Luccio: Foreword. Theory Comput. Syst. 39(3): 389 (2006)

Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter: When indexing equals compression: Experiments with compressing suffix arrays and applications. ACM Transactions on Algorithms 2(4): 611-639 (2006)

Kunihiko Sadakane, Roberto Grossi: Squeezing succinct data structures into entropy bounds. SODA 2006: 1230-1239

Iwona Bialynicka-Birula, Roberto Grossi: Amortized Rigidness in Dynamic Cartesian Trees. STACS 2006: 80-91

Roberto Grossi, Jeffrey Scott Vitter: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM J. Comput. 35(2): 378-407 (2005)

Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot: Bases of Motifs for Generating Repeated Patterns with Wild Cards. IEEE/ACM Trans. Comput. Biology Bioinform. 2(1): 40-50 (2005)

Gianni Franceschini, Roberto Grossi: Optimal In-place Sorting of Vectors and Records. ICALP 2005: 90-102

Iwona Bialynicka-Birula, Roberto Grossi: Rank-Sensitive Data Structures. SPIRE 2005: 79-90

Filippo Geraci, Roberto Grossi: Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms. WEA 2005: 580-592

Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli: Implicit B-trees: a new data structure for the dictionary problem. J. Comput. Syst. Sci. 68(4): 788-807 (2004)

Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi: A Trie-Based Approach for Compacting Automata. CPM 2004: 145-158

Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter: Fast Compression with a Static Model in High-Order Entropy. Data Compression Conference 2004: 62-71

Gianni Franceschini, Roberto Grossi: No Sorting? Better Searching! FOCS 2004: 491-498

Gianni Franceschini, Roberto Grossi: A General Technique for Managing Strings in Comparison-Driven Data Structures. ICALP 2004: 606-617

Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter: When indexing equals compression: experiments with compressing suffix arrays and applications. SODA 2004: 636-645

Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi: Text sparsification via local maxima. Theor. Comput. Sci. 1-3(304): 341-364 (2003)

Gianni Franceschini, Roberto Grossi: Optimal Cache-Oblivious Implicit Dictionaries. ICALP 2003: 316-331

Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot: A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. MFCS 2003: 622-631

Gianni Franceschini, Roberto Grossi: Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. SODA 2003: 670-678

Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter: High-order entropy-compressed text indexes. SODA 2003: 841-850

Gianni Franceschini, Roberto Grossi: Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. WADS 2003: 114-126

Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano: Search Data Structures for Skewed Strings. WEA 2003: 81-96

Roberto Grossi, Andrea Pietracaprina, Geppino Pucci: Optimal Deterministic Protocols for Mobile Robots on a Grid. Inf. Comput. 173(2): 132-142 (2002)

Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli: Implicit B-Trees: New Results for the Dictionary Problem. FOCS 2002: 145-154

Jeffrey Scott Vitter, Roberto Grossi: Compressed Indexes for Fast Search in Sequences. JCIS 2002: 44-48

Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi: Text Sparsification via Local Maxima. FSTTCS 2000: 290-301

Roberto Grossi, Jeffrey Scott Vitter: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). STOC 2000: 397-406

Roberto Grossi, Giuseppe F. Italiano: Efficient Splitting and Merging Algorithms for Order Decomposable Problems. Inf. Comput. 154(1): 1-33 (1999)

Paolo Ferragina, Roberto Grossi: The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. J. ACM 46(2): 236-280 (1999)

Paolo Ferragina, Roberto Grossi: Improved Dynamic Text Indexing. J. Algorithms 31(2): 291-319 (1999)

Raffaele Giancarlo, Roberto Grossi: Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices. J. Complexity 15(1): 30-71 (1999)

Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi: IP Address Lookup Made Fast and Simple. ESA 1999: 65-76

Roberto Grossi, Giuseppe F. Italiano: Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. ICALP 1999: 372-381

Alessandro Bellini, Alberto Del Lungo, Fabio Gori, Roberto Grossi, Marco Guarducci: A Fast H.261 Software Codec for High Quality Videoconferencing on PCs. ICMCS, Vol. 2 1999: 1007-1008

Roberto Grossi, Elena Lodi: Simple Planar Graph Partition into Three Forests. Discrete Applied Mathematics 84(1-3): 121-132 (1998)

Paolo Ferragina, Roberto Grossi: Optimal On-Line Search and Sublinear Time Update in String Matching. SIAM J. Comput. 27(3): 713-736 (1998)

Paolo Ferragina, Roberto Grossi, Manuela Montangero: On Updating Suffix Tree Labels. Theor. Comput. Sci. 201(1-2): 249-262 (1998)

Roberto Grossi, Andrea Pietracaprina, Geppino Pucci: Optimal Deterministic Protocols for Mobile Robots on a Grid. SWAT 1998: 181-192

Raffaele Giancarlo, Roberto Grossi: Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms. J. Algorithms 24(2): 223-265 (1997)

Paolo Ferragina, Roberto Grossi, Manuela Montangero: A Note on Updating Suffix Tree Labels. CIAC 1997: 181-192

Roberto Grossi, Giuseppe F. Italiano: Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). ICALP 1997: 605-615

Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter: On Sorting Strings in External Memory (Extended Abstract). STOC 1997: 540-548

Raffaele Giancarlo, Roberto Grossi: On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. Inf. Comput. 130(2): 151-182 (1996)

Paolo Ferragina, Roberto Grossi: Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. SODA 1996: 373-382

Raffaele Giancarlo, Roberto Grossi: Multi-Dimensional Pattern Matching with Dimensional Wildcards. CPM 1995: 90-101

Paolo Ferragina, Roberto Grossi: Optimal On-Line Search and Sublinear Time Update in String Matching. FOCS 1995: 604-612

Raffaele Giancarlo, Roberto Grossi: On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. ICALP 1995: 111-122

Paolo Ferragina, Roberto Grossi: Fast Incremental Text Editing. SODA 1995: 531-540

Paolo Ferragina, Roberto Grossi: A fully-dynamic data structure for external substring search (Extended Abstract). STOC 1995: 693-702

Roberto Grossi: On Finding Commong Subtrees. Theor. Comput. Sci. 108(2): 345-356 (1993)

Raffaele Giancarlo, Roberto Grossi: Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices. SPAA 1993: 86-97

Roberto Grossi: A Note on the Subtree Isomorphism for Ordered Trees and Related Problems. Inf. Process. Lett. 39(2): 81-84 (1991)

Roberto Grossi: Further Comments on the Subtree Isomorphism for Ordered Trees. Inf. Process. Lett. 40(5): 255-256 (1991)

Roberto Grossi, Fabrizio Luccio: Simple and Efficient String Matching with k Mismatches. Inf. Process. Lett. 33(3): 113-120 (1989)