activity
20152017
most citedFast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D

48 citations · 48 across the 2 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 1 filter

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…