default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDetlef Sieling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[p3]Detlef Sieling:
Playing Poker by Email. Algorithms Unplugged 2011: 169-180- 2010
- [p2]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Yves Crama, Peter L. Hammer:
Binary Decision Diagrams. Boolean Models and Methods 2010: 473-505
2000 – 2009
- 2009
- [j18]Detlef Sieling:
Minimization Problems for Parity OBDDs. Theory Comput. Syst. 44(3): 391-413 (2009) - 2008
- [j17]Detlef Sieling:
Minimization of decision trees is hard to approximate. J. Comput. Syst. Sci. 74(3): 394-403 (2008) - [p1]Detlef Sieling:
Poker per E-Mail. Taschenbuch der Algorithmen 2008: 181-192 - 2005
- [j16]Martin Sauerhoff, Detlef Sieling:
Quantum branching programs and space-bounded nonuniform quantum complexity. Theor. Comput. Sci. 334(1-3): 177-225 (2005) - [j15]Petr Savický, Detlef Sieling:
A hierarchy result for read-once branching programs with restricted parity nondeterminism. Theor. Comput. Sci. 340(3): 594-605 (2005) - 2003
- [c8]Detlef Sieling:
Minimization of Decision Trees Is Hard to Approximate. CCC 2003: 84-92 - 2002
- [j14]Detlef Sieling:
The complexity of minimizing and learning OBDDs and FBDDs. Discret. Appl. Math. 122(1-3): 263-282 (2002) - [j13]Detlef Sieling:
The Nonapproximability of OBDD Minimization. Inf. Comput. 172(2): 103-138 (2002) - [j12]Detlef Sieling:
Lower Bounds for Linearly Transformed OBDDs and FBDDs. J. Comput. Syst. Sci. 64(2): 419-438 (2002) - [i8]Detlef Sieling:
Minimization of Decision Trees is Hard to Approximate. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j11]Detlef Sieling, Ingo Wegener:
A Comparison of Free BDDs and Transformed BDDs. Formal Methods Syst. Des. 19(3): 223-236 (2001) - [j10]Rolf Drechsler
, Detlef Sieling:
Binary decision diagrams in theory and practice. Int. J. Softw. Tools Technol. Transf. 3(2): 112-136 (2001) - [i7]Petr Savický, Detlef Sieling:
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j9]Detlef Sieling:
A separation of syntactic and nonsyntactic (1, +k)-branching programs. Comput. Complex. 9(3-4): 247-263 (2000) - [c7]Detlef Sieling:
Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms. ICALP Satellite Workshops 2000: 259-262 - [c6]Petr Savický, Detlef Sieling:
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. MFCS 2000: 650-659
1990 – 1999
- 1999
- [c5]Detlef Sieling:
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract). FSTTCS 1999: 356-368 - [c4]Detlef Sieling:
The Complexity of Minimizing FBDDs. MFCS 1999: 251-261 - [i6]Detlef Sieling:
The Complexity of Minimizing FBDDs. Electron. Colloquium Comput. Complex. TR99 (1999) - [i5]Detlef Sieling:
Lower Bounds for Linear Transformed OBDDs and FBDDs. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j8]Martin Löbbing, Detlef Sieling, Ingo Wegener:
Parity OBDDs Cannot be Handled Efficiently Enough. Inf. Process. Lett. 67(4): 163-168 (1998) - [j7]Detlef Sieling:
Variable orderings and the size of OBDDs for random partially symmetric Boolean functions. Random Struct. Algorithms 13(1): 49-70 (1998) - [j6]Rolf Drechsler, Martin Sauerhoff, Detlef Sieling:
The complexity of the inclusion operation on OFDD's. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(5): 457-459 (1998) - [j5]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener:
Hierarchy Theorems for kOBDDs and kIBDDs. Theor. Comput. Sci. 205(1-2): 45-60 (1998) - [c3]Detlef Sieling:
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract). STACS 1998: 205-215 - [i4]Detlef Sieling:
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization. Electron. Colloquium Comput. Complex. TR98 (1998) - [i3]Detlef Sieling:
A Separation of Syntactic and Nonsyntactic (1,+k)-Branching Programs. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c2]Detlef Sieling:
Derandomization. Lectures on Proof Verification and Approximation Algorithms 1997: 41-62 - 1996
- [j4]Detlef Sieling:
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. J. Comput. Syst. Sci. 53(1): 79-87 (1996) - 1995
- [b1]Detlef Sieling:
Algorithmen und untere Schranken für verallgemeinerte OBDDs. Technical University of Dortmund, Germany, Shaker 1995, ISBN 978-3-8265-0454-9, pp. 1-133 - [j3]Detlef Sieling, Ingo Wegener:
Graph Driven BDDs - A New Data Structure for Boolean Functions. Theor. Comput. Sci. 141(1&2): 283-310 (1995) - [i2]Detlef Sieling:
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [c1]Detlef Sieling, Ingo Wegener:
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. WG 1994: 359-370 - [i1]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener:
On the Power of Different Types of Restricted Branching Programs. Electron. Colloquium Comput. Complex. TR94 (1994) - 1993
- [j2]Detlef Sieling, Ingo Wegener:
Reduction of OBDDs in Linear Time. Inf. Process. Lett. 48(3): 139-144 (1993) - [j1]Detlef Sieling, Ingo Wegener:
NC-Algorithms for Operations on Binary Decision Diagrams. Parallel Process. Lett. 3: 3-12 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
