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
The Complexity of Computing the k-ary Composition of a Binary Associative Operator
Gerth Stølting Brodal,Sven Skyum +1 more
TL;DR: It is shown that the problem of computing all contiguous k-ary compositions of a sequence of n values under an associative and commutative operator requires 3(k−1)/ (k+1)n − O(k) operations.
Book ChapterDOI
Priority Queues on Parallel Machines
TL;DR: In this article, the authors presented time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant time with one processor and makeQueue, Insert, Meld, Findmin, Extractmin, Delete and DecreaseKey in constant speed with O(log n) processors.
Book ChapterDOI
D 2 -Tree: A New Overlay with Deterministic Bounds
TL;DR: The D 2-tree compares favourably to other overlays for the following reasons: it provides matching and better complexities, and the management of nodes and elements are completely decoupled from each other.
Worst Case Efficient Data Structures
TL;DR: The design of efficient data structures where each operation has a worst case efficient implementations is studied and a tradeoff between the update time and the query time of comparison based priority queue implementations is presented.
Journal ArticleDOI
External Memory Planar Point Location with Logarithmic Updates
TL;DR: This paper presents an I/O-efficient dynamic data structure for point location in general planar subdivisions that uses linear space to store a subdivision with N segments.