Heaps on Heaps

@inproceedings{Gonnet1982HeapsOH,
  title={Heaps on Heaps},
  author={Gaston H. Gonnet and J. Ian Munro},
  booktitle={ICALP},
  year={1982}
}
As part of a study of the general issue of complexity of comparison based problems, as well as interest in the specific problem, we consider the task of performing the basic priority queue operations on a heap. We show that in the worst case: (i) log log n comparisons are necessary and sufficient to insert an element into a heap. (This improves the previous upper and lower bounds of log n and 0(1).) (ii) log n+g(n)−e(n) comparisons are necessary and sufficient to replace the… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 39 CITATIONS

Similar Papers

Loading similar papers…