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
Book ChapterDOI
Faster algorithms for computing longest common increasing subsequences
TL;DR: The problem of longest common weakly-increasing (or non-decreasing) subsequences (LCWIS), for which an O(m+nlogn)-time algorithm is presented for the 3-letter alphabet case, for which comparable speedups have not been achieved for small alphabets.
Book ChapterDOI
Fault Tolerant External Memory Algorithms
TL;DR: This paper investigates for the first time the connection between I/O-efficiency in the I/ O model and fault tolerance in the faulty memory RAM, and shows a lower bound on the number of I/Os required for any deterministic dictionary that is resilient to memory faults.
Journal Article
The randomized complexity of maintaining the minimum
TL;DR: The complexity of maintaining a set under the operations Insert, Delete and FindMin is considered in this paper, where it is shown that any randomized algorithm with expected amortized cost t comparisons per Insert and Delete has expected cost at least n/(e22t)-1 comparisons for FindMin if FindMin was replaced by a weaker operation FindAny, and it is also shown that no deterministic algorithm can have constant expected cost per operation.
Book ChapterDOI
Computing Refined Buneman Trees in Cubic Time
TL;DR: The improved complexity of the algorithm is presented, which makes the method of refined Buneman trees computational competitive to methods based on neighbor joining.
Book ChapterDOI
On space efficient two dimensional range minimum data structures
TL;DR: This paper studies the trade-off between the space and query time of the two dimensional range minimum query problem, and shows that every algorithm enabled to access A during the query and using O(N/c) bits additional space requires Ω(c) query time, for any c where 1 ≤ c ≤ N.