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 practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
Andreas Sand,Gerth Stølting Brodal,Gerth Stølting Brodal,Rolf Fagerberg,Christian N. S. Pedersen,Christian N. S. Pedersen,Thomas Mailund +6 more
TL;DR: An algorithm is presented that computes the triplet distance between two rooted binary trees in time O (n log2n) and it is shown that this algorithm can be implemented to give a competitive wall-time running time.
Journal ArticleDOI
Improved Bounds for Dictionary Look-up with One Error
TL;DR: In this paper, the problem of designing a data structure for a dictionary S of n binary strings each of length m to report if there exists a string in S within Hamming distance d of q was studied.
Journal ArticleDOI
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
TL;DR: A new randomized paging algorithm OnlineMin is presented that has optimal competitiveness and allows fast implementations and two implementations of OnlineMin are presented which use O(k) space, but only O(logk) worst case time and O( logk/log logk) best case time per page request respectively.
Book ChapterDOI
Optimal Planar Orthogonal Skyline Counting Queries
TL;DR: In this paper, the problem of preprocessing a set P of n points into a space efficient static data structure supporting orthogonal skyline counting queries was considered and a data structure for storing n points with integer coordinates having query time O(lg n/lg\lg lg n) and space usage O(n) words was presented.
Journal ArticleDOI
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 + n log n) time algorithm is presented for the 3-letter alphabet case, for which comparable speedups have not been achieved for small alphabets.