The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Rolf Fagerberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  35. Online Sorted Range Reporting. [Citation Graph (, )][DBLP]


  36. An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. [Citation Graph (, )][DBLP]


  37. An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002