BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Czech Republic
1 × Finland
1 × France
1 × Hungary
1 × Latvia
1 × Portugal
1 × The Netherlands
1 × United Kingdom
2 × Italy
4 × USA
Collaborated with:
G.Franceschini G.Ottaviano G.F.Italiano P.Ferragina J.S.Vitter R.Raman R.Giancarlo G.Battaglia N.Scutellà A.Orlandi S.R.Satti R.Venturini L.Arge A.Gupta R.Shah
Talks about:
string (7) structur (4) compress (4) index (4) data (4) suffix (3) optim (3) tree (3) algorithm (2) techniqu (2)

Person: Roberto Grossi

DBLP DBLP: Grossi:Roberto

Contributed to:

ICALP (1) 20132013
PODS 20122012
CIKM 20112011
DLT 20112011
ICALP (1) 20102010
PODS 20082008
ICALP 20052005
ICALP 20042004
ICALP 20032003
STOC 20002000
ICALP 19991999
ICALP 19971997
STOC 19971997
ICALP 19951995
STOC 19951995

Wrote 15 papers:

ICALP-v1-2013-GrossiRRV #random #string
Dynamic Compressed Strings with Random Access (RG, RR, SRS, RV), pp. 504–515.
PODS-2012-GrossiO #maintenance #sequence #string
The wavelet trie: maintaining an indexed sequence of strings in compressed space (RG, GO), pp. 203–214.
CIKM-2011-OttavianoG
Semi-indexing semi-structured data in tiny space (GO, RG), pp. 1485–1494.
DLT-2011-BattagliaGS #multi #order
Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees (GB, RG, NS), pp. 58–69.
ICALP-v1-2010-GrossiOR #string #trade-off
Optimal Trade-Offs for Succinct String Indexes (RG, AO, RR), pp. 678–689.
PODS-2008-FerraginaGGSV #on the #string
On searching compressed string collections cache-obliviously (PF, RG, AG, RS, JSV), pp. 181–190.
ICALP-2005-FranceschiniG #sorting
Optimal In-place Sorting of Vectors and Records (GF, RG), pp. 90–102.
ICALP-2004-FranceschiniG #data type #string
A General Technique for Managing Strings in Comparison-Driven Data Structures (GF, RG), pp. 606–617.
ICALP-2003-FranceschiniG
Optimal Cache-Oblivious Implicit Dictionaries (GF, RG), pp. 316–331.
STOC-2000-GrossiV #array #string
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (RG, JSV), pp. 397–406.
ICALP-1999-GrossiI #data type #linked data #maintenance #multi #open data #performance
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (RG, GFI), pp. 372–381.
ICALP-1997-GrossiI #algorithm #order #performance #problem
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (RG, GFI), pp. 605–615.
STOC-1997-ArgeFGV #memory management #on the #sorting #string
On Sorting Strings in External Memory (LA, PF, RG, JSV), pp. 540–548.
ICALP-1995-GiancarloG #algorithm #matrix #on the
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications (RG, RG), pp. 111–122.
STOC-1995-FerraginaG #data type #string
A fully-dynamic data structure for external substring search (PF, RG), pp. 693–702.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.