Skip to search form
Skip to main content
Semantic Scholar's Logo
Create Free Account
You are currently offline. Some features of the site may not work correctly.
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…
Heap (data structure)
Kinetic data structure
Semantic Scholar uses AI to extract papers important to this topic.
Kinetic heap-ordered trees: Tight analysis and improved algorithms
G. D. D. Fonseca
C. M. Figueiredo
Inf. Process. Lett.
Corpus ID: 17421456
The most natural kinetic data structure for maintaining the maximum of a collection of continuously changing numbers is the…
Faster kinetic heaps and their use in broadcast scheduling
Corpus ID: 2168100
We describe several implementations of the kinetic heap, a heap (priority queue) in which the key of each item, instead of being…
Corpus ID: 212680487
Because Heapsort was the one major sorting algorithm without a corresponding planar convex hull algorithm, we present a planar…
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Terms of Service
ACCEPT & CONTINUE