Gerth Stølting Brodal

Gerth Stølting Brodal

Aarhus Universitet

H-index: 41

Europe-Denmark

About Gerth Stølting Brodal

Gerth Stølting Brodal, With an exceptional h-index of 41 and a recent h-index of 17 (since 2020), a distinguished researcher at Aarhus Universitet, specializes in the field of Algorithms, Data Structures.

His recent articles reflect a diverse array of research interests and contributions to the field:

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin

Deterministic Cache-Oblivious Funnelselect

Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location

Scalable Data Structures (Dagstuhl Seminar 23211)

External Memory Fully Persistent Search Trees

Funnelselect: Cache-Oblivious Multiple Selection

Priority Queues with Decreasing Keys

Dagstuhl Reports, Vol. 11, Issue 1 ISSN 2192-5283

Gerth Stølting Brodal Information

University

Position

___

Citations(all)

4663

Citations(since 2020)

977

Cited By

4188

hIndex(all)

41

hIndex(since 2020)

17

i10Index(all)

82

i10Index(since 2020)

34

Email

University Profile Page

Aarhus Universitet

Google Scholar

View Google Scholar Profile

Gerth Stølting Brodal Skills & Research Interests

Algorithms

Data Structures

Top articles of Gerth Stølting Brodal

Title

Journal

Author(s)

Publication Date

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin

arXiv preprint arXiv:2404.08287

Gerth Stølting Brodal

2024/4/12

Deterministic Cache-Oblivious Funnelselect

arXiv preprint arXiv:2402.17631

Gerth Stølting Brodal

Sebastian Wild

2024/2/27

Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location

Gerth Stølting Brodal

Casper Moldrup Rysgaard

Jens Kristian Refsgaard Schou

Rolf Svenning

2023/7/28

Scalable Data Structures (Dagstuhl Seminar 23211)

Gerth Stølting Brodal

John Iacono

László Kozma

Vijaya Ramachandran

Justin Dallant

2023

External Memory Fully Persistent Search Trees

Gerth Stølting Brodal

Casper Moldrup Rysgaard

Rolf Svenning

2023/6/2

Funnelselect: Cache-Oblivious Multiple Selection

Gerth Stølting Brodal

Sebastian Wild

2023

Priority Queues with Decreasing Keys

Gerth Stølting Brodal

2022

Dagstuhl Reports, Vol. 11, Issue 1 ISSN 2192-5283

Gerth Stølting Brodal

John Iacono

Markus E Nebel

Vijaya Ramachandrana

Olivier Boissier

...

2021/7

An experimental study of external memory algorithms for connected components

Gerth Stølting Brodal

Rolf Fagerberg

David Hammer

Ulrich Meyer

Manuel Penschuck

...

2021/6/1

Cache Oblivious Algorithms for Computing the Triplet Distance between Trees

Journal of Experimental Algorithmics (JEA)

Gerth Stølting Brodal

Konstantinos Mampentzidis

2021/5/8

Scalable Data Structures (Dagstuhl Seminar 21071)

Gerth Stølting Brodal

John Iacono

Markus E Nebel

Vijaya Ramachandran

2021

Fully persistent B-trees

Theoretical Computer Science

Gerth Stølting Brodal

Spyros Sioutas

Konstantinos Tsakalidis

Kostas Tsichlas

2020/11/12

Soft Sequence Heaps

arXiv preprint arXiv:2008.05398

Gerth Stølting Brodal

2020/8/12

See List of Professors in Gerth Stølting Brodal University(Aarhus Universitet)

Co-Authors

H-index: 52
Michael A. Bender

Michael A. Bender

Stony Brook University

H-index: 49
Lars Arge

Lars Arge

Aarhus Universitet

H-index: 43
Thomas Mailund

Thomas Mailund

Aarhus Universitet

H-index: 31
Christian Nørgaard Storm Pedersen

Christian Nørgaard Storm Pedersen

Aarhus Universitet

H-index: 31
Stephen Alstrup

Stephen Alstrup

Københavns Universitet

H-index: 30
Srinivasa Rao Satti

Srinivasa Rao Satti

Norges teknisk-naturvitenskaplige universitet

academic-engine