Paper Info
Title
An optimal algorithm for deleting the roof of a heap
Abstract
In this paper we give a small correction of the lower bound result for deleting the root of a heap in the article "Heaps on heaps" by Gonnet and Munro. We will do this by giving a slightly better algorithm and prove that it is optimal. The result is achieved by using basically the same technique as Gonnet and Munro.
Year
DOI
Venue
1991
10.1016/0020-0190(91)90144-7
Inf. Process. Lett.
Keywords
Field
DocType
optimal algorithm,priority queue,heap,upper bound,lower bound
Discrete mathematics,Combinatorics,Pairing heap,Skew heap,Upper and lower bounds,Heapsort,Algorithm,Heap (data structure),Priority queue,Binomial heap,Mathematics,d-ary heap
Journal
Volume
Issue
ISSN
37
2
0020-0190
Citations 
PageRank 
References 
9
0.96
4
Authors
1
Name
Order
Citations
PageRank
Svante Carlsson176490.17