| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Roberto Grossi, Giuseppe Ottaviano |
The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Roberto Grossi, Giuseppe Ottaviano |
The wavelet trie: maintaining an indexed sequence of strings in compressed space. |
PODS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi |
A quick tour on suffix arrays and compressed suffix arrays. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi, S. Muthukrishnan |
Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Giovanni Battaglia, Roberto Grossi, Noemi Scutellà |
Consecutive Ones Property and PQ-Trees for Multisets: Hardness of Counting Their Orderings |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Roberto Grossi, Giuseppe Ottaviano |
Fast Compressed Tries through Path Decompositions |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rui A. Ferreira, Roberto Grossi, Romeo Rizzi |
Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Jeffrey Scott Vitter, Bojian Xu |
Wavelet Trees: From Theory to Practice. |
CCP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Giovanni Battaglia, Roberto Grossi, Noemi Scutellà |
Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees. |
Developments in Language Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Roberto Grossi, Filippo Mignosi |
Simple Real-Time Constant-Space String Matching. |
CPM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni |
Inferring Mobile Elements in S. Cerevisiae Strains. |
BIOINFORMATICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino |
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. |
TAPAS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri (eds.) |
String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings |
SPIRE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann |
Optimal Packed String Matching. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Ottaviano, Roberto Grossi |
Semi-indexing semi-structured data in tiny space. |
CIKM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Alessio Orlandi, Rajeev Raman |
Optimal Trade-Off for Succinct String Indexes |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin |
MADMX: A Novel Strategy for Maximal Dense Motif Extraction |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Alessio Orlandi, Rajeev Raman |
Optimal Trade-Offs for Succinct String Indexes. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Alessio Orlandi, Giuseppe Ottaviano |
Fun with Olympiad in Algorithmics. |
FUN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao |
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi, S. Muthukrishnan |
Optimal cache-aware suffix selection |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao |
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi, S. Muthukrishnan |
Optimal Cache-Aware Suffix Selection. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin |
MADMX: A Novel Strategy for Maximal Dense Motif Extraction. |
WABI |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi |
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Giovanni Battaglia, Roberto Grossi, Roberto Marangoni, Nadia Pisanti |
Mining Biological Sequences with Masks. |
DEXA Workshops |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi |
No sorting? better searching!. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Implicit data structures, in-place algorithms, searching, sorting |
| 1 | Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, Jeffrey Scott Vitter |
On searching compressed string collections cache-obliviously. |
PODS |
2008 |
DBLP DOI BibTeX RDF |
front coding, data compression, b-tree, string searching, cache efficiency |
| 1 | Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao |
On the Size of Succinct Indices. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter |
When indexing equals compression: Experiments with compressing suffix arrays and applications. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Entropy, suffix array, text indexing, Burrows-Wheeler Transform |
| 1 | Gianni Franceschini, Roberto Grossi |
Optimal Implicit Dictionaries over Unbounded Universes. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Roberto Grossi, Fabrizio Luccio |
Foreword. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kunihiko Sadakane, Roberto Grossi |
Squeezing succinct data structures into entropy bounds. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Iwona Bialynicka-Birula, Roberto Grossi |
Amortized Rigidness in Dynamic Cartesian Trees. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
Motifs basis, repeated motifs |
| 1 | Roberto Grossi, Jeffrey Scott Vitter |
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi |
Optimal In-place Sorting of Vectors and Records. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Filippo Geraci, Roberto Grossi |
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Iwona Bialynicka-Birula, Roberto Grossi |
Rank-Sensitive Data Structures. |
SPIRE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli |
Implicit B-trees: a new data structure for the dictionary problem. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter |
When indexing equals compression: experiments with compressing suffix arrays and applications. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi |
A General Technique for Managing Strings in Comparison-Driven Data Structures. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi |
A Trie-Based Approach for Compacting Automata. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
factor and suffix automata, suffix tree, index, text compression, Automata and formal languages |
| 1 | Gianni Franceschini, Roberto Grossi |
No Sorting? Better Searching! |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter |
Fast Compression with a Static Model in High-Order Entropy. |
Data Compression Conference |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi |
Text sparsification via local maxima. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter |
High-order entropy-compressed text indexes. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi |
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi |
Optimal Cache-Oblivious Implicit Dictionaries. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano |
Search Data Structures for Skewed Strings. |
WEA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi |
Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. |
WADS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Andrea Pietracaprina, Geppino Pucci |
Optimal Deterministic Protocols for Mobile Robots on a Grid. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli |
Implicit B-Trees: New Results for the Dictionary Problem. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey Scott Vitter, Roberto Grossi |
Compressed Indexes for Fast Search in Sequences. |
JCIS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi |
Text Sparsification via Local Maxima. |
FSTTCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Jeffrey Scott Vitter |
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Giancarlo, Roberto Grossi |
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices. |
J. Complexity |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Giuseppe F. Italiano |
Efficient Splitting and Merging Algorithms for Order Decomposable Problems. |
Inf. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Roberto Grossi |
Improved Dynamic Text Indexing. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Roberto Grossi |
The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. |
J. ACM |
1999 |
DBLP DOI BibTeX RDF |
Patricia trie, prefix and range search, string searching and sorting, text index, suffix tree, B-tree, suffix array, external-memory data structure |
| 1 | Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi |
IP Address Lookup Made Fast and Simple. |
ESA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Giuseppe F. Italiano |
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Bellini, Alberto Del Lungo, Fabio Gori, Roberto Grossi, Marco Guarducci |
A Fast H.261 Software Codec for High Quality Videoconferencing on PCs. (PDF / PS) |
ICMCS, Vol. 2 |
1999 |
DBLP DOI BibTeX RDF |
Interframe compression, CIF, H.261, motion estimation, personal computer, video conference |
| 1 | Paolo Ferragina, Roberto Grossi, Manuela Montangero |
On Updating Suffix Tree Labels. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Elena Lodi |
Simple Planar Graph Partition into Three Forests. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Roberto Grossi |
Optimal On-Line Search and Sublinear Time Update in String Matching. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Andrea Pietracaprina, Geppino Pucci |
Optimal Deterministic Protocols for Mobile Robots on a Grid. |
SWAT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Giancarlo, Roberto Grossi |
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Giuseppe F. Italiano |
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter |
On Sorting Strings in External Memory (Extended Abstract). |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Roberto Grossi, Manuela Montangero |
A Note on Updating Suffix Tree Labels. |
CIAC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Giancarlo, Roberto Grossi |
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Roberto Grossi |
Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Roberto Grossi |
Fast Incremental Text Editing. |
SODA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Giancarlo, Roberto Grossi |
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Giancarlo, Roberto Grossi |
Multi-Dimensional Pattern Matching with Dimensional Wildcards. |
CPM |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Roberto Grossi |
Optimal On-Line Search and Sublinear Time Update in String Matching. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
optimal online search, optimal on-line search, sublinear time update, online searching, arbitrary pattern string, indexed text string, arbitrary string, optimal time, occ occurrences, sublinear time per update, computational complexity, pattern matching, string matching, string matching, search problems, word processing, dynamic algorithm, dynamic setting |
| 1 | Paolo Ferragina, Roberto Grossi |
A fully-dynamic data structure for external substring search (Extended Abstract). |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi |
On Finding Commong Subtrees. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaele Giancarlo, Roberto Grossi |
Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices. |
SPAA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi |
A Note on the Subtree Isomorphism for Ordered Trees and Related Problems. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi |
Further Comments on the Subtree Isomorphism for Ordered Trees. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Fabrizio Luccio |
Simple and Efficient String Matching with k Mismatches. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")