Gerth Brodal receives TALG Best Paper Award

Professor Gerth Stølting Brodal has received the TALG Harold N. Gabow Best Paper Award together with George Lagogiannis (Agricultural University of Athens) and Robert E. Tarjan (Princeton University) for their paper Strict Fibonacci Heaps.

The award from ACM Transactions on Algorithms (TALG) recognises the impact and lasting significance of a TALG article in the first three years since its publication.

Strict Fibonacci Heaps achieves the classic Fibonacci-heap bounds in the worst case, establishing optimal worst-case bounds that researchers have sought for decades. The result resolves a central challenge in the design of efficient priority queues and heaps.

Fibonacci heaps are a fundamental data structure with applications in graph algorithms, including shortest paths and maximum-weight matchings, as well as many other combinatorial optimisation problems. By obtaining these bounds in the worst case, the paper marks a major milestone in the theory of data structures.

Read Strict Fibonacci Heaps.

Congratulations!