Gianni Franceschini

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