Available stabilizing heaps

@article{Herman2001AvailableSH,
  title={Available stabilizing heaps},
  author={T. Herman and T. Masuzawa},
  journal={Inf. Process. Lett.},
  year={2001},
  volume={77},
  pages={115-121}
}
Abstract 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. The time complexity of each operation is O ( lg K) where K is the capacity of the data… Expand
22 Citations

Figures and Topics from this paper

A Composite Stabilizing Data Structure
  • 14
Stabilizing Replicated Search Trees
  • 1
Self-stabilizing algorithms for sorting and heapification
  • 1
Available and Stabilizing 2-3 Trees
  • 1
  • PDF
Snap-Stabilizing Optimal Binary Search Tree
  • 18
An efficient data structure for branch-and-bound algorithm
  • 1
Self-stabilizing Space Optimal Synchronization Algorithms on Trees
  • 6
On Self-stabilizing Search Trees
  • 2
Memory Management for Self-stabilizing Operating Systems
  • 13
  • PDF
Self-stabilizing Balancing Algorithm for Containment-Based Trees
  • 2
  • PDF
...
1
2
3
...

References

SHOWING 1-10 OF 14 REFERENCES
Superstabilizing mutual exclusion
  • T. Herman
  • Computer Science
  • Distributed Computing
  • 2000
  • 39
The Processor Identity Problem
  • 52
SuperStabilizing protocols for dynamic distributed systems
  • 250
  • PDF
The wakeup problem
  • 34
  • PDF
Unison in distributed networks
  • 7
  • PDF
Superstabilizing mutual exclusion, Distributed Comput
  • Superstabilizing mutual exclusion, Distributed Comput
  • 2000
Superstabilizing mutual exclusion. Distributed Computing
  • Superstabilizing mutual exclusion. Distributed Computing
  • 2000
The pro essor identity problem
  • Information Pro essing Letters
  • 2000
Superstabilizing mutual ex lusion
  • Distributed Computing
  • 1996
...
1
2
...