The complexity of approximate counting
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Ultra-fast expected time parallel algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Deterministic restrictions in circuit complexity
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Computational bounds for fundamental problems on general-purpose parallel models
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Derandomization of Constant Depth Circuits
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Threshold functions and bounded deptii monotone circuits
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Some connections between bounded query classes and non-uniform complexity
Information and Computation
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
Journal of Computer and System Sciences
Arithmetic, first-order logic, and counting quantifiers
ACM Transactions on Computational Logic (TOCL)
Verifying and decoding in constant depth
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Threshold circuits of bounded depth
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Randomness-Efficient Sampling within NC1
Computational Complexity
Finding a duplicate and a missing item in a stream
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Randomness-efficient sampling within NC1
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
| Hi-index | 0.01 |