The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Deterministic restrictions in circuit complexity
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Bounded-depth circuits: separating wires from gates
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Circuit Complexity of Regular Languages
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
| Hi-index | 0.89 |