Showing papers on "Binary heap published in 1986"
TL;DR: A new form of heap is described, intended to be competitive with the Fibonacci heap in theory and easy to implement and fast in practice, and a partial complexity analysis of pairing heaps is provided.
Abstract: Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue) called theFibonacci heap. Although theoretically efficient, Fibonacci heaps are complicated to implement and not as fast in practice as other kinds of heaps. In this paper we describe a new form of heap, called thepairing heap, intended to be competitive with the Fibonacci heap in theory and easy to implement and fast in practice. We provide a partial complexity analysis of pairing heaps. Complete analysis remains an open problem.
243 citations
TL;DR: This paper describes an implementation of deques with heap order for which the worst-case time per operation is O(1), where n is the number of items on the deque.
44 citations
TL;DR: An algorithm to implement an algorithm to solve the problem of the limited size of the heap and the difficulty in creating copies of complex multi‐linked structures in Pascal by writing the appropriate segment of memory to a file on disk.
Abstract: Two problems involving the use of dynamic lists in Pascal are (1) the limited size of the heap and (2) the difficulty in creating copies of complex multi-linked structures. Both these problems can be solved by writing the appropriate segment of memory to a file on disk. The heap segment may then be released. To recover the structure during a later phase of processing, the contents of the file can be transferred back onto the heap. This paper presents an algorithm to implement this solution.
3 citations