Gianni Franceschini

According to our database, Gianni Franceschini authored at least 26 papers between 2000 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2014

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

2013

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

2011

Finding the maximum suffix with fewer comparisons.

Gianni Franceschini, Torben Hagerup

J. Discrete Algorithms, 2011

Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection

Gianni Franceschini, Roberto Grossi, S. Muthukrishnan

CoRR, 2011

2009

Optimal Cache-Aware Suffix Selection.

Gianni Franceschini, Roberto Grossi, S. Muthukrishnan

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

No sorting? better searching!

Gianni Franceschini, Roberto Grossi

ACM Trans. Algorithms, 2008

2007

Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves.

Gianni Franceschini

Theory Comput. Syst., 2007

Optimal suffix selection.

Gianni Franceschini, S. Muthukrishnan

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

In-Place Suffix Sorting.

Gianni Franceschini, S. Muthukrishnan

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Radix Sorting with No Extra Space.

Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu

Proceedings of the Algorithms, 2007

2006

Optimal Implicit Dictionaries over Unbounded Universes.

Gianni Franceschini, Roberto Grossi

Theory Comput. Syst., 2006

Dense trees: a new look at degenerate graphs.

Gianni Franceschini, Fabrizio Luccio, Linda Pagli

J. Discrete Algorithms, 2006

Sorting by Merging or Merging by Sorting?

Gianni Franceschini

Proceedings of the Algorithm Theory, 2006

Implicit dictionaries with <i>O</i>(1) modifications per update and fast search.

Gianni Franceschini, J. Ian Munro

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

An in-place sorting with <i>O</i>(<i>n</i>log <i>n</i>) comparisons and <i>O</i>(<i>n</i>) moves.

Gianni Franceschini, Viliam Geffert

J. ACM, 2005

Optimal In-place Sorting of Vectors and Records.

Gianni Franceschini, Roberto Grossi

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Cache-Oblivious Comparison-Based Algorithms on Multisets.

Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro

Proceedings of the Algorithms, 2005

2004

Implicit <i>B</i>-trees: a new data structure for the dictionary problem.

Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli

J. Comput. Syst. Sci., 2004

Proximity Mergesort: optimal in-place sorting in the cache-oblivious model.

Gianni Franceschini

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A General Technique for Managing Strings in Comparison-Driven Data Structures.

Gianni Franceschini, Roberto Grossi

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees.

Gianni Franceschini, Roberto Grossi

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time.

Gianni Franceschini, Roberto Grossi

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Optimal Cache-Oblivious Implicit Dictionaries.

Gianni Franceschini, Roberto Grossi

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

An In-Place Sorting with O(n log n) Comparisons and O(n) Moves.

Gianni Franceschini, Viliam Geffert

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002

Implicit B-Trees: New Results for the Dictionary Problem.

Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2000

Decomposition of k-Dense Trees.

Lino Flores Pacheco, Gianni Franceschini, Fabrizio Luccio, Linda Pagli

Proceedings of the Distributed Data & Structures 3, 2000