Min-max heaps and generalized priority queues
Communications of the ACM
The Deap—A double-ended heap to implement double-ended priority queues
Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
A Composite Stabilizing Data Structure
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Information Processing Letters
A Stabilizing Search Tree with Availability Properties
ISADS '01 Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems
Snap-Stabilizing optimal binary search tree
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
| Hi-index | 0.00 |
We introduce a self-stabilizing data structure, which we call either a min-max search tree or a max-min search tree (both abbreviated M2ST), depending on whether the root has the minimum or the maximum value in the tree. Our structure is a refinement of the standard min-max heap (or max-min heap), with additional property that every value in the left subtree of a node is less than or equal to every value in the right subtree of that node. The M2ST has all the power of a binary search tree and all the power of a min-max heap, combined; with the additional feature that maintaining balance is easy. We give a self-stabilizing algorithm for reorganizing the values of an asynchronous network with a binary tree topology into an M2ST in O(n) rounds. We then give an algorithm for reorganizing an asynchronous network with a binary tree topology, which is already in M2ST order, into binary search tree order in O(h) rounds. This result answers an open problem posed in [3].