Skip to main content

3 Result(s)

within Gianni Franceschini Remove this filter English Remove this filter Computer Graphics Remove this filter

and

  1. No Access

    Chapter and Conference Paper

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

    We close an open issue on dictionaries dating back to the sixthies. An array of n keys can be sorted so that searching takes O(log n) time. Alternatively, it can be organized as a heap so that inserting and delet...

    Gianni Franceschini, Roberto Grossi in Algorithms and Data Structures (2003)

  2. No Access

    Chapter and Conference Paper

    Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves

    We settle a long-standing open question, namely whether it is possible to sort a sequence of n elements stably (i.e. preserving the original relative order of the equal elements), using O(1) auxiliary space and p...

    Gianni Franceschini in STACS 2005 (2005)

  3. No Access

    Chapter and Conference Paper

    Sorting by Merging or Merging by Sorting?

    In the comparison model the only operations allowed on input elements are comparisons and moves to empty cells of memory. We prove the existence of an algorithm that, for any set of s ≤n sorted sequences containi...

    Gianni Franceschini in Algorithm Theory – SWAT 2006 (2006)