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