Lower bounds on the complexity of 1-time only branching programs

On the complexity of branching programs and decision trees for clique functions

Journal of the ACM (JACM)

A lower bound for integer multiplication with read-once branching programs

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Lower bounds for linearly transformed OBDDs and FBDDs

Journal of Computer and System Sciences

Almost k-wise independence and hard Boolean functions

Theoretical Computer Science - Latin American theoretical informatics

On the size of randomized OBDDs and read-once branching programs for k-stable functions

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science