 Brodal queues are named after their inventor Gerth Stølting Brodal.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.