3 citations · 5 across the 6 of their papers we have counts for
3 papers · 1 filter
Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
Jakob Gruber, Jesper Larsson Träff, Martin Wimmer
A number of concurrent, relaxed priority queues have recently been proposed and implemented. Results are commonly reported for a throughput benchmark that uses a uniform distributi…
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…
An improved, easily computable combinatorial lower bound for weighted graph bipartitioning
Jesper Larsson Träff, Martin Wimmer
There has recently been much progress on exact algorithms for the (un)weighted graph (bi)partitioning problem using branch-and-bound and related methods. In this note we present an…