The pairing heap: a new form of self-adjusting heap
Algorithmica
An implicit data structure supporting insertion, deletion, and search in O(log:OS2:OEn) time
Journal of Computer and System Sciences
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
An implicit binomial queue with constant insertion time
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Journal of the ACM (JACM)
Computing efficiently using weak random sources
Computing efficiently using weak random sources
SIAM Journal on Computing
On the efficiency of pairing heaps and related data structures
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Membership in Constant Time and Almost-Minimum Space
SIAM Journal on Computing
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Low Redundancy in Static Dictionaries with Constant Query Time
SIAM Journal on Computing
Tight Bounds for Searching a Sorted Array of Strings
SIAM Journal on Computing
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Improved Upper Bounds for Pairing Heaps
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Resizable Arrays in Optimal Time and Space
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Journal of Computer and System Sciences
Succinct dynamic dictionaries and trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.01 |
In this paper we study the time-space complexity of implicit priority queues supporting the decreasekey operation. Our first result is that by using one extra word of storage it is possible to match the performance of Fibonacci heaps: constant amortized time for insert and decreasekey and logarithmic time for deletemin. Our second result is a lower bound showing that that one extra word really is necessary. We reduce the decreasekey operation to a cell-probe type game called the Usher's Problem, where one must maintain a simple data structure without the aid of any auxiliary storage.