Rolf Fagerberg

2008
39	EE	Rolf Fagerberg: Cache-Oblivious B-Tree. Encyclopedia of Algorithms 2008
38	EE	Rolf Fagerberg: Cache-Oblivious Model. Encyclopedia of Algorithms 2008
37	EE	Rolf Fagerberg: String Sorting. Encyclopedia of Algorithms 2008
36	EE	Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz: On the adaptiveness of Quicksort. ACM Journal of Experimental Algorithmics 12: (2008)
35	EE	M. Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg: Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. J. Bioinformatics and Computational Biology 6(1): 37-50 (2008)
2007
34	EE	M. Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg: Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. APBC 2007: 101-110
33	EE	M. Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg: Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. APBC 2007: 91-100
32	EE	Philip Bille, Rolf Fagerberg, Inge Li Gørtz: Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CPM 2007: 52-62
31	EE	Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave: Optimal Resilient Dynamic Dictionaries. ESA 2007: 347-358
30	EE	Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari: Optimal sparse matrix dense vector multiplication in the I/O-model. SPAA 2007: 61-70
29	EE	Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther: Engineering a cache-oblivious sorting algorithm. ACM Journal of Experimental Algorithmics 12: (2007)
2006
28	EE	Gerth Stølting Brodal, Rolf Fagerberg: Cache-oblivious string dictionaries. SODA 2006: 581-590
27	EE	Rolf Fagerberg, Anna Pagh, Rasmus Pagh: External String Sorting: Faster and Cache-Oblivious. STACS 2006: 68-79
26	EE	Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips: Recrafting the neighbor-joining method. BMC Bioinformatics 7: 29 (2006)
25	EE	Philip Bille, Rolf Fagerberg, Inge Li Gørtz: Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts CoRR abs/cs/0609085: (2006)
2005
24	EE	Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz: On the Adaptiveness of Quicksort. ALENEX/ANALCO 2005: 130-140
23	EE	Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz: Cache-Aware and Cache-Oblivious Adaptive Sorting. ICALP 2005: 576-588
22	EE	Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen: Cache-oblivious planar orthogonal range searching and counting. Symposium on Computational Geometry 2005: 160-169
2004
21		Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther: Engineering a Cache-Oblivious Sorting Algorith. ALENEX/ANALC 2004: 4-17
20	EE	Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh: Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. SWAT 2004: 480-492
2003
19	EE	Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz: The Cost of Cache-Oblivious Searching. FOCS 2003: 271-282
18	EE	Gerth Stølting Brodal, Rolf Fagerberg: Lower bounds for external memory dictionaries. SODA 2003: 546-554
17	EE	Gerth Stølting Brodal, Rolf Fagerberg: On the limits of cache-obliviousness. STOC 2003: 307-315
16	EE	Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao: Computing Refined Buneman Trees in Cubic Time. WABI 2003: 259-270
15	EE	Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen: Computing the Quartet Distance between Evolutionary Trees in Time O(n log n). Algorithmica 38(2): 377-395 (2003)
2002
14	EE	Gerth Stølting Brodal, Rolf Fagerberg: Cache Oblivious Distribution Sweeping. ICALP 2002: 426-438
13	EE	Gerth Stølting Brodal, Rolf Fagerberg: Funnel Heap - A Cache Oblivious Priority Queue. ISAAC 2002: 219-228
12	EE	Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob: Cache oblivious search trees via binary trees of small height. SODA 2002: 39-48
2001
11	EE	Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin: The Complexity of Constructing Evolutionary Trees Using Experiments. ICALP 2001: 140-151
10	EE	Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen: Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n). ISAAC 2001: 731-742
9	EE	Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen: Search Trees with Relaxed Balance and Near-Optimal Height. WADS 2001: 414-425
1999
8	EE	Rolf Fagerberg: The Complexity of Rebalancing a Binary Serach Tree. FSTTCS 1999: 72-83
7	EE	Gerth Stølting Brodal, Rolf Fagerberg: Dynamic Representation of Sparse Graphs. WADS 1999: 342-351
1997
6		Joan Boyar, Rolf Fagerberg, Kim S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. J. Comput. Syst. Sci. 55(3): 504-521 (1997)
1996
5		Rolf Fagerberg: Binary Search Trees: How Low Can You Go? SWAT 1996: 428-439
4	EE	Rolf Fagerberg: A Generalization of Binomial Queues. Inf. Process. Lett. 57(2): 109-114 (1996)
3		Kim S. Larsen, Rolf Fagerberg: Efficient Rebalancing of B-Trees with Relaxed Balance. Int. J. Found. Comput. Sci. 7(2): 169- (1996)
1995
2	EE	Kim S. Larsen, Rolf Fagerberg: B-trees with relaxed balance. IPPS 1995: 196-202
1		Joan Boyar, Rolf Fagerberg, Kim S. Larsen: Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. WADS 1995: 270-281

Coauthor Index

1	Lars Arge	[22]
2	Michael A. Bender	[19] [30]
3	Philip Bille	[25] [32]
4	Joan Boyar	[1] [6]
5	Gerth Stølting Brodal	[7] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [26] [28] [29] [30] [31] [33] [34] [35] [36]
6	Irene Finocchi	[31]
7	Dongdong Ge	[19]
8	Inge Li Gørtz	[25] [32]
9	Fabrizio Grandoni	[31]
10	Simai He	[19]
11	Haodong Hu	[19]
12	John Iacono	[19]
13	Giuseppe F. Italiano	[31]
14	Riko Jacob	[12] [30]
15	Rune E. Jensen	[9]
16	Allan Grønlund Jørgensen	[31]
17	Kim S. Larsen	[1] [2] [3] [6] [9]
18	Morten Laustsen	[22]
19	Alejandro López-Ortiz	[19]
20	Thomas Mailund	[26] [33] [34] [35]
21	Ulrich Meyer	[20]
22	Thomas Mølhave	[31]
23	Gabriel Moruz	[23] [24] [31] [36]
24	Anna Pagh (Anna Östlin)	[11] [16] [27]
25	Rasmus Pagh	[27]
26	Christian N. S. Pedersen	[10] [11] [15] [16] [26] [33] [34] [35]
27	Derek Phillips	[26]
28	S. Srinivasa Rao (Srinivasa Rao Satti)	[16]
29	M. Stissing	[33] [34] [35]
30	Elias Vicari	[30]
31	Kristoffer Vinther	[21] [29]
32	Norbert Zeh	[20]

Colors in the list of coauthors