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
Journal ArticleDOI
Biased Predecessor Search
TL;DR: Several data structures are obtained that achieve expected query times logarithmic in the entropy of the distribution of queries but with space bounded in terms of universe size, as well as data structures that use only linear space but with query times that are higher (but still sublinear) functions of the entropy.
Posted Content
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
TL;DR: In this paper, a time-space trade-off was presented for approximate string matching and regular expression matching with the Ziv-Lempel adaptive dictionary compression scheme, which significantly improved the space bounds.
Book ChapterDOI
Biased Predecessor Search
TL;DR: Several data structures are obtained that achieve expected query times logarithmic in the entropy of the distribution of queries but with space bounded in terms of universe size, as well as data structures that use only linear space but with query times that are higher (but still sublinear) functions of the entropy.
Journal Article
External string sorting : Faster and cache-oblivious
TL;DR: A randomized algorithm for sorting strings in external memory for K binary strings comprising N words in total that works in the cache-oblivious model under the tall cache assumption, and improves on the (deterministic) algorithm of Arge et al.
Efficient Modular Graph Transformation Rule Application
Jakob L. Andersen,Rolf Fagerberg,Juraj Kolvc'ak,Christophe V. F. P. Laurent,Daniel Elmar Merkle,Nikolai Nøjgaard +5 more
TL;DR: A new method of enumerating graph matches during graph transformation rule application is developed which allows redundant applications to be detected early and pruned and conducts chemical network generation experiments on real-life as well as synthetic data and compares against the state-of-the-art algorithm.