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