Writing portable programs that perform well on multiple platforms or for varying input sizes
and types can be very difficult because performance is often sensitive to the system …

We introduce a framework for reducing the number of element comparisons performed in
priority-queue operations. In particular, we give a priority queue which guarantees the worst …

Quicksort was first introduced in 1961 by Hoare. Many variants have been developed, the
best of which are among the fastest generic-sorting algorithms available, as testified by the …

We introduce a framework for reducing the number of comparisons performed in the deletion
and minimum deletion operations for priority queues. In particular, we give a priority queue …

A new adaptive sorting algorithm is introduced. The new implementation relies on using the
traditional AVL trees, and has the same performance limitations. More precisely, the number …

Well-known measures of presortedness, among others, are the number of inversions
needed to sort the input sequence, or the minimal number of blocks of consecutive elements …

We study the performance of the most practical inversion-sensitive internal sorting
algorithms. Experimental results illustrate that adaptive AVL sort consumes the fewest …

In this paper we introduce two efficient priority queues. For both, insert requires O (1)
amortized time and extract-min O(\lgn) worst-case time including at most \lgn+O(1) element …

We introduce a framework for reducing the number of element comparisons performed in
priority-queue operations. In particular, we give a priority queue which guarantees the worst …

We study problems in computational geometry from the viewpoint of adaptive algorithms.
Adaptive algorithms have been extensively studied for the sorting problem, and in this paper …