Detlef Sieling

38 papers A 2B 3Journal 26Unranked 3
YearRankTypeTitle / Venue / Authors
2011 — ch.
Playing Poker by Email.
Algorithms Unplugged
Detlef Sieling
2010 — ch.
Binary Decision Diagrams.
Boolean Models and Methods
Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Yves Crama, Peter L. Hammer
2009 J jnl
Minimization Problems for Parity OBDDs.
Theory Comput. Syst.
Detlef Sieling
2008 J jnl
Minimization of decision trees is hard to approximate.
J. Comput. Syst. Sci.
Detlef Sieling
2008 — ch.
Poker per E-Mail.
Taschenbuch der Algorithmen
Detlef Sieling
2005 J jnl
A hierarchy result for read-once branching programs with restricted parity nondeterminism.
Theor. Comput. Sci.
Petr Savický, Detlef Sieling
2005 J jnl
Quantum branching programs and space-bounded nonuniform quantum complexity.
Theor. Comput. Sci.
Martin Sauerhoff, Detlef Sieling
2003 A conf
Minimization of Decision Trees Is Hard to Approximate.
CCC
Detlef Sieling
2002 J jnl
Lower Bounds for Linearly Transformed OBDDs and FBDDs.
J. Comput. Syst. Sci.
Detlef Sieling
2002 J jnl
Minimization of Decision Trees is Hard to Approximate
Electron. Colloquium Comput. Complex.
Detlef Sieling
2002 J jnl
The Nonapproximability of OBDD Minimization.
Inf. Comput.
Detlef Sieling
2002 J jnl
The complexity of minimizing and learning OBDDs and FBDDs.
Discret. Appl. Math.
Detlef Sieling
2001 J jnl
A Comparison of Free BDDs and Transformed BDDs.
Formal Methods Syst. Des.
Detlef Sieling, Ingo Wegener
2001 J jnl
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
Electron. Colloquium Comput. Complex.
Petr Savický, Detlef Sieling
2001 J jnl
Binary decision diagrams in theory and practice.
Int. J. Softw. Tools Technol. Transf.
Rolf Drechsler, Detlef Sieling
2000 B conf
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism.
MFCS
Petr Savický, Detlef Sieling
2000 J jnl
A separation of syntactic and nonsyntactic (1, +k)-branching programs.
Comput. Complex.
Detlef Sieling
2000 — conf
Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms.
ICALP Satellite Workshops
Detlef Sieling
1999 J jnl
Lower Bounds for Linear Transformed OBDDs and FBDDs
Electron. Colloquium Comput. Complex.
Detlef Sieling
1999 — conf
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract).
FSTTCS
Detlef Sieling
1999 J jnl
The Complexity of Minimizing FBDDs
Electron. Colloquium Comput. Complex.
Detlef Sieling
1999 B conf
The Complexity of Minimizing FBDDs.
MFCS
Detlef Sieling
1998 J jnl
A Separation of Syntactic and Nonsyntactic (1,+k)-Branching Programs
Electron. Colloquium Comput. Complex.
Detlef Sieling
1998 J jnl
Hierarchy Theorems for
Theor. Comput. Sci.
Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
1998 J jnl
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization
Electron. Colloquium Comput. Complex.
Detlef Sieling
1998 A conf
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract).
STACS
Detlef Sieling
1998 J jnl
Parity OBDDs Cannot be Handled Efficiently Enough.
Inf. Process. Lett.
Martin Löbbing, Detlef Sieling, Ingo Wegener
1998 J jnl
The complexity of the inclusion operation on OFDD's.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Rolf Drechsler, Martin Sauerhoff, Detlef Sieling
1998 J jnl
Variable orderings and the size of OBDDs for random partially symmetric Boolean functions.
Random Struct. Algorithms
Detlef Sieling
1997 — conf
Derandomization.
Lectures on Proof Verification and Approximation Algorithms
Detlef Sieling
1996 J jnl
New Lower Bounds and Hierarchy Results for Restricted Branching Programs.
J. Comput. Syst. Sci.
Detlef Sieling
1995 — —
Algorithmen und untere Schranken für verallgemeinerte OBDDs.
Detlef Sieling
1995 J jnl
Graph Driven BDDs - A New Data Structure for Boolean Functions.
Theor. Comput. Sci.
Detlef Sieling, Ingo Wegener
1995 J jnl
New Lower Bounds and Hierarchy Results for Restricted Branching Programs
Electron. Colloquium Comput. Complex.
Detlef Sieling
1994 B conf
New Lower Bounds and Hierarchy Results for Restricted Branching Programs.
WG
Detlef Sieling, Ingo Wegener
1994 J jnl
On the Power of Different Types of Restricted Branching Programs
Electron. Colloquium Comput. Complex.
Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
1993 J jnl
NC-Algorithms for Operations on Binary Decision Diagrams.
Parallel Process. Lett.
Detlef Sieling, Ingo Wegener
1993 J jnl
Reduction of OBDDs in Linear Time.
Inf. Process. Lett.
Detlef Sieling, Ingo Wegener