Detlef Sieling

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
New lower bounds and hierarchy results for restricted branching programs Graph-Theoretic Concepts in Computer Science	2024-01-05	Paper
Derandomization Lectures on Proof Verification and Approximation Algorithms	2018-07-03	Paper
Parity OBDDs cannot be handled efficiently enough Information Processing Letters	2016-06-09	Paper
Binary decision diagrams	2011-03-09	Paper
Minimization problems for parity OBDDs Theory of Computing Systems	2009-08-06	Paper
Minimization of decision trees is hard to approximate Journal of Computer and System Sciences	2008-03-11	Paper
A hierarchy result for read-once branching programs with restricted parity nondeterminism Theoretical Computer Science	2005-09-22	Paper
Quantum branching programs and space-bounded nonuniform quantum complexity Theoretical Computer Science	2005-06-01	Paper
scientific article; zbMATH DE number 1423227 (Why is no real title available?)	2003-11-20	Paper
The nonapproximability of OBDD minimization Information and Computation	2003-01-14	Paper
scientific article; zbMATH DE number 1759451 (Why is no real title available?)	2002-11-04	Paper
The complexity of minimizing and learning OBDDs and FBDDs Discrete Applied Mathematics	2002-08-29	Paper
Lower bounds for linearly transformed OBDDs and FBDDs Journal of Computer and System Sciences	2002-08-04	Paper
Binary decision diagrams in theory and practice International Journal on Software Tools for Technology Transfer. STTT	2002-07-25	Paper
A separation of syntactic and nonsyntactic \((1,+k)\)-branching programs Computational Complexity	2001-10-14	Paper
A comparison of free BDDs and transformed BDDs Formal Methods in System Design	2001-01-01	Paper
scientific article; zbMATH DE number 1500660 (Why is no real title available?)	2000-09-04	Paper
scientific article; zbMATH DE number 1418344 (Why is no real title available?)	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 Theoretical Computer Science	1999-01-12	Paper
New lower bounds and hierarchy results for restricted branching programs Journal of Computer and System Sciences	1997-03-13	Paper
Graph driven BDDs -- a new data structure for Boolean functions Theoretical Computer Science	1997-02-28	Paper
Reduction of OBDDs in linear time Information Processing Letters	1993-01-01	Paper

Research outcomes over time

This page was built for person: Detlef Sieling