Demo Data from EDBT 2026 / reviewers in the wild / expert
Detlef Sieling
dblp:27/6104
· DBLP profile ↗
22ranked-venue papers
15as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 20 · 15 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
3 papers |
Computational complexity · 59% Algorithms and data structures · 31% Logic in computer science · 11% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 100% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
hardness of approximation |
0.1 | 2 | 2003 | Minimization of Decision Trees Is Hard to Approximate · CCC 2003 The Nonapproximability of OBDD Minimization · Inf. Comput. 2002 |
Computational complexity › query complexity
decision tree complexity |
0.0 | 1 | 2003 | Minimization of Decision Trees Is Hard to Approximate · CCC 2003 |
Algorithms and data structures › decision tree
decision tree optimization |
0.0 | 1 | 2003 | Minimization of Decision Trees Is Hard to Approximate · CCC 2003 |
Electronic design automation › logic synthesis
decision diagrams |
0.0 | 1 | 1998 | The complexity of the inclusion operation on OFDD's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1998 |
Electronic design automation
logic synthesis |
0.0 | 1 | 1998 | The complexity of the inclusion operation on OFDD's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1998 |
Algorithms and data structures
polynomial-time algorithms |
0.0 | 1 | 1998 | The complexity of the inclusion operation on OFDD's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1998 |
Logic in computer science › algebraic logic › boolean algebra
boolean function representation |
0.0 | 1 | 2002 | The Nonapproximability of OBDD Minimization · Inf. Comput. 2002 |
Logic in computer science › algebraic logic › boolean algebra › boolean function representation
ordered binary decision diagram |
0.0 | 1 | 2002 | The Nonapproximability of OBDD Minimization · Inf. Comput. 2002 |
Electronic design automation › logic synthesis › logic minimization
boolean function minimization |
0.0 | 1 | 1998 | The complexity of the inclusion operation on OFDD's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1998 |
Methods — techniques the papers use, named apart from their topics
ordered functional decision diagrams · 0.0complexity-theoretic reduction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Minimization Problems for Parity OBDDs
Detlef Sieling |
Theory Comput. Syst. | 1 |
| 2008 | Minimization of decision trees is hard to approximate
Detlef Sieling |
J. Comput. Syst. Sci. | 1 |
| 2005 | Quantum branching programs and space-bounded nonuniform quantum complexity
Martin Sauerhoff, Detlef Sieling |
Theor. Comput. Sci. | 2 |
| 2005 | A hierarchy result for read-once branching programs with restricted parity nondeterminism
Petr Savický, Detlef Sieling |
Theor. Comput. Sci. | 2 |
| 2003 | Minimization of Decision Trees Is Hard to Approximate
Detlef Sieling |
CCC | 1 |
| 2002 | The complexity of minimizing and learning OBDDs and FBDDs
Detlef Sieling |
Discret. Appl. Math. | 1 |
| 2002 | The Nonapproximability of OBDD Minimization
Detlef Sieling |
Inf. Comput. | 1 |
| 2002 | Lower Bounds for Linearly Transformed OBDDs and FBDDs
Detlef Sieling |
J. Comput. Syst. Sci. | 1 |
| 2001 | A Comparison of Free BDDs and Transformed BDDs
Detlef Sieling, Ingo Wegener |
Formal Methods Syst. Des. | 1 |
| 2001 | Binary decision diagrams in theory and practice
Rolf Drechsler, Detlef Sieling |
Int. J. Softw. Tools Technol. Transf. | 2 |
| 2000 | A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
Petr Savický, Detlef Sieling |
MFCS | 2 |
| 2000 | A separation of syntactic and nonsyntactic (1, +k)-branching programs
Detlef Sieling |
Comput. Complex. | 1 |
| 1999 | Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)
Detlef Sieling |
FSTTCS | 1 |
| 1999 | The Complexity of Minimizing FBDDs
Detlef Sieling |
MFCS | 1 |
| 1998 | On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract)
Detlef Sieling |
STACS | 1 |
| 1998 | Parity OBDDs Cannot be Handled Efficiently Enough
Martin Löbbing, Detlef Sieling, Ingo Wegener |
Inf. Process. Lett. | 2 |
| 1998 | The complexity of the inclusion operation on OFDD'sabstractOrdered functional decision diagrams (OFDD's) are a data structure for representation and manipulation of Boolean functions. A polynomial time algorithm for the test whether f/spl les/g for functions f and g given by OFDD's is presented. This is the last basic operation on OFDD's whose complexity was unknown. The result also solves an open question on the complexity of minimizing OFDD's for incompletely specified functions. Rolf Drechsler, Martin Sauerhoff, Detlef Sieling |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 3 |
| 1998 | Hierarchy Theorems for kOBDDs and kIBDDs
Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener |
Theor. Comput. Sci. | 3 |
| 1996 | New Lower Bounds and Hierarchy Results for Restricted Branching Programs
Detlef Sieling |
J. Comput. Syst. Sci. | 1 |
| 1995 | Graph Driven BDDs - A New Data Structure for Boolean Functions
Detlef Sieling, Ingo Wegener |
Theor. Comput. Sci. | 1 |
| 1994 | New Lower Bounds and Hierarchy Results for Restricted Branching Programs
Detlef Sieling, Ingo Wegener |
WG | 1 |
| 1993 | Reduction of OBDDs in Linear Time
Detlef Sieling, Ingo Wegener |
Inf. Process. Lett. | 1 |