We propose the post-order heap, a new data structure for implementing priority queues. Our structure is a simple variant of the binary heap that requires only Θ(1) amortized time for Insert operations and O(log n) time in the worst case for Delete-Min operations. Like the binary heap, the post-order heap is an implicit data structure, meaning that a structure containing n elements can be stored...

The priority queue is an useful data structure in computation. There currently exist many implementations of this data structure, including some that are cache-aware and some cache-oblivious. In this study, we compare the performance of several implementations of priority queues in Dijkstra’s Single Source Shortest Path algorithm. We compare high performance heaps, such as the 4ary Aligned Heap...

This manuscript describes a method that is based on the implementation and setup of mechatronic system can recognize detect, through thermal analysis, zones where heap leaching piles may become locally saturated. Such condition could trigger potential liquefaction, generating local or general collapse in pile. In order to reduce this danger, therefore achieve full stability pile, irrigation mus...

Heap security has been a major concern since the past two decades. Recently many methods have been proposed to secure heap i.e. to avoid heap overrun and attacks. The paper describes a method suggested to secure heap at the operating system level. Major emphasis is given to Solaris operating system’s dynamic memory manager. When memory is required dynamically during runtime, the SysVmalloc acts...

This paper describes a heap construction that supports insert and delete operations in arbitrary (possibly illegitimate) states. After any sequence of at most O(m) heap operations, the heap state is guaranteed to be legitimate, where m is the initial number of items in the heap. The response from each operation is consistent with its effect on the data structure, even for illegitimate states. T...

We present a planar convex hull algorithm, Heaphull, whose main data structure is a kinetic heap. We can limit the number of times a point needs to move up in the heap to establish that O(n lg n) heap operations are sufficient; the event queue for the kinetic structure brings the running time to O(n lg n). We also report on experiments.

A weak heap is a variant of a binary heap where, for each node, the heap ordering is enforced only for one of its two children. In 1993, Dutton showed that this data structure yields a simple worstcase-efficient sorting algorithm. In this paper we review the refinements proposed to the basic data structure that improve the efficiency even further. Ultimately, minimum and insert operations are s...

This paper describes a heap construction that supports insert and delete operations in arbitrary (possibly illegitimate) states. After any sequence of at most O(m) heap operations, the heap state is guaranteed to be legitimate, where m is the initial number of items in the heap. The response from each operation is consistent with its effect on the data structure, even for illegitimate states. T...

AM-heap is a heap data structure with O(1) amortized insertion time and O(logn) deletion time complexities. This paper presents cache-aligned 4-ary AM-heap in which every node has four children except that the root has three children. In this heap, the leftmost node of each sibling has an index of a multiple of four. Also, every node index matches its corresponding array index and every sibling...