Roberto Grossi

	2012
88		Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni: A Taste of Yeast Mobilomics. BIOINFORMATICS 2012: 271-274
87		Roberto Grossi, Giuseppe Ottaviano: The wavelet trie: maintaining an indexed sequence of strings in compressed space. PODS 2012: 203-214
86		Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino: On Computing the Diameter of Real-World Directed (Weighted) Graphs. SEA 2012: 99-110
85		Roberto Grossi, Giuseppe Ottaviano: The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space CoRR abs/1204.3581: (2012)
	2011
84		Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri: String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings Springer 2011
83		Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni: Inferring Mobile Elements in S. Cerevisiae Strains. BIOINFORMATICS 2011: 131-136
82		Roberto Grossi, Jeffrey Scott Vitter, Bojian Xu: Wavelet Trees: From Theory to Practice. CCP 2011: 210-221
81		Giuseppe Ottaviano, Roberto Grossi: Semi-indexing semi-structured data in tiny space. CIKM 2011: 1485-1494
80		Dany Breslauer, Roberto Grossi, Filippo Mignosi: Simple Real-Time Constant-Space String Matching. CPM 2011: 173-183
79		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
78		Rui A. Ferreira, Roberto Grossi, Romeo Rizzi: Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. ESA 2011: 275-286
77		Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann: Optimal Packed String Matching. FSTTCS 2011: 423-432
76		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
75		Giovanni Battaglia, Roberto Grossi, Noemi Scutellà: Consecutive Ones Property and PQ-Trees for Multisets: Hardness of Counting Their Orderings CoRR abs/1102.0041: (2011)
74		Gianni Franceschini, Roberto Grossi, S. Muthukrishnan: Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection CoRR abs/1110.3381: (2011)
73		Roberto Grossi, Giuseppe Ottaviano: Fast Compressed Tries through Path Decompositions CoRR abs/1111.5220: (2011)
72		Roberto Grossi: A quick tour on suffix arrays and compressed suffix arrays. Theor. Comput. Sci. 412(27): 2964-2973 (2011)
	2010
71		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
70		Roberto Grossi, Alessio Orlandi, Giuseppe Ottaviano: Fun with Olympiad in Algorithmics. FUN 2010: 1-2
69		Roberto Grossi, Alessio Orlandi, Rajeev Raman: Optimal Trade-Offs for Succinct String Indexes. ICALP (1) 2010: 678-689
68		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)
67		Roberto Grossi, Alessio Orlandi, Rajeev Raman: Optimal Trade-Off for Succinct String Indexes CoRR abs/1006.5354: (2010)
	2009
66		Roberto Grossi: Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. CPM 2009: 39-40
65		Giovanni Battaglia, Roberto Grossi, Roberto Marangoni, Nadia Pisanti: Mining Biological Sequences with Masks. DEXA Workshops 2009: 193-197
64		Gianni Franceschini, Roberto Grossi, S. Muthukrishnan: Optimal Cache-Aware Suffix Selection. STACS 2009: 457-468
63		Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao: More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. STACS 2009: 517-528
62		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
61		Gianni Franceschini, Roberto Grossi, S. Muthukrishnan: Optimal cache-aware suffix selection CoRR abs/0902.1737: (2009)
60		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)
59		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)
	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)

Coauthor Index

1	Lars Arge	[14]
2	Giovanni Battaglia	[59] [65] [75] [79] [83] [88]
3	Alessandro Bellini	[25]
4	Oren Ben-Kiki	[77]
5	Iwona Bialynicka-Birula	[49] [54]
6	Philip Bille	[77]
7	Dany Breslauer	[77] [80]
8	Davide Cangelosi	[59]
9	Pierluigi Crescenzi (Pilu Crescenzi)	[27] [29] [33] [34] [71] [76] [86]
10	Maxime Crochemore	[38] [45] [47]
11	Leandro Dardini	[27]
12	Chiara Epifanio	[45]
13	Paolo Ferragina	[6] [7] [9] [12] [14] [16] [17] [18] [22] [23] [51] [58]
14	Rui A. Ferreira (Rui André Ferreira, Rui André Augusto Ferreira)	[78]
15	Luca Foschini	[44] [53]
16	Gianni Franceschini	[32] [35] [37] [39] [40] [42] [43] [50] [52] [57] [61] [64] [74]
17	Leszek Gasieniec	[77]
18	Filippo Geraci	[48]
19	Raffaele Giancarlo	[5] [8] [10] [11] [13] [21]
20	Alexander Golynski	[56]
21	Fabio Gori	[25]
22	Marco Guarducci	[25]
23	Ankur Gupta	[36] [41] [44] [53] [56] [58]
24	Claudio Imbrenda	[71]
25	Giuseppe F. Italiano	[15] [24] [26] [34]
26	Leonardo Lanzi	[71] [76] [86]
27	Elena Lodi	[19] [29] [33]
28	Fabrizio Luccio	[1] [51]
29	Alberto Del Lungo	[25] [29] [33]
30	Roberto Marangoni	[65] [83] [88]
31	Andrea Marino	[71] [76] [86]
32	Giulia Menconi	[83] [88]
33	Filippo Mignosi	[45] [80]
34	Manuela Montangero	[16] [17]
35	J. Ian Munro	[32] [40]
36	S. Muthukrishnan (S. Muthu Muthukrishnan)	[61] [64] [74]
37	Alessio Orlandi	[60] [63] [67] [69] [70]
38	Giuseppe Ottaviano	[70] [73] [81] [85] [87]
39	Linda Pagli	[29] [32] [33] [40]
40	Andrea Pietracaprina	[20] [30] [62] [68]
41	Nadia Pisanti	[38] [47] [59] [62] [65] [68] [83] [88]
42	Geppino Pucci	[20] [30] [62] [68]
43	Rajeev Raman	[56] [60] [63] [67] [69]
44	S. Srinivasa Rao (Srinivasa Rao Satti)	[56] [60] [63]
45	Romeo Rizzi	[78]
46	Gianluca Rossi	[29] [33]
47	Kunihiko Sadakane	[55]
48	Marie-France Sagot	[38] [47]
49	Noemi Scutellà	[75] [79]
50	Fabrizio Sebastiani	[84]
51	Rahul Shah	[58]
52	Fabrizio Silvestri	[84]
53	Eli Upfal	[62] [68]
54	Fabio Vandin	[62] [68]
55	Jeffrey Scott Vitter	[14] [28] [31] [36] [41] [44] [46] [53] [58] [82]
56	Oren Weimann	[77]
57	Bojian Xu	[82]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page