Two lower bounds for branching programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
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
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of minimizing and learning OBDDs and FBDDs
Discrete Applied Mathematics
Lower bounds for linearly transformed OBDDs and FBDDs
Journal of Computer and System Sciences
The Complexity of Minimizing FBDDs
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Optimal Free Binary Decision Diagrams for Computation of EARn
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
A Lower Bound Technique for Restricted Branching Programs and Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Almost k-wise independence and hard Boolean functions
Theoretical Computer Science - Latin American theoretical informatics
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Free binary decision diagrams for the computation of EARn
Computational Complexity
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
On Average Time Complexity of Decision Trees and Branching Programs
Fundamenta Informaticae
Hi-index | 0.00 |