17 citations · 20 across the 4 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Practical Concurrent Priority Queues
Jakob Gruber
Priority queues are abstract data structures which store a set of key/value pairs and allow efficient access to the item with the minimal (maximal) key. Such queues are an importan…
cs.DS2015
The Lock-free -LSM Relaxed Priority Queue
Martin Wimmer, Jakob Gruber, Jesper Larsson Träff +1
Priority queues are data structures which store keys in an ordered fashion to allow efficient access to the minimal (maximal) key. Priority queues are essential for many applicatio…