G
Gerth Stølting Brodal
Researcher at Aarhus University
Publications - 170
Citations - 4573
Gerth Stølting Brodal is an academic researcher from Aarhus University. The author has contributed to research in topics: Data structure & Priority queue. The author has an hindex of 39, co-authored 166 publications receiving 4420 citations. Previous affiliations of Gerth Stølting Brodal include National Research Foundation of South Africa & Max Planck Society.
Papers
More filters
Journal ArticleDOI
A Simple Greedy Algorithm for Dynamic Graph Orientation
TL;DR: An immensely simple greedy algorithm gets parametrized trade-off bounds between out-degree and worst case number of flips, which previously only existed for amortized number of flipped graphs.
Journal ArticleDOI
Cache Oblivious Search Trees via Binary Trees of Small Height
TL;DR: Bender, Demaine and Farach-Colton as discussed by the authors proposed a cache-oblivious search tree, which avoids the use of weight balanced B-trees and can be implemented as a single array of data elements.
Priority queues on parallel machines
TL;DR: A pipelined version of the priority queues adopt to a processor array of size O(log n), supporting the operations MakeQueue, Insert, Meld, FindMin, Extractmin, Delete and DecreaseKey in constant time.
Book ChapterDOI
Time and Space Efficient Multi-method Dispatching
TL;DR: This paper addresses the multi-method dispatching problem for object oriented languages with a linear space data structure for binary dispatching that supports dispatching in logarithmic time and improves the space bound with a logarithsmic factor.
Journal ArticleDOI
Priority queues on parallel machines
TL;DR: By applying the k-bandwidth technique, a data structure is obtained for the CREW PRAM which supports MultiInsertk operations in time and MultiExtractMink in time, and a pipelined version of the priority queues adopt to a processor array of size.