Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs

The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost all Boolean Functions

IEEE Transactions on Computers

Efficient OBDD-based boolean manipulation in CAD beyond current limits

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference

A Unifying Theoretical Background for Some Bdd-based Data Structures

Formal Methods in System Design

Ordered binary decision diagrams

Logic Synthesis and Verification

Data structures for Boolean functions

Computational Discrete Mathematics

Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's

IEEE Transactions on Computers

Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science

Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science

A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs

Information Processing Letters

Lower bounds for restricted read-once parity branching programs

Theoretical Computer Science