| Publication | Date of Publication | Type |
|---|
| On the relation between structured \(d\)-DNNFs and SDDs | 2021-06-24 | Paper |
| On limitations of structured (deterministic) DNNFs | 2020-07-02 | Paper |
| On the relative succinctness of sentential decision diagrams | 2019-09-05 | Paper |
| Read-once projections and formal circuit verification with binary decision diagrams | 2017-11-16 | Paper |
| Exponential space complexity for OBDD-based reachability analysis | 2017-11-03 | Paper |
| On the minimization of (complete) ordered binary decision diagrams | 2017-01-12 | Paper |
| On the OBDD representation of some graph classes | 2016-09-30 | Paper |
| On the Width of Ordered Binary Decision Diagrams | 2015-09-11 | Paper |
| A read-once branching program lower bound of Ω(2 n/4 ) for integer multiplication using universal hashing | 2015-02-27 | Paper |
| Implicit computation of maximum bipartite matchings by sublinear functional operations | 2014-12-02 | Paper |
| On efficient implicit OBDD-based algorithms for maximal matchings | 2014-11-28 | Paper |
| On the Complexity of Some Ordering Problems | 2014-10-14 | Paper |
| A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm | 2014-04-14 | Paper |
| Priority functions for the approximation of the metric TSP | 2014-04-11 | Paper |
| Randomized OBDDs for the most significant bit of multiplication need exponential space | 2013-04-04 | Paper |
| On symbolic OBDD-based algorithms for the minimum spanning tree problem | 2012-08-13 | Paper |
| Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations | 2012-07-16 | Paper |
| An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings | 2012-06-08 | Paper |
| Larger lower bounds on the OBDD complexity of integer multiplication | 2011-07-27 | Paper |
| On the OBDD complexity of the most significant bit of integer multiplication | 2011-04-05 | Paper |
| New results on the most significant bit of integer multiplication | 2011-04-01 | Paper |
| Binary decision diagrams | 2011-03-09 | Paper |
| Randomized OBDDs for the most significant bit of multiplication need exponential size | 2011-02-15 | Paper |
| On symbolic OBDD-based algorithms for the minimum spanning tree problem | 2011-01-10 | Paper |
| On symbolic representations of maximum matchings and (Un)directed graphs | 2010-10-27 | Paper |
| Exact OBDD bounds for some fundamental functions | 2010-10-06 | Paper |
| Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks | 2010-09-03 | Paper |
| On the size of (generalized) OBDDs for threshold functions | 2010-08-16 | Paper |
| A note on the size of OBDDs for the graph of integer multiplication | 2010-06-09 | Paper |
| A larger lower bound on the OBDD complexity of the most significant bit of multiplication | 2010-04-27 | Paper |
| The optimal read-once branching program complexity for the direct storage access function | 2010-04-19 | Paper |
| Symbolic OBDD-based reachability analysis needs exponential space | 2010-01-28 | Paper |
| A large lower bound on the query complexity of a simple Boolean function | 2009-12-04 | Paper |
| Integer multiplication and the complexity of binary decision diagrams | 2009-09-22 | Paper |
| Functions that have read-once branching programs of quadratic size are not necessarily testable | 2009-04-28 | Paper |
| Larger Lower Bounds on the OBDD Complexity of Integer Multiplication | 2009-04-02 | Paper |
| A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs | 2009-03-23 | Paper |
| On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem | 2009-02-03 | Paper |
| New Results on the Most Significant Bit of Integer Multiplication | 2009-01-29 | Paper |
| On the OBDD Complexity of the Most Significant Bit of Integer Multiplication | 2008-05-27 | Paper |
| Exact OBDD Bounds for Some Fundamental Functions | 2008-03-07 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication | 2006-10-20 | Paper |
| A very simple function that requires exponential size read-once branching programs. | 2006-01-17 | Paper |
| A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications | 2006-01-10 | Paper |
| Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418658 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708564 | 2003-06-18 | Paper |
| On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536358 | 2002-06-25 | Paper |
| Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication | 2002-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754143 | 2001-12-09 | Paper |
| Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems | 2001-04-17 | Paper |
| On the Complexity of the Hidden Weighted Bit Function for Various BDD Models | 1999-09-22 | Paper |
| Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams | 1999-06-28 | Paper |
| Completeness and non-completeness results with respect to read-once projections | 1999-02-18 | Paper |
| Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs | 1999-01-12 | Paper |
| On the effect of local changes in the variable ordering of ordered decision diagrams | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885895 | 1996-11-04 | Paper |
| Improving the variable ordering of OBDDs is NP-complete | 1996-01-01 | Paper |
