 | 2009 |
|---|
| 64 |       | Roberto Grossi:
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques.
CPM 2009: 39-40 |
| 63 | | Gianni Franceschini,
Roberto Grossi,
S. Muthukrishnan:
Optimal Cache-Aware Suffix Selection.
STACS 2009: 457-468 |
| 62 | | Roberto Grossi,
Alessio Orlandi,
Rajeev Raman,
S. Srinivasa Rao:
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries.
STACS 2009: 517-528 |
| 61 | | 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 |
| 60 | | Gianni Franceschini,
Roberto Grossi,
S. Muthukrishnan:
Optimal cache-aware suffix selection
CoRR abs/0902.1737: (2009) |
| 59 | | 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) |
| 2008 |
|---|
| 58 | | Paolo Ferragina,
Roberto Grossi,
Ankur Gupta,
Rahul Shah,
Jeffrey Scott Vitter:
On searching compressed string collections cache-obliviously.
PODS 2008: 181-190 |
| 57 | | Gianni Franceschini,
Roberto Grossi:
No sorting? better searching!.
ACM Transactions on Algorithms 4(1): (2008) |
| 2007 |
|---|
| 56 | | Alexander Golynski,
Roberto Grossi,
Ankur Gupta,
Rajeev Raman,
S. Srinivasa Rao:
On the Size of Succinct Indices.
ESA 2007: 371-382 |
| 2006 |
|---|
| 55 | | Kunihiko Sadakane,
Roberto Grossi:
Squeezing succinct data structures into entropy bounds.
SODA 2006: 1230-1239 |
| 54 | | Iwona Bialynicka-Birula,
Roberto Grossi:
Amortized Rigidness in Dynamic Cartesian Trees.
STACS 2006: 80-91 |
| 53 | | 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) |
| 52 | | Gianni Franceschini,
Roberto Grossi:
Optimal Implicit Dictionaries over Unbounded Universes.
Theory Comput. Syst. 39(2): 321-345 (2006) |
| 51 | | Paolo Ferragina,
Roberto Grossi,
Fabrizio Luccio:
Foreword.
Theory Comput. Syst. 39(3): 389 (2006) |
| 2005 |
|---|
| 50 | | Gianni Franceschini,
Roberto Grossi:
Optimal In-place Sorting of Vectors and Records.
ICALP 2005: 90-102 |
| 49 | | Iwona Bialynicka-Birula,
Roberto Grossi:
Rank-Sensitive Data Structures.
SPIRE 2005: 79-90 |
| 48 | | Filippo Geraci,
Roberto Grossi:
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms.
WEA 2005: 580-592 |
| 47 | | 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) |
| 46 | | 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) |
| 2004 |
|---|
| 45 | | Maxime Crochemore,
Chiara Epifanio,
Roberto Grossi,
Filippo Mignosi:
A Trie-Based Approach for Compacting Automata.
CPM 2004: 145-158 |
| 44 | | 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 |
| 43 | | Gianni Franceschini,
Roberto Grossi:
No Sorting? Better Searching!
FOCS 2004: 491-498 |
| 42 | | Gianni Franceschini,
Roberto Grossi:
A General Technique for Managing Strings in Comparison-Driven Data Structures.
ICALP 2004: 606-617 |
| 41 | | Roberto Grossi,
Ankur Gupta,
Jeffrey Scott Vitter:
When indexing equals compression: experiments with compressing suffix arrays and applications.
SODA 2004: 636-645 |
| 40 | | 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) |
| 2003 |
|---|
| 39 | | Gianni Franceschini,
Roberto Grossi:
Optimal Cache-Oblivious Implicit Dictionaries.
ICALP 2003: 316-331 |
| 38 | | 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 |
| 37 | | Gianni Franceschini,
Roberto Grossi:
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time.
SODA 2003: 670-678 |
| 36 | | Roberto Grossi,
Ankur Gupta,
Jeffrey Scott Vitter:
High-order entropy-compressed text indexes.
SODA 2003: 841-850 |
| 35 | | Gianni Franceschini,
Roberto Grossi:
Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees.
WADS 2003: 114-126 |
| 34 | | Pierluigi Crescenzi,
Roberto Grossi,
Giuseppe F. Italiano:
Search Data Structures for Skewed Strings.
WEA 2003: 81-96 |
| 33 | | 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) |
| 2002 |
|---|
| 32 | | Gianni Franceschini,
Roberto Grossi,
J. Ian Munro,
Linda Pagli:
Implicit B-Trees: New Results for the Dictionary Problem.
FOCS 2002: 145-154 |
| 31 |  | Jeffrey Scott Vitter,
Roberto Grossi:
Compressed Indexes for Fast Search in Sequences.
JCIS 2002: 44-48 |
| 30 | | Roberto Grossi,
Andrea Pietracaprina,
Geppino Pucci:
Optimal Deterministic Protocols for Mobile Robots on a Grid.
Inf. Comput. 173(2): 132-142 (2002) |
| 2000 |
|---|
| 29 | | Pierluigi Crescenzi,
Alberto Del Lungo,
Roberto Grossi,
Elena Lodi,
Linda Pagli,
Gianluca Rossi:
Text Sparsification via Local Maxima.
FSTTCS 2000: 290-301 |
| 28 | | 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 |
| 1999 |
|---|
| 27 | | Pierluigi Crescenzi,
Leandro Dardini,
Roberto Grossi:
IP Address Lookup Made Fast and Simple.
ESA 1999: 65-76 |
| 26 | | Roberto Grossi,
Giuseppe F. Italiano:
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures.
ICALP 1999: 372-381 |
| 25 | | 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 |
| 24 | | Roberto Grossi,
Giuseppe F. Italiano:
Efficient Splitting and Merging Algorithms for Order Decomposable Problems.
Inf. Comput. 154(1): 1-33 (1999) |
| 23 | | 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) |
| 22 | | Paolo Ferragina,
Roberto Grossi:
Improved Dynamic Text Indexing.
J. Algorithms 31(2): 291-319 (1999) |
| 21 | | 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) |
| 1998 |
|---|
| 20 | | Roberto Grossi,
Andrea Pietracaprina,
Geppino Pucci:
Optimal Deterministic Protocols for Mobile Robots on a Grid.
SWAT 1998: 181-192 |
| 19 | | Roberto Grossi,
Elena Lodi:
Simple Planar Graph Partition into Three Forests.
Discrete Applied Mathematics 84(1-3): 121-132 (1998) |
| 18 | | Paolo Ferragina,
Roberto Grossi:
Optimal On-Line Search and Sublinear Time Update in String Matching.
SIAM J. Comput. 27(3): 713-736 (1998) |
| 17 | | Paolo Ferragina,
Roberto Grossi,
Manuela Montangero:
On Updating Suffix Tree Labels.
Theor. Comput. Sci. 201(1-2): 249-262 (1998) |
| 1997 |
|---|
| 16 | | Paolo Ferragina,
Roberto Grossi,
Manuela Montangero:
A Note on Updating Suffix Tree Labels.
CIAC 1997: 181-192 |
| 15 | | Roberto Grossi,
Giuseppe F. Italiano:
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract).
ICALP 1997: 605-615 |
| 14 | | Lars Arge,
Paolo Ferragina,
Roberto Grossi,
Jeffrey Scott Vitter:
On Sorting Strings in External Memory (Extended Abstract).
STOC 1997: 540-548 |
| 13 | | 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) |
| 1996 |
|---|
| 12 | | Paolo Ferragina,
Roberto Grossi:
Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results.
SODA 1996: 373-382 |
| 11 | | 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) |
| 1995 |
|---|
| 10 | | Raffaele Giancarlo,
Roberto Grossi:
Multi-Dimensional Pattern Matching with Dimensional Wildcards.
CPM 1995: 90-101 |
| 9 | | Paolo Ferragina,
Roberto Grossi:
Optimal On-Line Search and Sublinear Time Update in String Matching.
FOCS 1995: 604-612 |
| 8 | | Raffaele Giancarlo,
Roberto Grossi:
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications.
ICALP 1995: 111-122 |
| 7 | | Paolo Ferragina,
Roberto Grossi:
Fast Incremental Text Editing.
SODA 1995: 531-540 |
| 6 | | Paolo Ferragina,
Roberto Grossi:
A fully-dynamic data structure for external substring search (Extended Abstract).
STOC 1995: 693-702 |
| 1993 |
|---|
| 5 | | Raffaele Giancarlo,
Roberto Grossi:
Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices.
SPAA 1993: 86-97 |
| 4 | | Roberto Grossi:
On Finding Commong Subtrees.
Theor. Comput. Sci. 108(2): 345-356 (1993) |
| 1991 |
|---|
| 3 | | Roberto Grossi:
A Note on the Subtree Isomorphism for Ordered Trees and Related Problems.
Inf. Process. Lett. 39(2): 81-84 (1991) |
| 2 | | Roberto Grossi:
Further Comments on the Subtree Isomorphism for Ordered Trees.
Inf. Process. Lett. 40(5): 255-256 (1991) |
| 1989 |
|---|
| 1 | | Roberto Grossi,
Fabrizio Luccio:
Simple and Efficient String Matching with k Mismatches.
Inf. Process. Lett. 33(3): 113-120 (1989) |
