The complexity of implicit and space-efficient priority queues
| Venue: | Proceedings of the 9th Workshop on Algorithms and Data Structures, Lecture |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Mortensen_thecomplexity,
author = {Christian W. Mortensen and Seth Pettie},
title = {The complexity of implicit and space-efficient priority queues},
booktitle = {Proceedings of the 9th Workshop on Algorithms and Data Structures, Lecture},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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.
Citations
| 149 | S: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets - Raman, Raman, et al. |
| 29 | An implicit binomial queue with constant insertion time - Carlsson, Munro, et al. - 1988 |
| 20 | The pairing heap: a new form of self adjusting heap, Algorithmica 1(1 - Fredman, Sedgewick, et al. - 1986 |
| 12 | New heap data structures - Kaplan, Tarjan - 1999 |
| 7 | Tight bounds for searching a sorted array of strings - Andersson, Hagerup, et al. |
| 3 | R.: An efficient quasidictionary - Hagerup, Raman - 2002 |
| 1 | 25. Rasmus Pagh. Low redundancy in static dictionaries with constant query time - Sci - 1980 |
