| 2006 |
|---|
| 32 | EE | Martin Sauerhoff:
Quantum vs. Classical Read-Once Branching Programs.
Complexity of Boolean Functions 2006 |
| 2005 |
|---|
| 31 | EE | Martin Sauerhoff,
Detlef Sieling:
Quantum branching programs and space-bounded nonuniform quantum complexity.
Theor. Comput. Sci. 334(1-3): 177-225 (2005) |
| 2004 |
|---|
| 30 | EE | Pavol Duris,
Juraj Hromkovic,
Stasys Jukna,
Martin Sauerhoff,
Georg Schnitger:
On multi-partition communication complexity.
Inf. Comput. 194(1): 49-75 (2004) |
| 2003 |
|---|
| 29 | EE | Martin Sauerhoff:
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs.
STACS 2003: 307-318 |
| 28 | EE | Martin Sauerhoff,
Philipp Woelfel:
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions.
STOC 2003: 186-195 |
| 27 | EE | Martin Sauerhoff:
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines.
J. Comput. Syst. Sci. 66(3): 473-495 (2003) |
| 26 | EE | Martin Sauerhoff:
Approximation of boolean functions by combinatorial rectangles.
Theor. Comput. Sci. 1-3(301): 45-78 (2003) |
| 25 | EE | Juraj Hromkovic,
Martin Sauerhoff:
The Power of Nondeterminism and Randomness for Oblivious Branching Programs.
Theory Comput. Syst. 36(2): 159-182 (2003) |
| 2002 |
|---|
| 24 | EE | Beate Bollig,
Martin Sauerhoff,
Ingo Wegener:
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs.
Inf. Comput. 178(1): 263-278 (2002) |
| 2001 |
|---|
| 23 | EE | Beate Bollig,
Martin Sauerhoff,
Ingo Wegener:
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs.
IEEE Conference on Computational Complexity 2001: 172-183 |
| 22 | EE | Martin Sauerhoff:
Randomized Branching Programs.
SAGA 2001: 65-72 |
| 21 | EE | Pavol Duris,
Juraj Hromkovic,
Stasys Jukna,
Martin Sauerhoff,
Georg Schnitger:
On Multipartition Communication Complexity.
STACS 2001: 206-217 |
| 20 | EE | Martin Sauerhoff:
On the size of randomized OBDDs and read-once branching programs for k-stable functions.
Computational Complexity 10(2): 155-178 (2001) |
| 19 | EE | Pavol Duris,
Juraj Hromkovic,
Stasys Jukna,
Martin Sauerhoff,
Georg Schnitger:
On Multipartition Communication Complexity
Electronic Colloquium on Computational Complexity (ECCC) 8(066): (2001) |
| 2000 |
|---|
| 18 | EE | Juraj Hromkovic,
Martin Sauerhoff:
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs.
STACS 2000: 145-156 |
| 17 | | Martin Sauerhoff,
Ingo Wegener,
Ralph Werchner:
Optimal ordered binary decision diagrams for read-once formulas.
Discrete Applied Mathematics 103(1-3): 237-258 (2000) |
| 16 | EE | Martin Sauerhoff:
An Improved Hierarchy Result for Partitioned BDDs
Electronic Colloquium on Computational Complexity (ECCC) 7(57): (2000) |
| 15 | EE | Martin Sauerhoff:
Approximation of Boolean Functions by Combinatorial Rectangles
Electronic Colloquium on Computational Complexity (ECCC) 7(58): (2000) |
| 14 | EE | Martin Sauerhoff:
An Improved Hierarchy Result for Partitioned BDDs.
Theory Comput. Syst. 33(4): 313-329 (2000) |
| 1999 |
|---|
| 13 | EE | Martin Sauerhoff:
Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables.
FSTTCS 1999: 342-355 |
| 12 | EE | Martin Sauerhoff:
On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions.
STACS 1999: 488-499 |
| 11 | EE | Martin Sauerhoff,
Ingo Wegener,
Ralph Werchner:
Relating Branching Program Size and Formula Size over the Full Binary Basis.
STACS 1999: 57-67 |
| 10 | | Beate Bollig,
Martin Löbbing,
Martin Sauerhoff,
Ingo Wegener:
On the complexity of the hidden weighted bit function for various BDD models.
ITA 33(2): 103-116 (1999) |
| 1998 |
|---|
| 9 | | Martin Sauerhoff:
Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract).
STACS 1998: 105-115 |
| 8 | EE | Martin Sauerhoff:
Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 5(18): (1998) |
| 7 | EE | Rolf Drechsler,
Martin Sauerhoff,
Detlef Sieling:
The complexity of the inclusion operation on OFDD's.
IEEE Trans. on CAD of Integrated Circuits and Systems 17(5): 457-459 (1998) |
| 6 | EE | Beate Bollig,
Martin Sauerhoff,
Detlef Sieling,
Ingo Wegener:
Hierarchy Theorems for kOBDDs and kIBDDs.
Theor. Comput. Sci. 205(1-2): 45-60 (1998) |
| 1997 |
|---|
| 5 | EE | Martin Sauerhoff:
A Lower Bound for Randomized Read-k-Times Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 4(19): (1997) |
| 4 | EE | Martin Sauerhoff:
On Nondeterminism versus Randomness for Read-Once Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 4(30): (1997) |
| 1996 |
|---|
| 3 | EE | Martin Sauerhoff,
Ingo Wegener,
Ralph Werchner:
Optimal Ordered Binary Decision Diagrams for Tree-like Circuits
Electronic Colloquium on Computational Complexity (ECCC) 3(22): (1996) |
| 2 | EE | Martin Sauerhoff,
Ingo Wegener:
On the complexity of minimizing the OBDD size for incompletely specified functions.
IEEE Trans. on CAD of Integrated Circuits and Systems 15(11): 1435-1437 (1996) |
| 1994 |
|---|
| 1 | EE | Beate Bollig,
Martin Sauerhoff,
Detlef Sieling,
Ingo Wegener:
On the Power of Different Types of Restricted Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 1(26): (1994) |
