Pages that link to "Item:Q3783545"
From MaRDI portal
The following pages link to Min-max heaps and generalized priority queues (Q3783545):
Displayed 34 items.
- Fast equal and biased distance fields for medial axis transform with meshing in mind (Q651783) (← links)
- Diamond deque: A simple data structure for priority deques (Q685528) (← links)
- The d-deap\(^*\): a fast and simple cache-aligned d-ary deap (Q834995) (← links)
- Two new methods for constructing double-ended priority queues from priority queues (Q836938) (← links)
- Multidimensional heaps and complementary range searching (Q845992) (← links)
- Design and implementation of a massively parallel version of DIRECT (Q953213) (← links)
- Reflected min-Max heaps (Q1007603) (← links)
- Bounds for min-max heaps (Q1101212) (← links)
- A note on constructing min-max heaps (Q1123594) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- Global optimization of univariate Lipschitz functions. I: Survey and properties (Q1198732) (← links)
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison (Q1198733) (← links)
- Stacks, queues, and deques with order-statistic operations (Q1203596) (← links)
- Symmetric min-max heap: a simpler data structure for double-ended priority queue (Q1285766) (← links)
- The relaxed min-max heap: A mergeable double-ended priority queue (Q1323336) (← links)
- Finding maximum likelihood estimators for the three-parameter Weibull distribution (Q1342904) (← links)
- Mixed graph colorings (Q1360876) (← links)
- The bounds of min-max pair heap construction (Q1609155) (← links)
- A note on the construction of the data structure ``deap'' (Q1825631) (← links)
- A dynamic fixed windowing problem (Q1825634) (← links)
- Recurrence relations on heaps (Q1913701) (← links)
- Global optimization of Hölder functions (Q1918982) (← links)
- Optimum departure times for commuters in congested networks (Q2277160) (← links)
- An efficient implicit data structure for relation testing and searching in partially ordered sets (Q2366649) (← links)
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- Total Variation on a Tree (Q3188199) (← links)
- An optimal parallel algorithm to construct a deap (Q3989753) (← links)
- Heap construction in the parallel comparison tree model (Q5056136) (← links)
- Fast meldable priority queues (Q5057442) (← links)
- The K-D heap: An efficient multi-dimensional priority queue (Q5060123) (← links)
- A new metric between polygons, and how to compute it (Q5204335) (← links)
- MERGEABLE DOUBLE-ENDED PRIORITY QUEUES (Q5248987) (← links)
- Searching rigid data structures (Q6085739) (← links)