Skip to search formSkip to main contentSkip to account menu

Kinetic heap

A Kinetic Heap is a kinetic data structure, obtained by the kinetization of a heap. It is designed to store elements (keys associated with priorities… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
We describe several implementations of the kinetic heap, a heap (priority queue) in which the key of each item, instead of being… 
2001
2001
Because Heapsort was the one major sorting algorithm without a corresponding planar convex hull algorithm, we present a planar…