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
Proceedings ArticleDOI
Lower bounds for external memory dictionaries
TL;DR: For both lower bound trade offs between the I/O complexity of member queries and insertions, data structures are described which give matching upper bounds for a wide range of parameters, thereby showing the lower bounds to be tight within these ranges.
Proceedings ArticleDOI
Worst-case efficient priority queues
TL;DR: An implementation of priority queues is presented that supports the operations MAKEQUEUE, FINDMIN, INSERT, MELD and DECREASEKEY in worst case time O(1) and DELETEMIN and DELETE in worstCaseTime O(logn).
Journal ArticleDOI
Time-dependent networks as models to achieve fast exact time-table queries
Gerth Stølting Brodal,Riko Jacob +1 more
TL;DR: Efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries for travelers using a train system, are considered and time-dependent networks are proposed as a model.
Proceedings ArticleDOI
Pattern matching in dynamic texts
TL;DR: A data structure that supports insertions and deletions of characters and movements of arbitrary large blocks within a text in O(log~nloglognlog*n) time per operation and an ingredient in the solution is a data structure for the dynamic string equality problem introduced by Mehlhorn, Sundar and Uhrig.
Journal ArticleDOI
A Parallel Priority Queue with Constant Time Operations
TL;DR: This data structure is the first to support multi-insertion and multi-decrease key in constant time, and can be implemented on the EREW PRAM and can perform any sequence of operations inO(n) time andO(mlogn) work, being the total number of keyes inserted and/or updated.