Algebraic decomposition of regular curves
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
There is no “Uspensky's method.”
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Quantifier elimination and the sign variation method for real root isolation
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
A note on the numerical evaluation of arctangent function
ACM SIGSAM Bulletin
Progress report on a system for general-purpose parallel symbolic algebraic computation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Polynomial algorithms for linear programming over the algebraic numbers
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Real zero isolation for trigonometric polynomials
ACM Transactions on Mathematical Software (TOMS)
An efficient approach to removing geometric degeneracies
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Real algebraic closure of an ordered field: implementation in Axiom
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Parallelizing algorithms for symbolic computation using MAPLE
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Symbolic-numeric nonlinear equation solving
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Asymptotically fast computation of subresultants
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting
IEEE Transactions on Knowledge and Data Engineering
An algorithm for isolating the real solutions of semi-algebraic systems
Journal of Symbolic Computation
Variable Independence, Quantifier Elimination, and Constraint Representations
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Towards faster real algebraic numbers
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Variable independence for first-order definable constraints
ACM Transactions on Computational Logic (TOCL)
Computer algebra handbook
Towards faster real algebraic numbers
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Complete, exact, and efficient computations with cubic curves
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Improved algorithms for computing determinants and resultants
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
On the exact computation of the topology of real algebraic curves
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Real solution isolation using interval arithmetic
Computers & Mathematics with Applications
Univariate polynomial real root isolation: continued fractions revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Exact Simulation of Integrate-and-Fire Models with Exponential Currents
Neural Computation
On the complexity of real root isolation using continued fractions
Theoretical Computer Science
Deciding polynomial-exponential problems
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Real Algebraic Numbers: Complexity Analysis and Experimentation
Reliable Implementation of Real Number Algorithms: Theory and Practice
The nearest polynomial with a zero in a given domain
Theoretical Computer Science
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
On the Complexity of Reliable Root Approximation
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Condition number based complexity estimate for solving polynomial systems
Journal of Computational and Applied Mathematics
GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems
Computers & Mathematics with Applications
Real root isolation of multi-exponential polynomials with application
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Improved bounds for the CF algorithm
Theoretical Computer Science
| Hi-index | 0.01 |