Detlef Sieling

Available identifiers

zbMath Open sieling.detlefMaRDI QIDQ210284

List of research outcomes

Publication	Date of Publication	Type
New lower bounds and hierarchy results for restricted branching programs	2024-01-05	Paper
Derandomization	2018-07-03	Paper
Parity OBDDs cannot be handled efficiently enough	2016-06-09	Paper
https://portal.mardi4nfdi.de/entity/Q3081627	2011-03-09	Paper
Minimization problems for parity OBDDs	2009-08-06	Paper
Minimization of decision trees is hard to approximate	2008-03-11	Paper
A hierarchy result for read-once branching programs with restricted parity nondeterminism	2005-09-22	Paper
Quantum branching programs and space-bounded nonuniform quantum complexity	2005-06-01	Paper
https://portal.mardi4nfdi.de/entity/Q4946959	2003-11-20	Paper
The nonapproximability of OBDD minimization	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4536401	2002-11-04	Paper
The complexity of minimizing and learning OBDDs and FBDDs	2002-08-29	Paper
Lower bounds for linearly transformed OBDDs and FBDDs	2002-08-04	Paper
Binary decision diagrams in theory and practice	2002-07-25	Paper
A separation of syntactic and nonsyntactic \((1,+k)\)-branching programs	2001-10-14	Paper
A comparison of free BDDs and transformed BDDs	2001-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4501682	2000-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q4941907	2000-03-19	Paper
Variable orderings and the size of OBDDs for random partially symmetric Boolean functions	1999-12-19	Paper
Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs	1999-01-12	Paper
New lower bounds and hierarchy results for restricted branching programs	1997-03-13	Paper
Graph driven BDDs -- a new data structure for Boolean functions	1997-02-28	Paper
Reduction of OBDDs in linear time	1993-01-01	Paper

Research outcomes over time

This page was built for person: Detlef Sieling