Finite monoids and the fine structure of NC1
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Theoretical Computer Science
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Exact Characterization of Symmetric Functions in qAC0[2]
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
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)
Threshold circuits of bounded depth
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Theoretical Computer Science
Computing symmetric boolean functions by circuits with few exact threshold gates
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 5.23 |