Self-adjusting binary search trees
Journal of the ACM (JACM)
The pairing heap: a new form of self-adjusting heap
Algorithmica
Sequential access in splay trees takes linear time
Combinatorica
A data structure for manipulating priority queues
Communications of the ACM
Meldable heaps and boolean union-find
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Self-adjusting trees in practice for large text collections
Software—Practice & Experience
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
SIAM Journal on Computing
Improved Upper Bounds for Pairing Heaps
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Funnel Heap - A Cache Oblivious Priority Queue
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A programming and problem-solving seminar
A programming and problem-solving seminar
Distribution-sensitive data structures
Distribution-sensitive data structures
On the sequential access theorem and deque conjecture for splay trees
Theoretical Computer Science
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science
A unifying property for distribution-sensitive priority queues
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Hi-index | 0.00 |
We present a priority queue that supports insert in worst-case constant time, and delete-min, access-min, delete, and decrease of an element x in worst-case O(log(min{w"x,q"x})) time, where w"x (respectively, q"x) is the number of elements that were accessed after (respectively, before) the last access to x and are still in the priority queue at the time when the corresponding operation is performed. (An access to an element is accounted for by any priority-queue operation that involves this element.) Our priority queue then has both the working-set and the queueish properties; and, more strongly, it satisfies these properties in the worst-case sense. From the results in Iacono (2001) [11] and Elmasry et al. (2011) [7], our priority queue also satisfies the static-finger, static-optimality, and unified bounds. Moreover, we modify our priority queue to realize a new unifying property - the time-finger property - which encapsulates both the working-set and the queueish properties.