Min-max heaps and generalized priority queues
From MaRDI portal
Publication:3783545
DOI10.1145/6617.6621zbMath0642.68055OpenAlexW1966271560WikidataQ56657170 ScholiaQ56657170MaRDI QIDQ3783545
Jörg-Rüdiger Sack, Thomas Strothotte, Nicola Santoro, Michael D. Atkinson
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
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)
Related Items
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 ⋮ Two new methods for constructing double-ended priority queues from priority queues ⋮ Finding maximum likelihood estimators for the three-parameter Weibull distribution ⋮ Heap construction in the parallel comparison tree model ⋮ Multidimensional heaps and complementary range searching ⋮ Fast meldable priority queues ⋮ The K-D heap: An efficient multi-dimensional priority queue ⋮ Bounds for min-max heaps ⋮ An optimal parallel algorithm to construct a deap ⋮ Total Variation on a Tree ⋮ Mixed graph colorings ⋮ Recurrence relations on heaps ⋮ Global optimization of Hölder functions ⋮ A note on constructing min-max heaps ⋮ A fast algorithm for quadratic resource allocation problems with nested constraints ⋮ Searching rigid data structures ⋮ Fast equal and biased distance fields for medial axis transform with meshing in mind ⋮ A pointer-free data structure for merging heaps and min-max heaps ⋮ Design and implementation of a massively parallel version of DIRECT ⋮ Diamond deque: A simple data structure for priority deques ⋮ Global optimization of univariate Lipschitz functions. I: Survey and properties ⋮ Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison ⋮ Stacks, queues, and deques with order-statistic operations ⋮ Optimum departure times for commuters in congested networks ⋮ A new metric between polygons, and how to compute it ⋮ Reflected min-Max heaps ⋮ A note on the construction of the data structure ``deap ⋮ A dynamic fixed windowing problem ⋮ Symmetric min-max heap: a simpler data structure for double-ended priority queue ⋮ A Survey on Priority Queues ⋮ MERGEABLE DOUBLE-ENDED PRIORITY QUEUES ⋮ The bounds of min-max pair heap construction ⋮ The relaxed min-max heap: A mergeable double-ended priority queue
