Min-max heaps and generalized priority queues

Authors:
M. D. Atkinson;J.-R. Sack;N. Santoro;T. Strothotte
Affiliations:
Carleton Univ., Ottawa, Ont., Canada;Carleton Univ., Ottawa, Ont., Canada;Carleton Univ., Ottawa, Ont., Canada;Univ. Stuttgart, Stuttgart, W. Germany
Venue:
Communications of the ACM
Year:
1986

Citing 7
Cited 16

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Algorithm 245: Treesort

Communications of the ACM
Handbook of Algorithms

Handbook of Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Heaps on Heaps

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Implicit data structures (Preliminary Draft)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A new class of priority queue organizations

A new class of priority queue organizations

Weight-biased leftist trees and modified skip lists

Journal of Experimental Algorithmics (JEA)
An Efficient General In-Place Parallel Sorting Scheme

The Journal of Supercomputing
Correspondence-based data structures for double-ended priority queues

Journal of Experimental Algorithmics (JEA)
Generalized Convex Multiplicative Programming via QuasiconcaveMinimization

Journal of Global Optimization
Optimal Parallel Initialization Algorithms for a Class of Priority Queues

IEEE Transactions on Parallel and Distributed Systems
Reflected min-max heaps

Information Processing Letters
Navigation piles with applications to sorting, priority queues, and priority deques

Nordic Journal of Computing
The d-deap: a fast and simple cache-aligned d-ary deap

Information Processing Letters
Multidimensional heaps and complementary range searching

Information Processing Letters
Design and implementation of a massively parallel version of DIRECT

Computational Optimization and Applications
Efficient algorithms for exact ranked twig-pattern matching over graphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
The d-deap*: a fast and simple cache-aligned d-ary deap

Information Processing Letters
A web personalizing technique using adaptive data structures: The case of bursts in web visits

Journal of Systems and Software
On self-stabilizing search trees

DISC'06 Proceedings of the 20th international conference on Distributed Computing
An in-place min-max priority search tree

Computational Geometry: Theory and Applications
Efficient multidimensional aggregation for large scale monitoring

lisa'12 Proceedings of the 26th international conference on Large Installation System Administration: strategies, tools, and techniques

Quantified Score

Hi-index	48.22

Visualization

Abstract

A simple implementation of double-ended priority queues is presented. The proposed structure, called a min-max heap, can be built in linear time; in contrast to conventional heaps, it allows both FindMin and FindMax to be performed in constant time; Insert, DeleteMin, and DeleteMax operations can be performed in logarithmic time. Min-max heaps can be generalized to support other similar order-statistics operations efficiently (e.g., constant time FindMedian and logarithmic time DeleteMedian); furthermore, the notion of min-max ordering can be extended to other heap-ordered structures, such as leftist trees.