Pages that link to "Item:Q1350117"
From MaRDI portal
The following pages link to An efficient algorithm for concurrent priority queue heaps (Q1350117):
Displaying 10 items.
- Parallel heap: an optimal parallel priority queue (Q973413) (← links)
- Fast and lock-free concurrent priority queues for multi-thread systems (Q1779732) (← links)
- Lock-free concurrent binomial heaps (Q1994357) (← links)
- Solving the shortest path tour problem (Q2356016) (← links)
- Min-max heaps and generalized priority queues (Q3783545) (← links)
- Concurrent access of priority queues (Q3814801) (← links)
- The soft heap (Q4406296) (← links)
- (Q4425956) (← links)
- A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms (Q5363806) (← links)
- TSLQueue: An Efficient Lock-Free Design for Priority Queues (Q6487195) (← links)