Martin Sauerhoff

Publication Activity (10 Years)

Years Active: 1994-2010
Publications (10 Years): 0

Technical University of Dortmund, Germany (PHD)

Education History

Technical University of Dortmund, Germany

PHD

Publications

Martin Sauerhoff
An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order. Discret. Appl. Math. 158 (11) (2010)
André Gronemeier, Martin Sauerhoff
Applying Approximate Counting for Computing the Frequency Moments of Long Data Streams. Theory Comput. Syst. 44 (3) (2009)
Martin Sauerhoff
Quantum vs. Classical Read-Once Branching Programs. Complexity of Boolean Functions (2006)
Martin Sauerhoff, Detlef Sieling
Quantum branching programs and space-bounded nonuniform quantum complexity. Theor. Comput. Sci. 334 (1-3) (2005)
Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
On multi-partition communication complexity. Inf. Comput. 194 (1) (2004)
Martin Sauerhoff
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. J. Comput. Syst. Sci. 66 (3) (2003)
Martin Sauerhoff, Philipp Woelfel
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions. STOC (2003)
Martin Sauerhoff
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs. STACS (2003)
Juraj Hromkovic, Martin Sauerhoff
The Power of Nondeterminism and Randomness for Oblivious Branching Programs. Theory Comput. Syst. 36 (2) (2003)
Martin Sauerhoff
Approximation of boolean functions by combinatorial rectangles. Theor. Comput. Sci. 301 (1-3) (2003)
Beate Bollig, Martin Sauerhoff, Ingo Wegener
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. Inf. Comput. 178 (1) (2002)
Martin Sauerhoff
On the size of randomized OBDDs and read-once branching programs for k-stable functions. Comput. Complex. 10 (2) (2001)
Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
On Multipartition Communication Complexity. STACS (2001)
Beate Bollig, Martin Sauerhoff, Ingo Wegener
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. Computational Complexity Conference (2001)
Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
On Multipartition Communication Complexity Electron. Colloquium Comput. Complex. 8 (066) (2001)
Martin Sauerhoff
Randomized Branching Programs. SAGA (2001)
Martin Sauerhoff, Ingo Wegener, Ralph Werchner
Optimal ordered binary decision diagrams for read-once formulas. Discret. Appl. Math. 103 (1-3) (2000)
Martin Sauerhoff
An Improved Hierarchy Result for Partitioned BDDs Electron. Colloquium Comput. Complex. 7 (57) (2000)
Martin Sauerhoff
Approximation of Boolean Functions by Combinatorial Rectangles Electron. Colloquium Comput. Complex. 7 (58) (2000)
Juraj Hromkovic, Martin Sauerhoff
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. STACS (2000)
Martin Sauerhoff
An Improved Hierarchy Result for Partitioned BDDs. Theory Comput. Syst. 33 (4) (2000)
Martin Sauerhoff
Komplexitätstheoretische Ergebnisse für Randomisierte Branchingprogramme. Ausgezeichnete Informatikdissertationen (1999)
Martin Sauerhoff
On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions. STACS (1999)
Martin Sauerhoff, Ingo Wegener, Ralph Werchner
Relating Branching Program Size and Formula Size over the Full Binary Basis. STACS (1999)
Martin Sauerhoff
Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables. FSTTCS (1999)
Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener
On the complexity of the hidden weighted bit function for various BDD models. RAIRO Theor. Informatics Appl. 33 (2) (1999)
Martin Sauerhoff
Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract). STACS (1998)
Martin Sauerhoff
Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs Electron. Colloquium Comput. Complex. 5 (18) (1998)
Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
IBDDs. Theor. Comput. Sci. 205 (1-2) (1998)
Rolf Drechsler, Martin Sauerhoff, Detlef Sieling
The complexity of the inclusion operation on OFDD's. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17 (5) (1998)
Martin Sauerhoff
A Lower Bound for Randomized Read-k-Times Branching Programs Electron. Colloquium Comput. Complex. 4 (19) (1997)
Martin Sauerhoff
On Nondeterminism versus Randomness for Read-Once Branching Programs Electron. Colloquium Comput. Complex. 4 (30) (1997)
Martin Sauerhoff, Ingo Wegener, Ralph Werchner
Optimal Ordered Binary Decision Diagrams for Tree-like Circuits Electron. Colloquium Comput. Complex. 3 (22) (1996)
Martin Sauerhoff, Ingo Wegener
On the complexity of minimizing the OBDD size for incompletely specified functions. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15 (11) (1996)
Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
On the Power of Different Types of Restricted Branching Programs Electron. Colloquium Comput. Complex. 1 (26) (1994)

Martin Sauerhoff.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Martin Sauerhoff