Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications

MFCS '02 Proceedings of the 27th 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

Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Lower bounds for restricted read-once parity branching programs

Theoretical Computer Science