16 citations · 57 across the 26 of their papers we have counts for
Showing 2015 · cs.DSShow all
2 papers · 2 filters
cs.DS2015★ 1 cited
Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions
Robert Ganian, Martin Kalany, Stefan Szeider +1
We show that the problem of constructing tree-structured descriptions of data layouts that are optimal with respect to space or other criteria from given sequences of displacements…
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…