R
Rolf Fagerberg
Researcher at University of Southern Denmark
Publications - 101
Citations - 2023
Rolf Fagerberg is an academic researcher from University of Southern Denmark. The author has contributed to research in topics: Cache-oblivious algorithm & Vertex (geometry). The author has an hindex of 25, co-authored 97 publications receiving 1906 citations. Previous affiliations of Rolf Fagerberg include Aarhus University & Odense University.
Papers
More filters
Proceedings ArticleDOI
Cache oblivious search trees via binary trees of small height
TL;DR: A version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach-Colton and has the same complexity bounds is proposed, and can be implemented as just a single array of data elements without the use of pointers.
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.
Book ChapterDOI
Cache Oblivious Distribution Sweeping
TL;DR: This work adapts the distribution sweeping model for divide-and-conquer algorithms to the cache oblivious model, and demonstrates by a series of algorithms the feasibility of the method in a cache oblivious setting.
Proceedings ArticleDOI
On the limits of cache-obliviousness
TL;DR: The results for sorting show the existence of an inherent trade-off in the cache-oblivious model between the strength of the tall cache assumption and the overhead for the case M » B, and show that Funnelsort and recursive binary mergesort are optimal algorithms in the sense that they attain this trade-offs.
Proceedings Article
Dynamic Representation of Sparse Graphs
TL;DR: In this paper, a linear space data structure for maintaining graphs with bounded arboricity is presented, which supports adjacency queries in worst case O(c) time and edge insertions and edge deletions in amortized O(1) and O (c+log n) time, respectively.