Brodal queue

for insertion, find-minimum, meld (merge two queues) and decrease-key and

They are the first heap variant to achieve these bounds without resorting to amortization of operational costs.

[1] While having better asymptotic bounds than other priority queue structures, they are, in the words of Brodal himself, "quite complicated" and "[not] applicable in practice.

[2] Here are time complexities[3] of various heap data structures.

Gerth Stølting Brodal is a professor at the University of Aarhus, Denmark.