Miltersen, Peter Bro
-
BRICS Report Series Nr. 3 (1999): RS-3 Two Notes on the Computational Complexity of One-Dimensional Sandpiles - Artikler
Two Notes on the Computational Complexity of One-Dimensional Sandpiles
Resumé PDF (English) -
BRICS Report Series Nr. 45 (2003): RS-45 On converting CNF to DNF - Artikler
On converting CNF to DNF
Resumé PDF (English) -
BRICS Report Series Nr. 17 (1997): RS-17 Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries - Artikler
Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
Resumé PDF (English) -
BRICS Report Series Nr. 41 (1994): RS-41 On Data Structures and Asymmetric Communication Complexity - Artikler
On Data Structures and Asymmetric Communication Complexity
Resumé PDF (English) -
BRICS Report Series Nr. 47 (1999): RS-47 Derandomizing Arthur-Merlin Games using Hitting Sets - Artikler
Derandomizing Arthur-Merlin Games using Hitting Sets
Resumé PDF (English) -
BRICS Report Series Nr. 46 (1999): RS-46 Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy - Artikler
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy
Resumé PDF (English) -
BRICS Report Series Nr. 9 (2005): RS-9 Reviewing Bounds on the Circuit Size of the Hardest Functions - Artikler
Reviewing Bounds on the Circuit Size of the Hardest Functions
Resumé PDF (English) -
BRICS Report Series Nr. 26 (1995): RS-26 Tables should be sorted (on random access machines) - Artikler
Tables should be sorted (on random access machines)
Resumé PDF (English) -
BRICS Report Series Nr. 30 (1996): RS-30 Fusion Trees can be Implemented with AC0 Instructions only - Artikler
Fusion Trees can be Implemented with AC0 Instructions only
Resumé PDF (English) -
BRICS Report Series Nr. 50 (2002): RS-50 Circuits on Cylinders - Artikler
Circuits on Cylinders
Resumé PDF (English) -
BRICS Report Series Nr. 44 (2003): RS-44 The Cell Probe Complexity of Succinct Data Structures - Artikler
The Cell Probe Complexity of Succinct Data Structures
Resumé PDF (English) -
BRICS Report Series Nr. 14 (1997): RS-14 Dictionaries on AC^0 RAMs: Query Time Theta(√log n/log log n) is Necessary and Sufficient - Artikler
Dictionaries on AC^0 RAMs: Query Time Theta(√log n/log log n) is Necessary and Sufficient
Resumé PDF (English) -
BRICS Report Series Nr. 12 (1997): RS-12 Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower Bounds - Artikler
Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower Bounds
Resumé PDF (English) -
BRICS Report Series Nr. 1 (1995): RS-01 Dynamic Algorithms for the Dyck Languages - Artikler
Dynamic Algorithms for the Dyck Languages
Resumé PDF (English) -
BRICS Report Series Nr. 34 (1998): RS-34 The Complexity of Identifying Large Equivalence Classes - Artikler
The Complexity of Identifying Large Equivalence Classes
Resumé PDF (English) -
BRICS Report Series Nr. 11 (1998): RS-11 Lower Bounds for Dynamic Algebraic Problems - Artikler
Lower Bounds for Dynamic Algebraic Problems
Resumé PDF (English) -
BRICS Report Series Nr. 25 (1997): RS-25 Searching ConstantWidth Mazes Captures the AC0 Hierarchy - Artikler
Searching Constant Width Mazes Captures the AC0 Hierarchy
Resumé PDF (English) -
BRICS Report Series Nr. 16 (1997): RS-16 Linear Hashing - Artikler
Linear Hashing
Resumé PDF (English)