• Åbogade 34, 5335, 321

    8200 Aarhus N

    Danmark

1995 …2025

Publikationer pr. år

Personlig profil

Profil

Gerth Stølting Brodal is a Professor at the Department of Computer Science, Aarhus University, Denmark (since January 2016). He received his PhD in computer science in 1997 from Aarhus University for the thesis “Worst Case Efficient Data Structures”. From 1997 to 1998 he was a PostDoc in the group of Kurt Mehlhorn at the Max-Planck-Institute for Computer Science in Saarbrücken, Germany. 1998–2005 he was affiliated with BRICS (Center for Basic Research in Computer Science) located at the Department of Computer Science, Aarhus University. 2004–2015 he was an Associate Professor (tenured) at the Department of Computer Science, Aarhus University. March 2007–December 2017 he was affiliated with MADALGO (Center for Massive Data Algorithmics), Aarhus University, founded by the Danish National Research Foundation.

His main research interests are the design and analysis of algorithms and data structures. He has done work on fundamental data structures, including dictionaries and priority queues, persistent data structures, computational geometry, graph algorithms, string algorithms, I/O-efficient and cache-oblivious algorithms and data structures, algorithm engineering, and computational biology.

Fagområder

  • Algoritmer og Datastrukturer

Fingeraftryk

Dyk ned i forskningsemnerne, hvor Gerth Stølting Brodal er aktive. Disse emneetiketter kommer fra dennes persons arbejder. Sammen danner de et unikt fingerprint.
  • 1 Lignende profiler

Samarbejde og topforskningsområder i de sidste fem år

Seneste eksterne samarbejde på lande-/områdeniveau. Dyk ned i detaljerne ved at klikke på prikkerne eller
  • Dynamic Convex Hulls for Simple Paths

    Brewer, B., Brodal, G. S. & Wang, H., 2025, (E-pub / Early view) I: Discrete and Computational Geometry.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

  • Pure Binary Finger Search Trees

    Brodal, G. S. & Rysgaard, C. M., 2025, 8th SIAM Symposium on Simplicity of Algorithms, SOSA 2025. Bercea, I.-O. & Pagh, R. (red.). Society for Industrial and Applied Mathematics, s. 172-195 24 s.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  • Strict Fibonacci Heaps

    Brodal, G. S., Lagogiannis, G. & Tarjan, R. E., apr. 2025, I: ACM Transactions on Algorithms. 21, 2, 15.

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

    Åben adgang
  • Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin

    Brodal, G. S., jun. 2024, 12th International Conference on Fun with Algorithms, FUN 2024. Broder, A. Z. & Tamir, T. (red.). Wadern: Dagstuhl Publishing, 15 s. 6. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 291).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  • Deterministic Cache-Oblivious Funnelselect

    Brodal, G. S. & Wild, S., jun. 2024, 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024. Bodlaender, H. L. (red.). Wadern: Dagstuhl Publishing, 17. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 294).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang