BibSonomy :: author  ::

bookmarks

publications

(32)

• Quantum vs. Classical Read-Once Branching Programs.
  Martin Sauerhoff Complexity of Boolean Functions (2006)
  to dblp by dblp on 2008-05-14 00:00:00
  | URL | BibTeX  
• Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs
  Martin Sauerhoff Electronic Colloquium on Computational Complexity (ECCC) 5 (1998)
  to dblp by dblp on 2006-06-30 00:00:00
  | URL | BibTeX  
• On Nondeterminism versus Randomness for Read-Once Branching Programs
  Martin Sauerhoff Electronic Colloquium on Computational Complexity (ECCC) 4 (1997)
  to dblp by dblp on 2006-06-30 00:00:00
  | URL | BibTeX  
• A Lower Bound for Randomized Read-k-Times Branching Programs
  Martin Sauerhoff Electronic Colloquium on Computational Complexity (ECCC) 4 (1997)
  to dblp by dblp on 2006-06-30 00:00:00
  | URL | BibTeX  
• Optimal Ordered Binary Decision Diagrams for Tree-like Circuits
  Martin Sauerhoff and Ingo Wegener and Ralph Werchner Electronic Colloquium on Computational Complexity (ECCC) 3 (1996)
  to dblp by dblp on 2006-06-30 00:00:00
  | URL | BibTeX  
• On the Power of Different Types of Restricted Branching Programs
  Beate Bollig and Martin Sauerhoff and Detlef Sieling and Ingo Wegener Electronic Colloquium on Computational Complexity (ECCC) 1 (1994)
  to dblp by dblp on 2006-06-30 00:00:00
  | URL | BibTeX  
• On Multipartition Communication Complexity
  Pavol Duris and Juraj Hromkovic and Stasys Jukna and Martin Sauerhoff and Georg Schnitger Electronic Colloquium on Computational Complexity (ECCC) 8 (2001)
  to dblp by dblp and 1 other person on 2006-06-30 00:00:00
  | URL | BibTeX  
• Approximation of Boolean Functions by Combinatorial Rectangles
  Martin Sauerhoff Electronic Colloquium on Computational Complexity (ECCC) 7 (2000)
  to dblp by dblp on 2006-06-30 00:00:00
  | URL | BibTeX  
• An Improved Hierarchy Result for Partitioned BDDs
  Martin Sauerhoff Electronic Colloquium on Computational Complexity (ECCC) 7 (2000)
  to dblp by dblp and 1 other person on 2006-06-30 00:00:00
  | URL | BibTeX  
• On the complexity of minimizing the OBDD size for incompletely specified functions.
  Martin Sauerhoff and Ingo Wegener IEEE Trans. on CAD of Integrated Circuits and Systems 15 1435-1437 (1996)
  to dblp by dblp on 2006-05-24 00:00:00
  | URL | BibTeX