Available Stabilizing Heaps

Details Available Stabilizing Heaps Available Stabilizing Heaps

2000-11-30

arxiv.org/abs/cs/0011046v1

Computer Science

Distributed, Parallel, and Cluster Computing

10 pages

Scientific paper

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 guarantee 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. The time complexity of each operation is O(lg K) where K is the capacity of the data structure; when the heap's state is legitimate the time complexity is O(lg n) for n equal to the number items in the heap.

Affiliated with

Also associated with

No associations

Rating

Available Stabilizing Heaps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Available Stabilizing Heaps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Available Stabilizing Heaps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-459782