A lower bound for integer greatest common divisor computations
Journal of the ACM (JACM)
On the complexity of RAM with various operation sets
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Discontinuities in recurrent neural networks
Neural Computation
A characterization of the class of functions computable in polynomial time on Random Access Machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
Preface: Festschrift in honor of Arnold Schönhage
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Semidefinite programming and arithmetic circuit evaluation
Discrete Applied Mathematics
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Parallel and Sequential Optical Computing
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
On Faster Integer Calculations Using Non-arithmetic Primitives
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Preface: Festschrift in honor of Arnold Schönhage
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
Finding the smallest gap between sums of square roots
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On comparing sums of square roots of small integers
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Equivalence problems for circuits over sets of natural numbers
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Net and prune: a linear time algorithm for euclidean distance problems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The orbit problem in higher dimensions
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |