Skip to main content

3 Result(s)

within Gianni Franceschini Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Data Structures Remove this filter Discrete Mathematics in Computer Science Remove this filter Numeric Computing 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

    Cache-Oblivious Comparison-Based Algorithms on Multisets

    We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (the mode). We are interested in minimizing...

    Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro in Algorithms – ESA 2005 (2005)

  3. No Access

    Chapter and Conference Paper

    Radix Sorting with No Extra Space

    It is well known that n integers in the range [1,n c ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1,

    Gianni Franceschini, S. Muthukrishnan, Mihai Pǎtraşcu in Algorithms – ESA 2007 (2007)