#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2000

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Gianni Franceschini, Roberto Grossi
- WADS
- 2003

We close an open issue on dictionaries dating back to the sixthies. An array of n keys can be sorted so that searching takes O(log n) time. Alternatively, it can be organized as a heap so thatâ€¦ (More)

- Gianni Franceschini, S. Muthukrishnan
- ICALP
- 2007

Given string T = T [1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T [i, . . . , n] for all i. This problem is central to the construction of suffix arrays andâ€¦ (More)

- Gianni Franceschini, Roberto Grossi
- ICALP
- 2004

3. LINEAR LISTS â€¢ Stacks: LIFO structure, create, POP, PUSH, delete stack â€¢ Queues: FIFO structure Priority Queues, Circular Queues, operations on Queues â€¢ Linear List Concept â€¢ List v/s Array,â€¦ (More)

- Gianni Franceschini, J. Ian Munro
- SODA
- 2006

The implicit dictionary problem is that of maintaining a dynamic ordered set, <i>S</i>, under the operations search, insert and delete, so that the elements of <i>S</i> are stored in the firstâ€¦ (More)

- Gianni Franceschini, Viliam Geffert
- FOCS
- 2003

- Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
- J. Comput. Syst. Sci.
- 2004

An implicit data structure for the dictionary problem maintains n data values in the first n locations of an array in such a way that it efficiently supports the operations insert, delete and search.â€¦ (More)

- Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
- FOCS
- 2002

We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining n data values in the first n locations of an array in such aâ€¦ (More)

It is well known that n integers in the range [1, n] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range can be sorted in O(n âˆš log log n) time [5].â€¦ (More)

- Gianni Franceschini
- SODA
- 2004

An algorithm performs its operations in-place if it uses O(1) extra locations of main memory besides those containing the input entries. An algorithm is cache-oblivious if it is not conscious of anyâ€¦ (More)

- Gianni Franceschini, S. Muthukrishnan
- STOC
- 2007

Given a string S[1Â·s n], the suffix selection problemis to find the kth lexicographically smallest amongst the n suffixes S[iÂ·s n], for i=1,...,n. In particular, the fundamental question is ifâ€¦ (More)