Pages that link to "Item:Q1177934"
From MaRDI portal
The following pages link to A pointer-free data structure for merging heaps and min-max heaps (Q1177934):
Displaying 7 items.
- Diamond deque: A simple data structure for priority deques (Q685528) (← links)
- Range-restricted mergeable priority queues (Q689640) (← links)
- Reflected min-Max heaps (Q1007603) (← links)
- The relaxed min-max heap: A mergeable double-ended priority queue (Q1323336) (← links)
- An efficient implicit data structure for relation testing and searching in partially ordered sets (Q2366649) (← links)
- Probabilistic data structures for priority queues (Q5054850) (← links)
- The K-D heap: An efficient multi-dimensional priority queue (Q5060123) (← links)