Approximate Euclidean shortest path in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Towards practical constraint databases (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A computational basis for higher-dimensional computational geometry and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A strong and easily computable separation bound for arithmetic expressions involving square roots
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
Proceedings of the sixteenth annual symposium on Computational geometry
A new constructive root bound for algebraic expressions
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An iterated eigenvalue algorithm for approximating roots of univariate polynomials
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Root comparison techniques applied to computing the additively weighted Voronoi diagram
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Separation Bound for Real Algebraic Expressions
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Theoretical Computer Science - Latin American theoretical informatics
Constructive root bound for k-ary rational input numbers
Proceedings of the nineteenth annual symposium on Computational geometry
The reliable algorithmic software challenge RASC
Computer Science in Perspective
Towards and open curved kernel
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm
Combinatorics, Probability and Computing
On the exact computation of the topology of real algebraic curves
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Shortest path amidst disc obstacles is computable
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The predicates of the Apollonius diagram: algorithmic analysis and implementation
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Counterexamples to the uniformity conjecture
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
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
Complete subdivision algorithms, I: intersection of Bezier curves
Proceedings of the twenty-second annual symposium on Computational geometry
The predicates for the Voronoi diagram of ellipses
Proceedings of the twenty-second annual symposium on Computational geometry
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Implementation techniques for fast polynomial arithmetic in a high-level programming environment
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Constructive root bound for k-ary rational input numbers
Theoretical Computer Science
Univariate polynomial real root isolation: continued fractions revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Differential equations for algebraic functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Complete numerical isolation of real zeros in zero-dimensional triangular systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On the complexity of real solving bivariate systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Complexity of real root isolation using continued fractions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On the complexity of real root isolation using continued fractions
Theoretical Computer Science
Exact and efficient 2D-arrangements of arbitrary algebraic curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Electronic Notes in Theoretical Computer Science (ENTCS)
Eta pairing computation on general divisors over hyperelliptic curves y2=xp-x+d
Journal of Symbolic Computation
Fast communication: An analysis of Seysen's lattice reduction algorithm
Signal Processing
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves
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
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice
An efficient local approach to convexity testing of piecewise-linear hypersurfaces
Computational Geometry: Theory and Applications
Real algebraic numbers and polynomial systems of small degree
Theoretical Computer Science
Complexity of real root isolation using continued fractions
Theoretical Computer Science
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Using signature sequences to classify intersection curves of two quadrics
Computer Aided Geometric Design
Computing a rational in between
ACM Communications in Computer Algebra
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Deterministic random walks on the two-dimensional grid
Combinatorics, Probability and Computing
On the asymptotic and practical complexity of solving bivariate systems over the reals
Journal of Symbolic Computation
Complete numerical isolation of real roots in zero-dimensional triangular systems
Journal of Symbolic Computation
Univariate Algebraic Kernel and Application to Arrangements
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Lower bounds for zero-dimensional projections
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Root isolation for bivariate polynomial systems with local generic position method
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computations modulo regular chains
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Isolating real roots of real polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Continued fraction expansion of real roots of polynomial systems
Proceedings of the 2009 conference on Symbolic numeric computation
Solving global geometric constraints on free-form curves
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
The predicates of the Apollonius diagram: Algorithmic analysis and implementation
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
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
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
On the Complexity of Reliable Root Approximation
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
The reliable algorithmic software challenge RASC
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Bounds on absolute positiveness of multivariate polynomials
Journal of Symbolic Computation
A geometric approach to collective motion
Proceedings of the twenty-sixth annual symposium on Computational geometry
Random polynomials and expected complexity of bisection methods for real solving
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
The DMM bound: multivariate (aggregate) separation bounds
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Using the witness method to detect rigid subsystems of geometric constraints in CAD
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
Journal of Symbolic Computation
A deterministic algorithm for isolating real roots of a real polynomial
Journal of Symbolic Computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Thomas decomposition of algebraic and differential systems
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Theoretical Computer Science
Exact algorithms for solving stochastic games: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Efficient real root approximation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Univariate real root isolation in an extension field
Proceedings of the 36th international symposium on Symbolic and algebraic computation
A simple but exact and efficient algorithm for complex root isolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Bell inequalities and entanglement
Quantum Information & Computation
Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves
Journal of Symbolic Computation
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Journal of Symbolic Computation
A worst-case bound for topology computation of algebraic curves
Journal of Symbolic Computation
Efficient implementation of polynomial arithmetic in a multiple-level programming environment
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Termination of integer linear programs
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Proving formally the implementation of an efficient gcd algorithm for polynomials
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A descartes algorithm for polynomials with bit-stream coefficients
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Real solving of bivariate polynomial systems
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
The diamond operator: implementation of exact real algebraic numbers
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Inequalities on upper bounds for real polynomial roots
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
Root isolation of zero-dimensional polynomial systems with linear univariate representation
Journal of Symbolic Computation
Algorithmic Thomas decomposition of algebraic and differential systems
Journal of Symbolic Computation
Computing bits of algebraic numbers
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Number of zeros of interval polynomials
Journal of Computational and Applied Mathematics
Eta pairing computation on general divisors over hyperelliptic curves y2 = x7 - x ± 1
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
On computing the centroid of the vertices of an arrangement and related problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Bounds for real roots and applications to orthogonal polynomials
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Root finding with threshold circuits
Theoretical Computer Science
Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
Journal of Symbolic Computation
Local generic position for root isolation of zero-dimensional triangular polynomial systems
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Near optimal tree size bounds on a simple real root isolation algorithm
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Univariate real root isolation in multiple extension fields
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Improved bounds for the CF algorithm
Theoretical Computer Science
Separating linear forms for bivariate systems
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Rational univariate representations of bivariate systems and applications
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On the boolean complexity of real root refinement
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
Journal of Symbolic Computation
Probabilistic equivalence verification approach for automatic mathematical solution assessment
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Flip distance between triangulations of a planar point set is APX-hard
Computational Geometry: Theory and Applications
| Hi-index | 0.01 |