Rolf Fagerberg
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
34
Venues
16
Active years
1995–2024
Best venue rank
A*
Where they publish
Papers
34 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2024 | ESA | On Finding Longest Palindromic Subsequences Using Longest Common Subsequences. | Gerth Stlting Brodal, Rolf Fagerberg, Casper Moldrup Rysgaard |
| 2021 | CIAC | Fragile Complexity of Adaptive Algorithms. | Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman |
| 2019 | ESA | Fragile Complexity of Comparison-Based Algorithms. | Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava |
| 2019 | ISAAC | On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? | Rolf Fagerberg, David Hammer, Ulrich Meyer |
| 2015 | ISAAC | Competitive Local Routing with Constraints. | Prosenjit Bose, Rolf Fagerberg, Andr van Renssen, Sander Verdonschot |
| 2014 | LATIN | Biased Predecessor Search. | Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin |
| 2013 | SODA | Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. | Gerth Stlting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand |
| 2012 | CP | Exploring Chemistry Using SMT. | Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters |
| 2012 | ICALP | De-amortizing Binary Search Trees. | Prosenjit Bose, Sbastien Collette, Rolf Fagerberg, Stefan Langerman |
| 2012 | LATIN | On Plane Constrained Bounded-Degree Spanners. | Prosenjit Bose, Rolf Fagerberg, Andr van Renssen, Sander Verdonschot |
| 2012 | SODA | Competitive routing in the half-θ | Prosenjit Bose, Rolf Fagerberg, Andr van Renssen, Sander Verdonschot |
| 2009 | ISAAC | Online Sorted Range Reporting. | Gerth Stlting Brodal, Rolf Fagerberg, Mark Greve, Alejandro Lpez-Ortiz |
| 2007 | APBC | Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. | Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stlting Brodal, Rolf Fagerberg |
| 2007 | APBC | Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. | Martin Stig Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stlting Brodal, Rolf Fagerberg |
| 2007 | CPM | Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. | Philip Bille, Rolf Fagerberg, Inge Li Grtz |
| 2007 | ESA | Optimal Resilient Dynamic Dictionaries. | Gerth Stlting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave |
| 2007 | SPAA | Optimal sparse matrix dense vector multiplication in the I/O-model. | Michael A. Bender, Gerth Stlting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari |
| 2006 | SODA | Cache-oblivious string dictionaries. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2006 | STACS | External String Sorting: Faster and Cache-Oblivious. | Rolf Fagerberg, Anna Pagh, Rasmus Pagh |
| 2005 | ALENEX | On the Adaptiveness of Quicksort. | Gerth Stlting Brodal, Rolf Fagerberg, Gabriel Moruz |
| 2005 | ICALP | Cache-Aware and Cache-Oblivious Adaptive Sorting. | Gerth Stlting Brodal, Rolf Fagerberg, Gabriel Moruz |
| 2004 | ALENEX | Engineering a Cache-Oblivious Sorting Algorith. | Gerth Stlting Brodal, Rolf Fagerberg, Kristoffer Vinther |
| 2003 | FOCS | The Cost of Cache-Oblivious Searching. | Michael A. Bender, Gerth Stlting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro Lpez-Ortiz |
| 2003 | SODA | Lower bounds for external memory dictionaries. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2003 | STOC | On the limits of cache-obliviousness. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2003 | WABI | Computing Refined Buneman Trees in Cubic Time. | Gerth Stlting Brodal, Rolf Fagerberg, Anna stlin, Christian N. S. Pedersen, S. Srinivasa Rao |
| 2002 | ICALP | Cache Oblivious Distribution Sweeping. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2002 | ISAAC | Funnel Heap - A Cache Oblivious Priority Queue. | Gerth Stlting Brodal, Rolf Fagerberg |
| 2002 | SODA | Cache oblivious search trees via binary trees of small height. | Gerth Stlting Brodal, Rolf Fagerberg, Riko Jacob |
| 2001 | ICALP | The Complexity of Constructing Evolutionary Trees Using Experiments. | Gerth Stlting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna stlin |
| 2001 | ISAAC | Computing the Quartet Distance between Evolutionary Trees in Time O(n log | Gerth Stlting Brodal, Rolf Fagerberg, Christian N. S. Pedersen |
| 2001 | WADS | Search Trees with Relaxed Balance and Near-Optimal Height. | Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen |
| 1999 | WADS | Dynamic Representation of Sparse Graphs. | Gerth Stlting Brodal, Rolf Fagerberg |
| 1995 | WADS | Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. | Joan Boyar, Rolf Fagerberg, Kim S. Larsen |