Min-max heaps and generalized priority queues
DOI10.1145/6617.6621zbMATH Open0642.68055DBLPjournals/cacm/AtkinsonSSS86OpenAlexW1966271560WikidataQ56657170 ScholiaQ56657170MaRDI QIDQ3783545FDOQ3783545
Jörg-Rüdiger Sack, N. Santoro, Michael D. Atkinson, Thomas Strothotte
Publication date: 1986
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/6617.6621
Recommendations
- Bounds for min-max heaps
- A note on constructing min-max heaps
- scientific article; zbMATH DE number 4047086
- Reflected min-Max heaps
- The relaxed min-max heap: A mergeable double-ended priority queue
- The bounds of min-max pair heap construction
- scientific article
- Buckets, Heaps, Lists, and Monotone Priority Queues
- On sorting, heaps, and minimum spanning trees
- An efficient algorithm for concurrent priority queue heaps
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)
Cited In (43)
- A Note on Bottom-Up Skew Heaps
- Optimum departure times for commuters in congested networks
- Correspondence-based data structures for double-ended priority queues
- Diamond deque: A simple data structure for priority deques
- Searching rigid data structures
- The d-deap\(^*\): a fast and simple cache-aligned d-ary deap
- The K-D heap: An efficient multi-dimensional priority queue
- On sorting, heaps, and minimum spanning trees
- Two new methods for constructing double-ended priority queues from priority queues
- Title not available (Why is that?)
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Reflected min-Max heaps
- Symmetric min-max heap: a simpler data structure for double-ended priority queue
- Global optimization of Hölder functions
- A Survey on Priority Queues
- Multidimensional heaps and complementary range searching
- A dynamic fixed windowing problem
- The relaxed min-max heap: A mergeable double-ended priority queue
- A note on constructing min-max heaps
- Recurrence relations on heaps
- The soft heap
- Total Variation on a Tree
- A note on the construction of the data structure ``deap
- A pointer-free data structure for merging heaps and min-max heaps
- Bounds for min-max heaps
- The bounds of min-max pair heap construction
- A fast algorithm for quadratic resource allocation problems with nested constraints
- Heap construction in the parallel comparison tree model
- An optimal parallel algorithm to construct a deap
- Design and implementation of a massively parallel version of DIRECT
- Ordered priority queues
- Interval Heaps
- Finding maximum likelihood estimators for the three-parameter Weibull distribution
- Fast equal and biased distance fields for medial axis transform with meshing in mind
- A new metric between polygons, and how to compute it
- Stacks, queues, and deques with order-statistic operations
- Fast meldable priority queues
- Mixed graph colorings
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
- Title not available (Why is that?)
- MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
- An efficient implicit data structure for relation testing and searching in partially ordered sets
- Title not available (Why is that?)
This page was built for publication: Min-max heaps and generalized priority queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783545)
