Hauptinhalt

Technical Reports

• Martin Sauerhoff.
  Quantum vs. Classical Read-Once Branching Programs.
  quant-ph/0504198, 2005.

• Martin Sauerhoff und Detlef Sieling.
  Quantum Branching Programs and Space-Bounded Nonuniform Quantum Complexity.
  quant-ph/0403164, 2004.

• Martin Sauerhoff.
  Approximation of Boolean Functions by Combinatorial Rectangles.
  Technical Report 739, University of Dortmund, 2000.

• Martin Sauerhoff.
  An Improved Hierarchy Result for Partitioned BDDs.
  Technical Report 738, University of Dortmund, 2000.

• Martin Sauerhoff.
  On Nondeterminism versus Randomness for Read-Once Branching Programs.
  Technical Report 658, University of Dortmund, 1997.
  Results contained in STACS'98 paper "Lower Bounds for Randomized Read-k-Times Branching Programs."

• Martin Sauerhoff.
  A Lower Bound for Randomized Read-k-Times Branching Programs.
  Technical Report 645, University of Dortmund, 1997.
  Results contained in STACS'98 paper "Lower Bounds for Randomized Read-k-Times Branching Programs."

• Martin Sauerhoff, Ingo Wegener, Ralph Werchner.
  Optimal Ordererd Binary Decision Diagrams for Tree-like Circuits.
  Technical Report 613, University of Dortmund, 1996.
  Older version of "Optimal Ordererd Binary Decision Diagrams for Fanout-free Circuits."

• Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener.
  Complexity Theoretical Aspects of OFDDs.
  Technical Report 575, University of Dortmund, 1995.

• Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener.
  On the Power of Different Types of Restricted Branching Programs.
  Technical Report 562, University of Dortmund, 1994.
  Older version of "Hierarchy Theorems for kOBDDs and kIBDDs."

• Martin Sauerhoff, Ingo Wegener.
  On the Complexity of Minimizing the OBDD Size for Incompletely Specified Functions.
  Technical Report 560, University of Dortmund, 1994.

• Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener.
  Read k Times Ordered Binary Decision Diagrams - Efficient Algorithms in the Presence of Null Chains.
  Technical Report 474, University of Dortmund, 1993.
  Partially published in "Hierarchy Theorems for kOBDDs and kIBDDs."

• Martin Sauerhoff.
  Effiziente Algorithmen für kBDDs. (264K)
  Diploma Thesis, University of Dortmund, 1993 (in German).