Pages that link to "Item:Q1285766"
From MaRDI portal
The following pages link to Symmetric min-max heap: a simpler data structure for double-ended priority queue (Q1285766):
Displayed 6 items.
- 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)
- Reflected min-Max heaps (Q1007603) (← links)
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- A Survey on Priority Queues (Q2848973) (← links)