STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Optimal Free Binary Decision Diagrams for Computation of EARn
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Lower Bound Technique for Restricted Branching Programs and Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
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
Free binary decision diagrams for the computation of EARn
Computational Complexity
Bounds on the Fourier coefficients of the weighted sum function
Information Processing Letters
Laced Boolean functions and subset sum problems in finite fields
Discrete Applied Mathematics
On the average sensitivity of the weighted sum function
Information Processing Letters
| Hi-index | 5.23 |