2026 Gerth Stølting Brodal: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	44	7719	7496	31	29	167	5290

Overview

Gerth Stølting Brodal is affiliated with Aarhus University in Denmark. Their research primarily focuses on computer science, with a significant number of publications contributing to various specialized subfields within this area.

The main fields of study include:

Computer Science

Within computer science, Brodal's work spans multiple subfields such as:

Artificial Intelligence
Computational Theory and Mathematics
Computer Networks and Communications
Hardware and Architecture
Computer Graphics and Computer-Aided Design

Their research covers a range of topics with particular emphasis on:

Algorithms and Data Compression
Complexity and Algorithms in Graphs
Optimization and Search Problems
Advanced Graph Theory Research
Network Packet Processing and Optimization
Computational Geometry and Mesh Generation
Data Management and Algorithms

Frequent coauthors collaborating with Brodal include:

Casper Moldrup Rysgaard
Bruce Brewer
Sebastian Wild
Rolf Fagerberg
Haitao Wang

They have published extensively in several venues, reflecting the technical focus of their work. These include:

Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
arXiv (Cornell University)
Theoretical Computer Science
ACM Journal of Experimental Algorithmics
ACM Transactions on Algorithms

Recent papers authored by Brodal include:

"An Experimental Study of External Memory Algorithms for Connected Components" (2021) published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"Cache Oblivious Algorithms for Computing the Triplet Distance between Trees" (2021) published in ACM Journal of Experimental Algorithmics
"Fully persistent B-trees" (2020) published in Theoretical Computer Science
"Priority queues with decreasing keys" (2024) published in Theoretical Computer Science
"Strict Fibonacci Heaps" (2024) published in ACM Transactions on Algorithms

Best Publications

Dynamic planar convex hull

G.S. Brodal;R. Jacob

253
Citations
Algorithms – ESA 2005

Gerth Stølting Brodal;Stefano Leonardi

245
Citations
Cache Oblivious Search Trees via Binary Trees of Small Height

Gerth Stølting Brodal;Rolf Fagerberg;Riko Jacob

203
Citations
Cache oblivious search trees via binary trees of small height

Gerth Stølting Brodal;Rolf Fagerberg;Riko Jacob

199
Citations
Finding Maximal Pairs with Bounded Gap

Gerth Stølting Brodal;Rune B. Lyngsø;Christian N. S. Pedersen;Jens Stoye

184
Citations
New data structures for orthogonal range searching

Unknown

180
Citations
Time-dependent networks as models to achieve fast exact time-table queries

Gerth Stølting Brodal;Riko Jacob

156
Citations
Worst-case efficient priority queues

Gerth Stølting Brodal

142
Citations
Lower bounds for external memory dictionaries

Gerth Stolting Brodal;Rolf Fagerberg

132
Citations
Cache Oblivious Distribution Sweeping

Gerth Stølting Brodal;Rolf Fagerberg

104
Citations
Engineering a cache-oblivious sorting algorithm

Gerth Stølting Brodal;Rolf Fagerberg;Kristoffer Vinther

96
Citations
A Parallel Priority Queue with Constant Time Operations

Gerth Stølting Brodal;Jesper Larsson Träff;Christos D. Zaroliagis

95
Citations
On the limits of cache-obliviousness

Gerth Stølting Brodal;Rolf Fagerberg

91
Citations
Optimal sparse matrix dense vector multiplication in the I/O-model

Michael A. Bender;Gerth Stølting Brodal;Rolf Fagerberg;Riko Jacob

91
Citations
Funnel Heap - A Cache Oblivious Priority Queue

Gerth Stølting Brodal;Rolf Fagerberg

90
Citations
tqDist: a library for computing the quartet and triplet distances between binary or general trees

Andreas Sand;Morten Kragelund Holt;Jens Johansen;Gerth Stølting Brodal

90
Citations
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model

Michael A. Bender;Gerth Stølting Brodal;Rolf Fagerberg;Riko Jacob

88
Citations
Worst-case efficient external-memory priority queues

Gerth Stølting Brodal;Jyrki Katajainen

85
Citations
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)

Gerth Stølting Brodal;Rolf Fagerberg;Christian N. S. Pedersen

85
Citations
Pattern matching in dynamic texts

Stephen Alstrup;Gerth Stølting Brodal;Theis Rauhe

85
Citations
On external-memory MST, SSSP and multi-way planar graph separation

Lars Arge;Gerth Stølting Brodal;Laura Toma

61
Citations
Cache-oblivious algorithms and data structures

Gerth Stølting Brodal

27
Citations
Dynamic Planar Convex Hull

Riko Jacob;Gerth Stølting Brodal

2
Citations

Frequent Co-Authors

Lars Arge Aarhus University

Michael A. Bender Stony Brook University

Stefano Leonardi Sapienza University of Rome

Jens Stoye Bielefeld University

Leszek Gasieniec University of Liverpool

J. Ian Munro University of Waterloo

Pankaj K. Agarwal Duke University

Erik D. Demaine MIT

Jeffrey Scott Vitter University of Mississippi

Robert E. Tarjan Princeton University

External Links

Wikipedia of Gerth Stølting Brodal Personal website of Gerth Stølting Brodal Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens doors to a wide range of related online degrees and career paths. Those seeking faster entry into the workforce can explore quick online degrees that pay well, which cover in-demand skills and provide faster returns on investment.

For students interested in the latest technology trends, there are highly specialized AI degree programs. These affordable online options are designed for those who want to excel in cutting-edge fields like artificial intelligence and machine learning.

Choosing the right field of study is essential for long-term career growth. If you want to maximize your job prospects, consider the top 10 best majors for the future. These majors offer strong employment outlooks and align with emerging industry needs.

Finally, professionals seeking to upskill or transition without lengthy commitments might opt for easy masters programs that provide academic advancement with an achievable workload.