The following pages link to Fast meldable priority queues (Q5057442):
Displaying 17 items.
- A generalization of binomial queues (Q672741) (← links)
- Range-restricted mergeable priority queues (Q689640) (← links)
- Multidimensional heaps and complementary range searching (Q845992) (← links)
- Reflected min-Max heaps (Q1007603) (← links)
- Queue-mergesort (Q1313731) (← links)
- Parallel priority queues based on binomial heaps (Q1583321) (← links)
- Regular numeral systems for data structures (Q2139186) (← links)
- Worst-Case Optimal Priority Queues via Extended Regular Counters (Q2907494) (← links)
- Melding priority queues (Q2944529) (← links)
- Fishspear: a priority queue algorithm (Q4299294) (← links)
- (Q4425956) (← links)
- Bipartite binomial heaps (Q4637854) (← links)
- The randomized complexity of maintaining the minimum (Q5054803) (← links)
- Priority queues on parallel machines (Q5054832) (← links)
- Probabilistic data structures for priority queues (Q5054850) (← links)
- Algorithm Theory - SWAT 2004 (Q5315375) (← links)
- (Q5501240) (← links)