The following pages link to Bounds for min-max heaps (Q1101212):
Displayed 9 items.
- Multidimensional heaps and complementary range searching (Q845992) (← links)
- A note on constructing min-max heaps (Q1123594) (← 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)
- 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)
- A note on the construction of the data structure ``deap'' (Q1825631) (← links)
- Recurrence relations on heaps (Q1913701) (← links)
- The K-D heap: An efficient multi-dimensional priority queue (Q5060123) (← links)