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

On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs

Information and Computation

Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs

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

Approximation of boolean functions by combinatorial rectangles

Theoretical Computer Science

Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines

Journal of Computer and System Sciences

Quantum branching programs and space-bounded nonuniform quantum complexity

Theoretical Computer Science

On probabilistic pushdown automata

Information and Computation