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
Bit-level analysis of an SRT divider circuit
DAC '96 Proceedings of the 33rd annual Design Automation Conference
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The parallel complexity of deterministic and probabilistic automata
Journal of Automata, Languages and Combinatorics
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Approximating Boolean functions by OBDDs
Discrete Applied Mathematics
Powering requires threshold depth 3
Information Processing Letters
Cryptographic hardness for learning intersections of halfspaces
Journal of Computer and System Sciences
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
On the OBDD complexity of the most significant bit of integer multiplication
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Larger lower bounds on the OBDD complexity of integer multiplication
Information and Computation
On the OBDD complexity of the most significant bit of integer multiplication
Theoretical Computer Science
Lower bounds on the OBDD size of graphs of some popular functions
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Automatica (Journal of IFAC)
Hi-index | 0.01 |