Constructing O(nlogn) size monotone formulae for the kth threshold function of n Boolean variables
SIAM Journal on Computing
Expanders, randomness, or time versus space
Proc. of the conference on Structure in complexity theory
On the power of two-point based sampling
Journal of Complexity
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On deterministic approximation of DNF
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
Simulating BPP using a general weak random source
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Approximations of general independent distributions
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximating the number of zeroes of a GF[2] polynomial
Journal of Algorithms
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximating hyper-rectangles: learning and pseudo-random sets
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Tight bounds for 2-dimensional indexing schemes
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Active sampling for multiple output identification
COLT'06 Proceedings of the 19th annual conference on Learning Theory
| Hi-index | 0.00 |