#### Filter Results:

- Full text PDF available (36)

#### Publication Year

1991

2018

- This year (5)
- Last 5 years (33)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Paolo Ferragina, Giovanni Manzini
- FOCS
- 2000

In this paper we address the issue of compressing and indexing data. We devise a data structure whose space occupancy is a function of the entropy of the underlying data set. We call the dataâ€¦ (More)

- Giovanni Manzini, Paolo Ferragina
- Algorithmica
- 2004

In this paper we describe a new algorithm for building the suffix array of a string. This task is equivalent to the problem of lexicographically sorting all the suffixes of the input string. Ourâ€¦ (More)

- Paolo Ferragina, Giovanni Manzini
- SODA
- 2001

The size of electronic data is currently growing at a faster rate than computer memory and disk storage capacities. For this reason compression appears always as an attractive choice, if notâ€¦ (More)

- S. Rao Kosaraju, Giovanni Manzini
- SIAM J. Comput.
- 1999

- Paolo Ferragina, Giovanni Manzini, Veli MÃ¤kinen, Gonzalo Navarro
- ACM Trans. Algorithms
- 2007

Given a sequence <i>S</i> = <i>s</i><sub>1</sub><i>s</i><sub>2</sub>â€¦<i>s</i><sub><i>n</i></sub> of integers smaller than <i>r</i> = <i>O</i>(polylog(<i>n</i>)), we show how <i>S</i> can beâ€¦ (More)

- Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan
- 46th Annual IEEE Symposium on Foundations ofâ€¦
- 2005

Consider an ordered, static tree /spl Tscr/ on t nodes where each node has a label from alphabet set /spl Sigma/. Tree /spl Tscr/ may be of arbitrary degree and of arbitrary shape. Say, we wish toâ€¦ (More)

- Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan
- J. ACM
- 2009

Consider an ordered, static tree T where each node has a label from alphabet Î£. Tree T may be of arbitrary degree and shape. Our goal is designing a compressed storage scheme of T that supports basicâ€¦ (More)

- Giovanni Manzini, Marcella Rastero
- Softw., Pract. Exper.
- 2004

In this paper we describe a new DNA compression algorithm. It is well known that one of the main features of DNA sequences is that they contain substrings which are duplicated except for a few randomâ€¦ (More)

The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bottleneck inâ€¦ (More)

We provide a general boosting technique for Textual Data Compression. Qualitatively, it takes a good compression algorithm and turns it into an algorithm with a better compression performanceâ€¦ (More)