Min-max heaps and generalized priority queues
From MaRDI portal
Publication:3783545
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; zbMATH DE number 4147479
- Buckets, Heaps, Lists, and Monotone Priority Queues
- On sorting, heaps, and minimum spanning trees
- An efficient algorithm for concurrent priority queue heaps
Cited in
(43)- A fast algorithm for quadratic resource allocation problems with nested constraints
- An optimal parallel algorithm to construct a deap
- A note on the construction of the data structure ``deap
- Stacks, queues, and deques with order-statistic operations
- Reflected min-Max heaps
- Design and implementation of a massively parallel version of DIRECT
- scientific article; zbMATH DE number 4047086 (Why is no real title available?)
- A Note on Bottom-Up Skew Heaps
- An efficient implicit data structure for relation testing and searching in partially ordered sets
- The d-deap\(^*\): a fast and simple cache-aligned d-ary deap
- Symmetric min-max heap: a simpler data structure for double-ended priority queue
- scientific article; zbMATH DE number 4046029 (Why is no real title available?)
- A pointer-free data structure for merging heaps and min-max heaps
- Searching rigid data structures
- The relaxed min-max heap: A mergeable double-ended priority queue
- Heap construction in the parallel comparison tree model
- Ordered priority queues
- Fast meldable priority queues
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Interval Heaps
- Total variation on a tree
- Correspondence-based data structures for double-ended priority queues
- scientific article; zbMATH DE number 2111732 (Why is no real title available?)
- Mixed graph colorings
- Diamond deque: A simple data structure for priority deques
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
- Global optimization of Hölder functions
- The soft heap
- Finding maximum likelihood estimators for the three-parameter Weibull distribution
- A note on constructing min-max heaps
- On sorting, heaps, and minimum spanning trees
- Recurrence relations on heaps
- The bounds of min-max pair heap construction
- Multidimensional heaps and complementary range searching
- A new metric between polygons, and how to compute it
- Mergeable double-ended priority queues
- A survey on priority queues
- Fast equal and biased distance fields for medial axis transform with meshing in mind
- The K-D heap: An efficient multi-dimensional priority queue
- Bounds for min-max heaps
- A dynamic fixed windowing problem
- Optimum departure times for commuters in congested networks
- Two new methods for constructing double-ended priority queues from priority queues
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)