Decomposition of k-Dense Trees. - Lino Flores Pacheco; Gianni Franceschini; Fabrizio Luccio; Linda Pagli (WDAS, 2000)

Implicit B-Trees: New Results for the Dictionary Problem. - Gianni Franceschini; Roberto Grossi; J. Ian Munro; Linda Pagli (FOCS, 2002)

An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. - Gianni Franceschini; Viliam Geffert (FOCS, 2003)

Optimal Cache-Oblivious Implicit Dictionaries. - Gianni Franceschini; Roberto Grossi (ICALP, 2003)

Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. - Gianni Franceschini; Roberto Grossi (SODA, 2003)

Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. - Gianni Franceschini; Roberto Grossi (WADS, 2003)

A General Technique for Managing Strings in Comparison-Driven Data Structures. - Gianni Franceschini; Roberto Grossi (ICALP, 2004)

Proximity Mergesort: optimal in-place sorting in the cache-oblivious model. - Gianni Franceschini (SODA, 2004)

Implicit B-trees: a new data structure for the dictionary problem. - Gianni Franceschini; Roberto Grossi; J. Ian Munro; Linda Pagli (J. Comput. Syst. Sci., 2004)

Cache-Oblivious Comparison-Based Algorithms on Multisets. - Arash Farzan; Paolo Ferragina; Gianni Franceschini; J. Ian Munro (ESA, 2005)

Optimal In-place Sorting of Vectors and Records. - Gianni Franceschini; Roberto Grossi (ICALP, 2005)

An in-place sorting with O(nlog n) comparisons and O(n) moves. - Gianni Franceschini; Viliam Geffert (J. ACM, 2005)

Implicit dictionaries with O(1) modifications per update and fast search. - Gianni Franceschini; J. Ian Munro (SODA, 2006)

Sorting by Merging or Merging by Sorting? - Gianni Franceschini (SWAT, 2006)

Dense trees: a new look at degenerate graphs. - Gianni Franceschini; Fabrizio Luccio; Linda Pagli (J. Discrete Algorithms, 2006)

Optimal Implicit Dictionaries over Unbounded Universes. - Gianni Franceschini; Roberto Grossi (Theory Comput. Syst., 2006)

Radix Sorting with No Extra Space. - Gianni Franceschini; S. Muthukrishnan 001; Mihai Patrascu (ESA, 2007)

In-Place Suffix Sorting. - Gianni Franceschini; S. Muthukrishnan 001 (ICALP, 2007)

Optimal suffix selection. - Gianni Franceschini; S. Muthukrishnan 001 (STOC, 2007)

Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves. - Gianni Franceschini (Theory Comput. Syst., 2007)

No sorting? better searching! - Gianni Franceschini; Roberto Grossi (ACM Trans. Algorithms, 2008)

Optimal Cache-Aware Suffix Selection. - Gianni Franceschini; Roberto Grossi; S. Muthukrishnan 001 (STACS, 2009)

Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection - Gianni Franceschini; Roberto Grossi; S. Muthukrishnan 001 (CoRR, 2011)

Finding the maximum suffix with fewer comparisons. - Gianni Franceschini; Torben Hagerup (J. Discrete Algorithms, 2011)

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. - Amihood Amir; Gianni Franceschini; Roberto Grossi; Tsvi Kopelowitz; Moshe Lewenstein; Noa Lewenstein (CoRR, 2013)

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. - Amihood Amir; Gianni Franceschini; Roberto Grossi; Tsvi Kopelowitz; Moshe Lewenstein; Noa Lewenstein (SIAM J. Comput., 2014)