The parallel complexity of exponentiating polynomials over finite fields
Journal of the ACM (JACM)
Using smoothness to achieve parallelism
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
AT/sup 2/-Optimal Galois Field Multiplier for VLSI
IEEE Transactions on Computers
Inversion in finite fields using logarithmic depth
Journal of Symbolic Computation
Algorithms for sparse rational interpolation
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Depth-Size Tradeoffs for Neural Computation
IEEE Transactions on Computers - Special issue on artificial neural networks
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Cryptographic hardness of distribution-specific learning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Size-depth trade-offs for threshold circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
Simulating Boolean circuits on a DNA computer
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Computing a context-free grammar-generating series
Information and Computation
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
The Dynamic Complexity of Transitive Closure Is In DynTC0
ICDT '01 Proceedings of the 8th International Conference on Database Theory
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
A parametric error analysis of Goldschmidt's division algorithm
Journal of Computer and System Sciences
Threshold circuits of bounded depth
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Quantum Information Processing
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences
Fast arithmetics using Chinese remaindering
Information Processing Letters
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Logspace complexity of functions and structures
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Determinism versus nondeterminism with arithmetic tests and computation: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis
Fundamenta Informaticae
Root finding with threshold circuits
Theoretical Computer Science
Lower bounds for RAMs and quantifier elimination
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Algorithms and hardness results for parallel large margin learning
The Journal of Machine Learning Research
| Hi-index | 0.01 |