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

Decomposable negation normal form

Journal of the ACM (JACM)

Some Notes on the Information Flow in Read-Once Branching Programs

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics

Almost k-wise independence and hard Boolean functions

Theoretical Computer Science - Latin American theoretical informatics

On converting CNF to DNF

Theoretical Computer Science

Redundancy-free residual dispatch: using ordered binary decision diagrams for efficient dispatch

Proceedings of the 7th workshop on Foundations of aspect-oriented languages

Knowledge compilation meets database theory: compiling queries to decision diagrams

Proceedings of the 14th International Conference on Database Theory