The following pages link to (Q3796732):
Displaying 21 items.
- Colored range queries and document retrieval (Q390874) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- A generalization of binomial queues (Q672741) (← links)
- Two skew-binary numeral systems and one application (Q692930) (← links)
- Integer representation and counting in the bit probe model (Q848941) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- Weak-heap sort (Q1314628) (← links)
- Sorting multisets stably in minimum space (Q1338888) (← links)
- Regular numeral systems for data structures (Q2139186) (← links)
- Optimizing binary heaps (Q2411045) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop (Q3194717) (← links)
- Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time (Q3449808) (← links)
- Priority Queues and Sorting for Read-Only Data (Q4922111) (← links)
- The randomized complexity of maintaining the minimum (Q5054803) (← links)
- Worst-case efficient external-memory priority queues (Q5054847) (← links)
- Sorting multisets stably in minimum space (Q5056159) (← links)
- Fast meldable priority queues (Q5057442) (← links)
- The K-D heap: An efficient multi-dimensional priority queue (Q5060123) (← links)
- Priority queues with decreasing keys (Q6495789) (← links)
