Detlef Sieling

According to our database, Detlef Sieling authored at least 31 papers between 1993 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Playing Poker by Email.

Detlef Sieling

Proceedings of the Algorithms Unplugged, 2011

2010

Binary Decision Diagrams.

Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Yves Crama, Peter L. Hammer

Proceedings of the Boolean Models and Methods in Mathematics, 2010

2009

Minimization Problems for Parity OBDDs.

Detlef Sieling

Theory Comput. Syst., 2009

2008

Poker per E-Mail.

Detlef Sieling

Proceedings of the Taschenbuch der Algorithmen, 2008

Minimization of decision trees is hard to approximate.

Detlef Sieling

J. Comput. Syst. Sci., 2008

2005

A hierarchy result for read-once branching programs with restricted parity nondeterminism.

Petr Savický, Detlef Sieling

Theor. Comput. Sci., 2005

Quantum branching programs and space-bounded nonuniform quantum complexity.

Martin Sauerhoff, Detlef Sieling

Theor. Comput. Sci., 2005

2002

Lower Bounds for Linearly Transformed OBDDs and FBDDs.

Detlef Sieling

J. Comput. Syst. Sci., 2002

The Nonapproximability of OBDD Minimization.

Detlef Sieling

Inf. Comput., 2002

The complexity of minimizing and learning OBDDs and FBDDs.

Detlef Sieling

Discret. Appl. Math., 2002

2001

Binary decision diagrams in theory and practice.

Rolf Drechsler, Detlef Sieling

Int. J. Softw. Tools Technol. Transf., 2001

A Comparison of Free BDDs and Transformed BDDs.

Detlef Sieling, Ingo Wegener

Formal Methods Syst. Des., 2001

2000

A separation of syntactic and nonsyntactic (1, +k)-branching programs.

Detlef Sieling

Comput. Complex., 2000

Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms.

Detlef Sieling

Proceedings of the ICALP Workshops 2000, 2000

1999

Lower Bounds for Linear Transformed OBDDs and FBDDs

Detlef Sieling

Electron. Colloquium Comput. Complex., 1999

The Complexity of Minimizing FBDDs

Detlef Sieling

Electron. Colloquium Comput. Complex., 1999

Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract).

Detlef Sieling

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998

Hierarchy Theorems for <i>k</i>OBDDs and <i>k</i>IBDDs.

Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener

Theor. Comput. Sci., 1998

The complexity of the inclusion operation on OFDD's.

Rolf Drechsler, Martin Sauerhoff, Detlef Sieling

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1998

Variable orderings and the size of OBDDs for random partially symmetric Boolean functions.

Detlef Sieling

Random Struct. Algorithms, 1998

Parity OBDDs Cannot be Handled Efficiently Enough.

Martin Löbbing, Detlef Sieling, Ingo Wegener

Inf. Process. Lett., 1998

On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization

Detlef Sieling

Electron. Colloquium Comput. Complex., 1998

On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract).

Detlef Sieling

Proceedings of the STACS 98, 1998

1997

Derandomization.

Detlef Sieling

Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

1996

New Lower Bounds and Hierarchy Results for Restricted Branching Programs.

Detlef Sieling

J. Comput. Syst. Sci., 1996

1995

Algorithmen und untere Schranken für verallgemeinerte OBDDs.

Detlef Sieling

PhD thesis, 1995

Graph Driven BDDs - A New Data Structure for Boolean Functions.

Detlef Sieling, Ingo Wegener

Theor. Comput. Sci., 1995

1994

On the Power of Different Types of Restricted Branching Programs

Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener

Electron. Colloquium Comput. Complex., 1994

New Lower Bounds and Hierarchy Results for Restricted Branching Programs.

Detlef Sieling, Ingo Wegener

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993

NC-Algorithms for Operations on Binary Decision Diagrams.

Detlef Sieling, Ingo Wegener

Parallel Process. Lett., 1993

Reduction of OBDDs in Linear Time.

Detlef Sieling, Ingo Wegener

Inf. Process. Lett., 1993