- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| p2 |      | |
| 2009 | ||
| j18 | | |
| 2008 | ||
| j17 | | Detlef Sieling: Minimization of decision trees is hard to approximate. J. Comput. Syst. Sci. 74(3): 394-403 (2008) |
| p1 | | |
| 2005 | ||
| j16 | | Martin Sauerhoff, Detlef Sieling: Quantum branching programs and space-bounded nonuniform quantum complexity. Theor. Comput. Sci. 334(1-3): 177-225 (2005) |
| j15 | | Petr Savický, Detlef Sieling: A hierarchy result for read-once branching programs with restricted parity nondeterminism. Theor. Comput. Sci. 340(3): 594-605 (2005) |
| 2003 | ||
| c8 | | Detlef Sieling: Minimization of Decision Trees Is Hard to Approximate. IEEE Conference on Computational Complexity 2003: 84-92 |
| 2002 | ||
| j14 | | Detlef Sieling: The complexity of minimizing and learning OBDDs and FBDDs. Discrete Applied Mathematics 122(1-3): 263-282 (2002) |
| j13 | | |
| j12 | | Detlef Sieling: Lower Bounds for Linearly Transformed OBDDs and FBDDs. J. Comput. Syst. Sci. 64(2): 419-438 (2002) |
| i8 | | Detlef Sieling: Minimization of Decision Trees is Hard to Approximate. Electronic Colloquium on Computational Complexity (ECCC)(054) (2002) |
| 2001 | ||
| j11 | | Detlef Sieling, Ingo Wegener: A Comparison of Free BDDs and Transformed BDDs. Formal Methods in System Design 19(3): 223-236 (2001) |
| j10 | | Rolf Drechsler, Detlef Sieling: Binary decision diagrams in theory and practice. STTT 3(2): 112-136 (2001) |
| i7 | | Petr Savický, Detlef Sieling: A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. Electronic Colloquium on Computational Complexity (ECCC) 8(17) (2001) |
| 2000 | ||
| j9 | | Detlef Sieling: A separation of syntactic and nonsyntactic (1, +k)-branching programs. Computational Complexity 9(3-4): 247-263 (2000) |
| c7 |  | Detlef Sieling: Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms. ICALP Satellite Workshops 2000: 259-262 |
| c6 | | Petr Savický, Detlef Sieling: A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. MFCS 2000: 650-659 |
| 1999 | ||
| c5 | | Detlef Sieling: Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract). FSTTCS 1999: 356-368 |
| c4 | | |
| i6 | | Detlef Sieling: The Complexity of Minimizing FBDDs. Electronic Colloquium on Computational Complexity (ECCC) 6(1) (1999) |
| i5 | | Detlef Sieling: Lower Bounds for Linear Transformed OBDDs and FBDDs. Electronic Colloquium on Computational Complexity (ECCC) 6(19) (1999) |
| 1998 | ||
| j8 | | Martin Löbbing, Detlef Sieling, Ingo Wegener: Parity OBDDs Cannot be Handled Efficiently Enough. Inf. Process. Lett. 67(4): 163-168 (1998) |
| j7 | | Detlef Sieling: Variable orderings and the size of OBDDs for random partially symmetric Boolean functions. Random Struct. Algorithms 13(1): 49-70 (1998) |
| j6 | | 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) |
| j5 | | Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener: Hierarchy Theorems for kOBDDs and kIBDDs. Theor. Comput. Sci. 205(1-2): 45-60 (1998) |
| c3 | | Detlef Sieling: On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract). STACS 1998: 205-215 |
| i4 | | Detlef Sieling: On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization. Electronic Colloquium on Computational Complexity (ECCC) 5(1) (1998) |
| i3 | | Detlef Sieling: A Separation of Syntactic and Nonsyntactic (1,+k)-Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 5(45) (1998) |
| 1997 | ||
| c2 | | Detlef Sieling: Derandomization. Lectures on Proof Verification and Approximation Algorithms 1997: 41-62 |
| 1996 | ||
| j4 | | Detlef Sieling: New Lower Bounds and Hierarchy Results for Restricted Branching Programs. J. Comput. Syst. Sci. 53(1): 79-87 (1996) |
| 1995 | ||
| j3 | | Detlef Sieling, Ingo Wegener: Graph Driven BDDs - A New Data Structure for Boolean Functions. Theor. Comput. Sci. 141(1&2): 283-310 (1995) |
| i2 | | Detlef Sieling: New Lower Bounds and Hierarchy Results for Restricted Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 2(2) (1995) |
| 1994 | ||
| c1 | | Detlef Sieling, Ingo Wegener: New Lower Bounds and Hierarchy Results for Restricted Branching Programs. WG 1994: 359-370 |
| i1 | | 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) |
| 1993 | ||
| j2 | | Detlef Sieling, Ingo Wegener: Reduction of OBDDs in Linear Time. Inf. Process. Lett. 48(3): 139-144 (1993) |
| j1 | | Detlef Sieling, Ingo Wegener: NC-Algorithms for Operations on Binary Decision Diagrams. Parallel Processing Letters 3: 3-12 (1993) |
| 1 | Beate Bollig | |
| 2 | Rolf Drechsler | |
| 3 | Martin Löbbing | |
| 4 | Martin Sauerhoff | |
| 5 | Petr Savický | |
| 6 | Ingo Wegener |
Data released under the ODC-BY 1.0 license — See also our legal information page