The following pages link to Gianni Franceschini (Q598253):
Displayed 19 items.
- Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
- Finding the maximum suffix with fewer comparisons (Q635741) (← links)
- Dense trees: a new look at degenerate graphs (Q849635) (← links)
- Optimal implicit dictionaries over unbounded universes (Q2432542) (← links)
- Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves (Q2643133) (← links)
- Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing (Q2929702) (← links)
- An in-place sorting with <i>O</i> ( <i>n</i> log <i>n</i> ) comparisons and <i>O</i> ( <i>n</i> ) moves (Q3546298) (← links)
- Finding the Maximum Suffix with Fewer Comparisons (Q3563013) (← links)
- Implicit dictionaries with <i>O</i>(1) modifications per update and fast search (Q3581495) (← links)
- (Q4449185) (← links)
- (Q4471357) (← links)
- No sorting? better searching! (Q4962694) (← links)
- Automata, Languages and Programming (Q5466498) (← links)
- Algorithms – ESA 2005 (Q5475842) (← links)
- (Q5501270) (← links)
- STACS 2005 (Q5710714) (← links)
- Automata, Languages and Programming (Q5716846) (← links)
- Sorting by Merging or Merging by Sorting? (Q5757879) (← links)
- Algorithms and Data Structures (Q5900747) (← links)