STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On learning Read-k-Satisfy-j DNF
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Pointer jumping requires concurrent read
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A theorem on sensitivity and applications in private computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Covering Sequences of Boolean Functions and Their Cryptographic Significance
Designs, Codes and Cryptography
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
Information and Computation
An improved lower bound on the sensitivity complexity of graph properties
Theoretical Computer Science
Gems in decision tree complexity revisited
ACM SIGACT News
| Hi-index | 0.00 |