Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2003
2003
The most natural kinetic data structure for maintaining the maximum of a collection of continuously changing numbers is the… Expand
  • figure 1
Is this relevant?
2001
2001
We describe several implementations of the kinetic heap, a heap (priority queue) in which the key of each item, instead of being… Expand
Is this relevant?
2001
2001
Because Heapsort was the one major sorting algorithm without a corresponding planar convex hull algorithm, we present a planar… Expand
  • figure 2
  • figure 3
Is this relevant?