Detlef Sieling - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 37 from 37

2011

Playing Poker by EmailDetlef Sieling. In Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, editors, Algorithms Unplugged. pages 169-180, Springer, 2011. [doi]

2010

Binary Decision DiagramsBeate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Yves Crama, Peter L. Hammer. In Yves Crama, Peter L. Hammer, editors, Boolean Models and Methods in Mathematics, Computer Science, and Engineering. pages 473-505, Cambridge University Press, 2010. [doi]

2009

Minimization Problems for Parity OBDDsDetlef Sieling. mst, 44(3):391-413, 2009. [doi]

2008

Minimization of decision trees is hard to approximateDetlef Sieling. jcss, 74(3):394-403, 2008. [doi]

2005

Quantum branching programs and space-bounded nonuniform quantum complexityMartin Sauerhoff, Detlef Sieling. TCS, 334(1-3):177-225, 2005. [doi]

A hierarchy result for read-once branching programs with restricted parity nondeterminismPetr Savický, Detlef Sieling. TCS, 340(3):594-605, 2005. [doi]

2003

Minimization of Decision Trees Is Hard to ApproximateDetlef Sieling. cocoon 2003: 84-92 [doi]

2002

Minimization of Decision Trees is Hard to ApproximateDetlef Sieling. eccc, (054), 2002. [doi]

The complexity of minimizing and learning OBDDs and FBDDsDetlef Sieling. DAM, 122(1-3):263-282, 2002.

The Nonapproximability of OBDD MinimizationDetlef Sieling. iandc, 172(2):103-138, 2002. [doi]

Lower Bounds for Linearly Transformed OBDDs and FBDDsDetlef Sieling. jcss, 64(2):419-438, 2002. [doi]

2001

Binary decision diagrams in theory and practiceRolf Drechsler, Detlef Sieling. STTT, 3(2):112-136, 2001. [doi]

A Hierarchy Result for Read-Once Branching Programs with Restricted Parity NondeterminismPetr Savický, Detlef Sieling. eccc, 8(17), 2001. [doi]

A Comparison of Free BDDs and Transformed BDDsDetlef Sieling, Ingo Wegener. fmsd, 19(3):223-236, 2001.

2000

A Hierarchy Result for Read-Once Branching Programs with Restricted Parity NondeterminismPetr Savický, Detlef Sieling. mfcs 2000: 650-659 [doi]

A separation of syntactic and nonsyntactic (1, +k)-branching programsDetlef Sieling. cc, 9(3-4):247-263, 2000. [doi]

Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and AlgorithmsDetlef Sieling. icalp 2000: 259-262

1999

The Complexity of Minimizing FBDDsDetlef Sieling. mfcs 1999: 251-261

Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)Detlef Sieling. fsttcs 1999: 356-368 [doi]

Lower Bounds for Linear Transformed OBDDs and FBDDsDetlef Sieling. eccc, 6(19), 1999. [doi]

The Complexity of Minimizing FBDDsDetlef Sieling. eccc, 6(1), 1999. [doi]

1998

Hierarchy Theorems for ::::k::::OBDDs and ::::k::::IBDDsBeate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener. TCS, 205(1-2):45-60, 1998. [doi]

The complexity of the inclusion operation on OFDD sRolf Drechsler, Martin Sauerhoff, Detlef Sieling. tcad, 17(5):457-459, 1998. [doi]

Parity OBDDs Cannot be Handled Efficiently EnoughMartin Löbbing, Detlef Sieling, Ingo Wegener. ipl, 67(4):163-168, 1998. [doi]

A Separation of Syntactic and Nonsyntactic (1,+k)-Branching ProgramsDetlef Sieling. eccc, 5(45), 1998. [doi]

On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract)Detlef Sieling. STACS 1998: 205-215

On the Existence of Polynomial Time Approximation Schemes for OBDD MinimizationDetlef Sieling. eccc, 5(1), 1998. [doi]

Variable orderings and the size of OBDDs for random partially symmetric Boolean functionsDetlef Sieling. rsa, 13(1):49-70, 1998.

1997

DerandomizationDetlef Sieling. Dagstuhl 1998: 41-62 [doi]

1996

New Lower Bounds and Hierarchy Results for Restricted Branching ProgramsDetlef Sieling. jcss, 53(1):79-87, 1996.

1995

Graph Driven BDDs - A New Data Structure for Boolean FunctionsDetlef Sieling, Ingo Wegener. TCS, 141(1&2):283-310, 1995. [doi]

New Lower Bounds and Hierarchy Results for Restricted Branching ProgramsDetlef Sieling. eccc, 2(2), 1995. [doi]

Algorithmen und untere Schranken für verallgemeinerte OBDDsDetlef Sieling. PhD thesis, Technical University of Dortmund, Germany, 1995. [doi]

1994

On the Power of Different Types of Restricted Branching ProgramsBeate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener. eccc, 1(26), 1994. [doi]

New Lower Bounds and Hierarchy Results for Restricted Branching ProgramsDetlef Sieling, Ingo Wegener. criwg 1995: 359-370

1993

Reduction of OBDDs in Linear TimeDetlef Sieling, Ingo Wegener. ipl, 48(3):139-144, 1993.

NC-Algorithms for Operations on Binary Decision DiagramsDetlef Sieling, Ingo Wegener. ppl, 3:3-12, 1993.

Sign in or sign up to see more results.

runs on WebDSL