Gianni Franceschini

Available identifiers

Publication	Date of Publication	Type
No sorting? Better searching!	2018-11-05	Paper
Proximity MergeSort, optimal in-place sorting in the cache-oblivious model	2015-08-03	Paper
Managing unbounded-length keys in comparison-driven data structures with applications to online indexing	2014-11-14	Paper
Finding the maximum suffix with fewer comparisons	2011-08-23	Paper
Implicit dictionaries with O(1) modifications per update and fast search	2010-08-16	Paper
Finding the maximum suffix with fewer comparisons	2010-05-28	Paper
Optimal worst-case operations for implicit cache-oblivious search trees.	2010-04-20	Paper
An in-place sorting with O ( n log n ) comparisons and O ( n ) moves	2008-12-21	Paper
Sorting by Merging or Merging by Sorting?	2007-09-07	Paper
Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves	2007-08-23	Paper
Dense trees: a new look at degenerate graphs	2006-10-31	Paper
Optimal implicit dictionaries over unbounded universes	2006-10-25	Paper
Algorithms – ESA 2005	2006-06-27	Paper
Automata, Languages and Programming	2006-01-10	Paper
STACS 2005	2005-12-02	Paper
Automata, Languages and Programming	2005-08-24	Paper
Implicit \(B\)-trees: A new data structure for the dictionary problem	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4471357	2004-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4449185	2004-02-08	Paper

This page was built for person: Gianni Franceschini