Skip to main content

3 Result(s)

within Discrete Mathematics in Computer Science Remove this filter Programming Techniques Remove this filter Gianni Franceschini 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

    Finding the Maximum Suffix with Fewer Comparisons

    It is shown how to compute the lexicographically maximum suffix of a string of n ≥ 2 characters over a totally ordered alphabet using at most (4/3)n − 5/3 three-way character comparisons. The best previous bound,...

    Gianni Franceschini, Torben Hagerup in Algorithms and Complexity (2010)