Rolf Fagerberg

According to our database1, Rolf Fagerberg authored at least 64 papers between 1995 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Graph Transformation for Enzymatic Mechanisms.
CoRR, 2021

Fragile Complexity of Adaptive Algorithms.
CoRR, 2021

2019
Handling preferences in student-project allocation.
Ann. Oper. Res., 2019

On Plane Constrained Bounded-Degree Spanners.
Algorithmica, 2019

On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Fragile Complexity of Comparison-Based Algorithms.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Finding the K best synthesis plans.
J. Cheminformatics, 2018

Continuous Yao graphs.
Comput. Geom., 2018

2017
Competitive local routing with constraints.
J. Comput. Geom., 2017

2016
String Sorting.
Encyclopedia of Algorithms, 2016

Cache-Oblivious Model.
Encyclopedia of Algorithms, 2016

Cache-Oblivious B-Tree.
Encyclopedia of Algorithms, 2016

Biased Predecessor Search.
Algorithmica, 2016

2015
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles.
SIAM J. Comput., 2015

New and improved spanning ratios for Yao graphs.
J. Comput. Geom., 2015

2014
Continuous Yao Graphs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
On the Complexity of Reconstructing Chemical Reaction Networks.
Math. Comput. Sci., 2013

New and Improved Spanning Ratios for Yao Graphs.
CoRR, 2013

A practical O(n log<sup>2 </sup> n) time algorithm for computing the triplet distance on binary trees.
BMC Bioinform., 2013

Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Competitive routing in the half-θ<sub>6</sub>-graph.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

De-amortizing Binary Search Trees.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Exploring Chemistry Using SMT.
Proceedings of the Principles and Practice of Constraint Programming, 2012

Competitive Routing on a Bounded-Degree Plane Spanner.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
The Cost of Cache-Oblivious Searching.
Algorithmica, 2011

2010
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Theory Comput. Syst., 2010

An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
CoRR, 2010

An <i>O</i>(log log <i>n</i>)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.
Proceedings of the Algorithm Theory, 2010

2009
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts.
ACM Trans. Algorithms, 2009

Online Sorted Range Reporting.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
String Sorting.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Cache-Oblivious Model.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Cache-Oblivious B-Tree.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On the adaptiveness of Quicksort.
ACM J. Exp. Algorithmics, 2008

Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
J. Bioinform. Comput. Biol., 2008

2007
Engineering a cache-oblivious sorting algorithm.
ACM J. Exp. Algorithmics, 2007


Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
Recrafting the neighbor-joining method.
BMC Bioinform., 2006

External String Sorting: Faster and Cache-Oblivious.
Proceedings of the STACS 2006, 2006

Cache-oblivious string dictionaries.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Cache-Aware and Cache-Oblivious Adaptive Sorting.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Cache-oblivious planar orthogonal range searching and counting.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
Cache-Oblivious Data Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

Balanced Binary Search Trees.
Proceedings of the Handbook of Data Structures and Applications., 2004

Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).
Algorithmica, 2004

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.
Proceedings of the Algorithm Theory, 2004

Engineering a Cache-Oblivious Sorting Algorith.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
Computing Refined Buneman Trees in Cubic Time.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

On the limits of cache-obliviousness.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Lower bounds for external memory dictionaries.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Cache oblivious search trees via binary trees of small height.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Funnel Heap - A Cache Oblivious Priority Queue.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Cache Oblivious Distribution Sweeping.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Search Trees with Relaxed Balance and Near-Optimal Height.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Computing the Quartet Distance between Evolutionary Trees in Time O(n log<sup>2</sup> n).
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

The Complexity of Constructing Evolutionary Trees Using Experiments.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

1999
Dynamic Representation of Sparse Graphs.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

The Complexity of Rebalancing a Binary Search Tree.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1997
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
J. Comput. Syst. Sci., 1997

1996
A Generalization of Binomial Queues.
Inf. Process. Lett., 1996

Efficient Rebalancing of B-Trees with Relaxed Balance.
Int. J. Found. Comput. Sci., 1996

Binary Search Trees: How Low Can You Go?
Proceedings of the Algorithm Theory, 1996

1995
B-trees with relaxed balance.
Proceedings of IPPS '95, 1995


  Loading...