The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gerth Stølting Brodal: [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. Gerth Stølting Brodal, Leszek Gasieniec
    Approximate Dictionary Queries. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:65-74 [Conf]
  7. Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz
    Faster Algorithms for Computing Longest Common Increasing Subsequences. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:330-341 [Conf]
  8. Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye
    Finding Maximal Pairs with Bounded Gap. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:134-149 [Conf]
  9. Gerth Stølting Brodal, Christian N. S. Pedersen
    Finding Maximal Quasiperiodicities in Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 2000, pp:397-411 [Conf]
  10. Gerth Stølting Brodal, Gabriel Moruz
    Skewed Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:708-719 [Conf]
  11. Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas
    Purely Functional Worst Case Constant Time Catenable Sorted Lists. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:172-183 [Conf]
  12. Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
    New Data Structures for Orthogonal Range Searching. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:198-207 [Conf]
  13. 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]
  14. Gerth Stølting Brodal, Riko Jacob
    Dynamic Planar Convex Hull. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:617-626 [Conf]
  15. Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis
    Improved Dynamic Planar Point Location. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:305-314 [Conf]
  16. Gerth Stølting Brodal, Rolf Fagerberg
    Cache Oblivious Distribution Sweeping. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:426-438 [Conf]
  17. 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]
  18. 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]
  19. Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen
    Solving the String Statistics Problem in Time O(n log n). [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:728-739 [Conf]
  20. Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis
    A Parallel Priority Data Structure with Applications. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:689-693 [Conf]
  21. Gerth Stølting Brodal, Rolf Fagerberg
    Funnel Heap - A Cache Oblivious Priority Queue. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:219-228 [Conf]
  22. 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]
  23. Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter
    I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:11-20 [Conf]
  24. Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
    Pattern matching in dynamic texts. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:819-828 [Conf]
  25. Gerth Stølting Brodal
    Worst-Case Efficient Priority Queues. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:52-58 [Conf]
  26. Gerth Stølting Brodal
    Finger Search Trees with Constant Insertion Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:540-549 [Conf]
  27. Gerth Stølting Brodal, Rolf Fagerberg
    Lower bounds for external memory dictionaries. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:546-554 [Conf]
  28. Gerth Stølting Brodal, Rolf Fagerberg
    Cache-oblivious string dictionaries. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:581-590 [Conf]
  29. 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]
  30. Gerth Stølting Brodal
    Predecessor Queries in Dynamic Integer Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:21-32 [Conf]
  31. Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
    Optimal static range reporting in one dimension. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:476-482 [Conf]
  32. Gerth Stølting Brodal, Rolf Fagerberg
    On the limits of cache-obliviousness. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:307-315 [Conf]
  33. Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas
    Optimal finger search trees in the pointer machine. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:583-591 [Conf]
  34. Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe
    Time and Space Efficient Multi-method Dispatching. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:20-29 [Conf]
  35. Lars Arge, Gerth Stølting Brodal, Laura Toma
    On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:433-447 [Conf]
  36. Gerth Stølting Brodal
    Priority Queues on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:416-427 [Conf]
  37. Gerth Stølting Brodal
    Cache-Oblivious Algorithms and Data Structures. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:3-13 [Conf]
  38. Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
    The Randomized Complexity of Maintaining the Minimum. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:4-15 [Conf]
  39. 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]
  40. Gerth Stølting Brodal, Riko Jacob
    Dynamic Planar Convex Hull with Optimal Query Time. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:57-70 [Conf]
  41. Gerth Stølting Brodal, Jyrki Katajainen
    Worst-Case External-Memory Priority Queues. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:107-118 [Conf]
  42. Gerth Stølting Brodal, Maria Cristina Pinotti
    Comparator Networks for Binary Heap Construction. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:158-168 [Conf]
  43. 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]
  44. Gerth Stølting Brodal
    Fast Meldable Priority Queues. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:282-290 [Conf]
  45. Gerth Stølting Brodal, Rolf Fagerberg
    Dynamic Representation of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:342-351 [Conf]
  46. Gerth Stølting Brodal, Gabriel Moruz
    Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:385-395 [Conf]
  47. Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro
    Fast allocation and deallocation with an improved buddy system. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2005, v:41, n:4-5, pp:273-291 [Journal]
  48. 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]
  49. Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas
    Optimal Solutions for the Temporal Precedence Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:494-510 [Journal]
  50. 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]
  51. Gerth Stølting Brodal, Riko Jacob
    Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:92, n:, pp:3-15 [Journal]
  52. Gerth Stølting Brodal, Srinivasan Venkatesh
    Improved bounds for dictionary look-up with one error. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:1-2, pp:57-59 [Journal]
  53. Lars Arge, Gerth Stølting Brodal, Laura Toma
    On external-memory MST, SSSP and multi-way planar graph separation. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:53, n:2, pp:186-206 [Journal]
  54. Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas
    Optimal finger search trees in the pointer machine. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:381-418 [Journal]
  55. Gerth Stølting Brodal, Chris Okasaki
    Optimal Purely Functional Priority Queues. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1996, v:6, n:6, pp:839-857 [Journal]
  56. Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis
    A Parallel Priority Queue with Constant Time Operations. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:4-21 [Journal]
  57. Gerth Stølting Brodal
    Partially Persistent Data Structures of Bounded Degree with Constant Update Time. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:3, pp:238-255 [Journal]
  58. Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan
    The Randomized Complexity of Maintaining the Minimum. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:4, pp:337-351 [Journal]
  59. Gerth Stølting Brodal
    Priority queues on parallel machines. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1999, v:25, n:8, pp:987-1011 [Journal]
  60. Gerth Stølting Brodal, Maria Cristina Pinotti
    Comparator networks for binary heap construction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:235-245 [Journal]
  61. Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge
    The ComBack Method - Extending Hash Compaction with Backtracking. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2007, pp:445-464 [Conf]
  62. 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]
  63. Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel
    Dynamic Matchings in Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:406-417 [Conf]
  64. Gerth Stølting Brodal, Allan Grønlund Jørgensen
    A Linear Time Algorithm for the k Maximal Sums Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:442-453 [Conf]
  65. 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]
  66. 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]

  67. External memory planar point location with logarithmic updates. [Citation Graph (, )][DBLP]


  68. On Space Efficient Two Dimensional Range Minimum Data Structures. [Citation Graph (, )][DBLP]


  69. Selecting Sums in Arrays. [Citation Graph (, )][DBLP]


  70. Counting in the Presence of Memory Faults. [Citation Graph (, )][DBLP]


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


  72. Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time. [Citation Graph (, )][DBLP]


  73. Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. [Citation Graph (, )][DBLP]


  74. Fault Tolerant External Memory Algorithms. [Citation Graph (, )][DBLP]


Search in 0.459secs, Finished in 0.464secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002