Brodal, Gerth Stølting

• BRICS Report Series No. 1 (1996): RS-1 A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth - Articles
  A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth
  Abstract  PDF
• BRICS Report Series No. 12 (1995): RS-12 Fast Meldable Priority Queues - Articles
  Fast Meldable Priority Queues
  Abstract  PDF
• BRICS Report Series No. 37 (1996): RS-37 Optimal Purely Functional Priority Queues - Articles
  Optimal Purely Functional Priority Queues
  Abstract  PDF
• BRICS Report Series No. 40 (1996): RS-40 The Randomized Complexity of Maintaining the Minimum - Articles
  The Randomized Complexity of Maintaining the Minimum
  Abstract  PDF
• BRICS Report Series No. 42 (1996): RS-42 The Complexity of Computing the k-ary Composition of a Binary Associative Operator - Articles
  The Complexity of Computing the k-ary Composition of a Binary Associative Operator
  Abstract  PDF
• BRICS Report Series No. 25 (1999): RS-25 Finding Maximal Quasiperiodicities in Strings - Articles
  Finding Maximal Quasiperiodicities in Strings
  Abstract  PDF
• BRICS Report Series No. 50 (1999): RS-50 Improved Bounds for Dictionary Look-up with One Error - Articles
  Improved Bounds for Dictionary Look-up with One Error
  Abstract  PDF
• BRICS Report Series No. 12 (1999): RS-12 Finding Maximal Pairs with Bounded Gap - Articles
  Finding Maximal Pairs with Bounded Gap
  Abstract  PDF
• BRICS Report Series No. 51 (2002): RS-51 Computing Refined Buneman Trees in Cubic Time - Articles
  Computing Refined Buneman Trees in Cubic Time
  Abstract  PDF
• BRICS Report Series No. 1 (2001): RS-1 The Complexity of Constructing Evolutionary Trees Using Experiments - Articles
  The Complexity of Constructing Evolutionary Trees Using Experiments
  Abstract  PDF
• BRICS Report Series No. 35 (1994): RS-35 Partially Persistent Data Structures of Bounded Degree with Constant Update Time - Articles
  Partially Persistent Data Structures of Bounded Degree with Constant Update Time
  Abstract  PDF
• BRICS Report Series No. 36 (2001): RS-36 Cache Oblivious Search Trees via Binary Trees of Small Height - Articles
  Cache Oblivious Search Trees via Binary Trees of Small Height
  Abstract  PDF
• BRICS Report Series No. 13 (2002): RS-13 Solving the String Statistics Problem in Time O(n log n) - Articles
  Solving the String Statistics Problem in Time O(n log n)
  Abstract  PDF
• BRICS Report Series No. 37 (2005): RS-37 Faster Algorithms for Computing Longest Common Increasing Subsequences - Articles
  Faster Algorithms for Computing Longest Common Increasing Subsequences
  Abstract  PDF
• BRICS Report Series No. 2 (2004): RS-2 Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths - Articles
  Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
  Abstract  PDF
• BRICS Report Series No. 27 (2004): RS-27 On the Adaptiveness of Quicksort - Articles
  On the Adaptiveness of Quicksort
  Abstract  PDF
• BRICS Report Series No. 18 (2002): RS-18 Cache Oblivious Distribution Sweeping - Articles
  Cache Oblivious Distribution Sweeping
  Abstract
• BRICS Report Series No. 12 (2007): RS-12 Optimal Resilient Dynamic Dictionaries - Articles
  Optimal Resilient Dynamic Dictionaries
  Abstract