The following pages link to Bounds for min-max heaps (Q1101212):
Displaying 16 items.
- A tight lower bound for top-down skew heaps (Q287017) (← links)
- Multidimensional heaps and complementary range searching (Q845992) (← links)
- Reflected min-Max heaps (Q1007603) (← links)
- A note on constructing min-max heaps (Q1123594) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- Best case lower bounds for heapsort (Q1195788) (← 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)
- The bounds of min-max pair heap construction (Q1609155) (← links)
- A note on the construction of the data structure ``deap'' (Q1825631) (← links)
- Recurrence relations on heaps (Q1913701) (← links)
- Min-max heaps and generalized priority queues (Q3783545) (← links)
- Interval Heaps (Q4039034) (← links)
- The K-D heap: An efficient multi-dimensional priority queue (Q5060123) (← links)