Skip to main content

2 Result(s)

within John Iacono Remove this filter Mathematics Remove this filter Applications of Mathematics Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Queaps

    We present a new priority queue data structure, the queap, that executes insertion in O(1) amortized time and Extract-min in O(log(k + 2)) amortized time if there are k items that have been in the heap longer tha...

    John Iacono, Stefan Langerman2 in Algorithms and Computation (2002)

  2. No Access

    Chapter and Conference Paper

    Key Independent Optimality

    A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, key-independent optimality, is motivated by applications that assign key values randomly. It is shown t...

    John Iacono in Algorithms and Computation (2002)