# Detlef Sieling

According to our database

Collaborative distances:

^{1}, Detlef Sieling authored at least 31 papers between 1993 and 2011.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2011

Playing Poker by Email.

Proceedings of the Algorithms Unplugged, 2011

2010

Binary Decision Diagrams.

Proceedings of the Boolean Models and Methods in Mathematics, 2010

2009

Minimization Problems for Parity OBDDs.

Theory Comput. Syst., 2009

2008

Poker per E-Mail.

Proceedings of the Taschenbuch der Algorithmen, 2008

Minimization of decision trees is hard to approximate.

J. Comput. Syst. Sci., 2008

2005

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

Theor. Comput. Sci., 2005

Quantum branching programs and space-bounded nonuniform quantum complexity.

Theor. Comput. Sci., 2005

2002

Lower Bounds for Linearly Transformed OBDDs and FBDDs.

J. Comput. Syst. Sci., 2002

The Nonapproximability of OBDD Minimization.

Inf. Comput., 2002

The complexity of minimizing and learning OBDDs and FBDDs.

Discret. Appl. Math., 2002

2001

Binary decision diagrams in theory and practice.

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

A Comparison of Free BDDs and Transformed BDDs.

Formal Methods Syst. Des., 2001

2000

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

Comput. Complex., 2000

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

Proceedings of the ICALP Workshops 2000, 2000

1999

Lower Bounds for Linear Transformed OBDDs and FBDDs

Electronic Colloquium on Computational Complexity (ECCC), 1999

The Complexity of Minimizing FBDDs

Electronic Colloquium on Computational Complexity (ECCC), 1999

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

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

1998

Theor. Comput. Sci., 1998

The complexity of the inclusion operation on OFDD's.

IEEE Trans. on CAD of Integrated Circuits and Systems, 1998

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

Random Struct. Algorithms, 1998

Parity OBDDs Cannot be Handled Efficiently Enough.

Inf. Process. Lett., 1998

On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization

Electronic Colloquium on Computational Complexity (ECCC), 1998

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

Proceedings of the STACS 98, 1998

1997

Derandomization.

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.

J. Comput. Syst. Sci., 1996

1995

Algorithmen und untere Schranken für verallgemeinerte OBDDs.

PhD thesis, 1995

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

Theor. Comput. Sci., 1995

1994

On the Power of Different Types of Restricted Branching Programs

Electronic Colloquium on Computational Complexity (ECCC), 1994

New Lower Bounds and Hierarchy Results for Restricted Branching Programs.

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

1993

NC-Algorithms for Operations on Binary Decision Diagrams.

Parallel Process. Lett., 1993

Reduction of OBDDs in Linear Time.

Inf. Process. Lett., 1993