activity
20042024
most citedLock-Free and Practical Deques using Single-Word Compare-And-Swap

11 citations · 21 across the 7 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 1 filter

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…