World's Best Scientists 2026 revealed!
Gerth Stølting Brodal

Gerth Stølting Brodal

D-Index & Metrics

Computer Science

D-Index
44
Citations
5290
World Ranking
7718
National Ranking
31

Gerth Stølting Brodal publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Gerth Stølting Brodal sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 167 publications — 33rd percentile

33% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Gerth Stølting Brodal D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Gerth Stølting Brodal sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 44 D-Index — 48th percentile

48% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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

  • Algorithms – ESA 2005

    Gerth Stølting Brodal;Stefano Leonardi

  • Cache Oblivious Search Trees via Binary Trees of Small Height

    Gerth Stølting Brodal;Rolf Fagerberg;Riko Jacob

  • Cache oblivious search trees via binary trees of small height

    Gerth Stølting Brodal;Rolf Fagerberg;Riko Jacob

  • Finding Maximal Pairs with Bounded Gap

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

  • New data structures for orthogonal range searching

    Unknown

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

    Gerth Stølting Brodal;Riko Jacob

  • Worst-case efficient priority queues

    Gerth Stølting Brodal

  • Lower bounds for external memory dictionaries

    Gerth Stolting Brodal;Rolf Fagerberg

  • Cache Oblivious Distribution Sweeping

    Gerth Stølting Brodal;Rolf Fagerberg

  • Engineering a cache-oblivious sorting algorithm

    Gerth Stølting Brodal;Rolf Fagerberg;Kristoffer Vinther

  • A Parallel Priority Queue with Constant Time Operations

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

  • On the limits of cache-obliviousness

    Gerth Stølting Brodal;Rolf Fagerberg

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

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

  • Funnel Heap - A Cache Oblivious Priority Queue

    Gerth Stølting Brodal;Rolf Fagerberg

  • 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

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

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

  • Worst-case efficient external-memory priority queues

    Gerth Stølting Brodal;Jyrki Katajainen

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

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

  • Pattern matching in dynamic texts

    Stephen Alstrup;Gerth Stølting Brodal;Theis Rauhe

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

    Lars Arge;Gerth Stølting Brodal;Laura Toma

  • Cache-oblivious algorithms and data structures

    Gerth Stølting Brodal

  • Dynamic Planar Convex Hull

    Riko Jacob;Gerth Stølting Brodal

Frequent Co-Authors

Lars Arge
Lars Arge Aarhus University
Michael A. Bender
Michael A. Bender Stony Brook University
Stefano Leonardi
Stefano Leonardi Sapienza University of Rome
Jens Stoye
Jens Stoye Bielefeld University
Leszek Gasieniec
Leszek Gasieniec University of Liverpool
J. Ian Munro
J. Ian Munro University of Waterloo
Pankaj K. Agarwal
Pankaj K. Agarwal Duke University
Jeffrey Scott Vitter
Jeffrey Scott Vitter University of Mississippi
Robert E. Tarjan
Robert E. Tarjan Princeton University

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

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.

Best Scientists Citing Gerth Stølting Brodal

Trending Scientists

Recently Published Articles