Miltersen, Peter Bro

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