Gianni Franceschini

Publication Activity (10 Years)

Years Active: 2000-2014
Publications (10 Years): 0

Top Topics

Indexing Scheme

Content Based Retrieval

Top Venues

SIAM J. Comput.

Publications

Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43 (4) (2014)
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR (2013)
Gianni Franceschini, Torben Hagerup
Finding the maximum suffix with fewer comparisons. J. Discrete Algorithms 9 (3) (2011)
Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection CoRR (2011)
Gianni Franceschini, Torben Hagerup
Finding the Maximum Suffix with Fewer Comparisons. CIAC (2010)
Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
Optimal cache-aware suffix selection CoRR (2009)
Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
Optimal Cache-Aware Suffix Selection. STACS (2009)
Gianni Franceschini, Roberto Grossi
No sorting? better searching! ACM Trans. Algorithms 4 (1) (2008)
Gianni Franceschini, S. Muthukrishnan
In-Place Suffix Sorting. ICALP (2007)
Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu
Radix Sorting with No Extra Space. ESA (2007)
Gianni Franceschini, S. Muthukrishnan
Optimal suffix selection. STOC (2007)
Gianni Franceschini
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves. Theory Comput. Syst. 40 (4) (2007)
Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu
Radix Sorting With No Extra Space CoRR (2007)
Gianni Franceschini, Fabrizio Luccio, Linda Pagli
Dense trees: a new look at degenerate graphs. J. Discrete Algorithms 4 (3) (2006)
Gianni Franceschini, J. Ian Munro
(1) modifications per update and fast search. SODA (2006)
Gianni Franceschini
Sorting by Merging or Merging by Sorting? SWAT (2006)
Gianni Franceschini, Roberto Grossi
Optimal Implicit Dictionaries over Unbounded Universes. Theory Comput. Syst. 39 (2) (2006)
Gianni Franceschini, Viliam Geffert
) moves. J. ACM 52 (4) (2005)
Gianni Franceschini
Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves. STACS (2005)
Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro
Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA (2005)
Gianni Franceschini, Roberto Grossi
Optimal In-place Sorting of Vectors and Records. ICALP (2005)
Gianni Franceschini
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model. SODA (2004)
Gianni Franceschini, Roberto Grossi
A General Technique for Managing Strings in Comparison-Driven Data Structures. ICALP (2004)
Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
-trees: a new data structure for the dictionary problem. J. Comput. Syst. Sci. 68 (4) (2004)
Gianni Franceschini, Roberto Grossi
No Sorting? Better Searching! FOCS (2004)
Gianni Franceschini, Roberto Grossi
Optimal Cache-Oblivious Implicit Dictionaries. ICALP (2003)
Gianni Franceschini, Roberto Grossi
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. SODA (2003)
Gianni Franceschini, Viliam Geffert
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves CoRR (2003)
Gianni Franceschini, Viliam Geffert
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. FOCS (2003)
Gianni Franceschini, Roberto Grossi
Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. WADS (2003)
Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
Implicit B-Trees: New Results for the Dictionary Problem. FOCS (2002)
Lino Flores Pacheco, Gianni Franceschini, Fabrizio Luccio, Linda Pagli
Decomposition of k-Dense Trees. WDAS (2000)