2 citations · 2 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Soft Sequence Heaps
Gerth Stølting Brodal
Chazelle [JACM00] introduced the soft heap as a building block for efficient minimum spanning tree algorithms, and recently Kaplan et al. [SOSA2019] showed how soft heaps can be ap…
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…