Detlef Sieling

Publication Activity (10 Years)

Years Active: 1993-2009
Publications (10 Years): 0

Technical University of Dortmund, Germany (PHD)

Education History

Technical University of Dortmund, Germany

PHD

Publications

Detlef Sieling
Minimization Problems for Parity OBDDs. Theory Comput. Syst. 44 (3) (2009)
Detlef Sieling
Minimization of decision trees is hard to approximate. J. Comput. Syst. Sci. 74 (3) (2008)
Petr Savický, Detlef Sieling
A hierarchy result for read-once branching programs with restricted parity nondeterminism. Theor. Comput. Sci. 340 (3) (2005)
Martin Sauerhoff, Detlef Sieling
Quantum branching programs and space-bounded nonuniform quantum complexity. Theor. Comput. Sci. 334 (1-3) (2005)
Detlef Sieling
Minimization of Decision Trees Is Hard to Approximate. Computational Complexity Conference (2003)
Detlef Sieling
Lower Bounds for Linearly Transformed OBDDs and FBDDs. J. Comput. Syst. Sci. 64 (2) (2002)
Detlef Sieling
The Nonapproximability of OBDD Minimization. Inf. Comput. 172 (2) (2002)
Detlef Sieling
The complexity of minimizing and learning OBDDs and FBDDs. Discret. Appl. Math. 122 (1-3) (2002)
Detlef Sieling
Minimization of Decision Trees is Hard to Approximate Electron. Colloquium Comput. Complex. (054) (2002)
Rolf Drechsler, Detlef Sieling
Binary decision diagrams in theory and practice. Int. J. Softw. Tools Technol. Transf. 3 (2) (2001)
Detlef Sieling, Ingo Wegener
A Comparison of Free BDDs and Transformed BDDs. Formal Methods Syst. Des. 19 (3) (2001)
Petr Savický, Detlef Sieling
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism Electron. Colloquium Comput. Complex. 8 (17) (2001)
Detlef Sieling
Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms. ICALP Satellite Workshops (2000)
Petr Savický, Detlef Sieling
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. MFCS (2000)
Detlef Sieling
A separation of syntactic and nonsyntactic (1, +k)-branching programs. Comput. Complex. 9 (3-4) (2000)
Detlef Sieling
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract). FSTTCS (1999)
Detlef Sieling
Lower Bounds for Linear Transformed OBDDs and FBDDs Electron. Colloquium Comput. Complex. 6 (19) (1999)
Detlef Sieling
The Complexity of Minimizing FBDDs Electron. Colloquium Comput. Complex. 6 (1) (1999)
Detlef Sieling
The Complexity of Minimizing FBDDs. MFCS (1999)
Detlef Sieling
A Separation of Syntactic and Nonsyntactic (1,+k)-Branching Programs Electron. Colloquium Comput. Complex. 5 (45) (1998)
Detlef Sieling
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization Electron. Colloquium Comput. Complex. 5 (1) (1998)
Detlef Sieling
Variable orderings and the size of OBDDs for random partially symmetric Boolean functions. Random Struct. Algorithms 13 (1) (1998)
Martin Löbbing, Detlef Sieling, Ingo Wegener
Parity OBDDs Cannot be Handled Efficiently Enough. Inf. Process. Lett. 67 (4) (1998)
Detlef Sieling
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract). STACS (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)
Detlef Sieling
Derandomization. Lectures on Proof Verification and Approximation Algorithms (1997)
Detlef Sieling
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. J. Comput. Syst. Sci. 53 (1) (1996)
Detlef Sieling, Ingo Wegener
Graph Driven BDDs - A New Data Structure for Boolean Functions. Theor. Comput. Sci. 141 (1&2) (1995)
Detlef Sieling
New Lower Bounds and Hierarchy Results for Restricted Branching Programs Electron. Colloquium Comput. Complex. 2 (2) (1995)
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)
Detlef Sieling, Ingo Wegener
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. WG (1994)
Detlef Sieling, Ingo Wegener
Reduction of OBDDs in Linear Time. Inf. Process. Lett. 48 (3) (1993)
Detlef Sieling, Ingo Wegener
NC-Algorithms for Operations on Binary Decision Diagrams. Parallel Process. Lett. 3 (1993)

Detlef Sieling.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Detlef Sieling