| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Detlef Sieling |
Playing Poker by Email.  |
Algorithms Unplugged  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
Minimization Problems for Parity OBDDs. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Parity OBDD, Nonapproximability |
| 1 | Detlef Sieling |
Minimization of decision trees is hard to approximate. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
Poker per E-Mail. |
Taschenbuch der Algorithmen |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Savický, Detlef Sieling |
A hierarchy result for read-once branching programs with restricted parity nondeterminism. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Sauerhoff, Detlef Sieling |
Quantum branching programs and space-bounded nonuniform quantum complexity. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
Minimization of Decision Trees Is Hard to Approximate. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
Minimization of Decision Trees is Hard to Approximate |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Detlef Sieling |
The Nonapproximability of OBDD Minimization. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
The complexity of minimizing and learning OBDDs and FBDDs. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
Lower Bounds for Linearly Transformed OBDDs and FBDDs. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Savický, Detlef Sieling |
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Rolf Drechsler, Detlef Sieling |
Binary decision diagrams in theory and practice. |
STTT |
2001 |
DBLP DOI BibTeX RDF |
data structure, Boolean function, Binary decision diagram, VLSI CAD, Branching program |
| 1 | Detlef Sieling, Ingo Wegener |
A Comparison of Free BDDs and Transformed BDDs. |
Formal Methods in System Design |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
A separation of syntactic and nonsyntactic (1, +k)-branching programs. |
Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
nonsyntactic, lower bound, Branching program, syntactic |
| 1 | Detlef Sieling |
Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms. |
ICALP Satellite Workshops |
2000 |
DBLP BibTeX RDF |
|
| 1 | Petr Savický, Detlef Sieling |
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
The Complexity of Minimizing FBDDs |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Detlef Sieling |
Lower Bounds for Linear Transformed OBDDs and FBDDs |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Detlef Sieling |
The Complexity of Minimizing FBDDs. |
MFCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract). |
FSTTCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Löbbing, Detlef Sieling, Ingo Wegener |
Parity OBDDs Cannot be Handled Efficiently Enough. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Detlef Sieling |
A Separation of Syntactic and Nonsyntactic (1,+k)-Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener |
Hierarchy Theorems for kOBDDs and kIBDDs. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
Variable orderings and the size of OBDDs for random partially symmetric Boolean functions. |
Random Struct. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Drechsler, Martin Sauerhoff, Detlef Sieling |
The complexity of the inclusion operation on OFDD's. |
IEEE Trans. on CAD of Integrated Circuits and Systems |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract). |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
Derandomization. |
Lectures on Proof Verification and Approximation Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling |
New Lower Bounds and Hierarchy Results for Restricted Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Detlef Sieling, Ingo Wegener |
Graph Driven BDDs - A New Data Structure for Boolean Functions. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener |
On the Power of Different Types of Restricted Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1994 |
DBLP BibTeX RDF |
|
| 1 | Detlef Sieling, Ingo Wegener |
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. |
WG |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling, Ingo Wegener |
Reduction of OBDDs in Linear Time. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Detlef Sieling, Ingo Wegener |
NC-Algorithms for Operations on Binary Decision Diagrams. |
Parallel Processing Letters |
1993 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")