2 papers
cs.DS2017
External Memory Pipelining Made Easy With TPIE
Lars Arge, Mathias Rav, Svend C. Svendsen +1
When handling large datasets that exceed the capacity of the main memory, movement of data between main memory and external memory (disk), rather than actual (CPU) computation time…
cs.DS2015
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time
Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen
The binary heap of Williams (1964) is a simple priority queue characterized by only storing an array containing the elements and the number of elements - here denoted a strictl…