On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM (JACM)
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Parallel algorithms for algebraic problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A fast parallel algorithm for determining all roots of a polynomial with real roots
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Geometry theorem proving using Hilbert's Nullstellensatz
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
The complexity of linear problems in fields
Journal of Symbolic Computation
Complexity of deciding Tarski algebra
Journal of Symbolic Computation
An algorithm for generalized point location and its applications
Journal of Symbolic Computation
Specified precision polynomial root isolation is in NC
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A single-exponential upper bound for finding shortest paths in three dimensions
Journal of the ACM (JACM)
Topological queries in spatial databases
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Metalogical Frameworks II: Developing a Reflected Decision Procedure
Journal of Automated Reasoning
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Computation in real closed infinitesimal and transcendental extensions of the rationals
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Hi-index | 0.00 |