Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
Reduced order LQG controllers for linear time varying plants
Systems & Control Letters
Reduction of OBDDs in linear time
Information Processing Letters
Information Processing Letters
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
On lower bounds for read-k-times branching programs
Computational Complexity
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Bit-level analysis of an SRT divider circuit
DAC '96 Proceedings of the 33rd annual Design Automation Conference
On the effect of local changes in the variable ordering of ordered decision diagrams
Information Processing Letters
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Hierarchy theorems for kOBDDs and kIBDDs
Theoretical Computer Science
A Lower Bound for Integer Multiplication with Read-Once Branching Programs
SIAM Journal on Computing
Analysis of composition complexity and how to obtain smaller canonical graphs
Proceedings of the 37th Annual Design Automation Conference
Optimal ordered binary decision diagrams for read-once formulas
Discrete Applied Mathematics
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Time-space tradeoffs for branching programs
Journal of Computer and System Sciences
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
Formal Methods in System Design
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
An Exponential Lower Bound for One-Time-Only Branching Programs
Proceedings of the Mathematical Foundations of Computer Science 1984
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Higher-Radix Division Using Estimates of the Divisor and Partial Remainders
IEEE Transactions on Computers
The recognition problem for the set of perfect squares
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Computing query probability with incidence algebras
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Knowledge compilation meets database theory: compiling queries to decision diagrams
Proceedings of the 14th International Conference on Database Theory
Finding compact BDDs using genetic programming
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
On the tractability of query compilation and bounded treewidth
Proceedings of the 15th International Conference on Database Theory
Probabilistic databases with MarkoViews
Proceedings of the VLDB Endowment
The dichotomy of probabilistic inference for unions of conjunctive queries
Journal of the ACM (JACM)
| Hi-index | 0.04 |
BDDs (binary decision diagrams) and their variants are the most frequently used representation types or data structures for boolean functions. Research on BDD variants has turned out to be one of the areas where the symbiosis between theoretical investigations in algorithm design and analysis, complexity theory, and applications has led to progress in theory and in applications. Here the different roots of the interest in BDDs are described, the main BDD variants and their algorithmic properties are presented, the representation size of selected functions is investigated, lower bound techniques are discussed and applications to algorithmic graph problems and hardware verification problems are presented.