Marc Moreno Maza

Xiaohui Chen

Abdoul-Kader Keita

Ning Xie

Proceedings of 25th Annual International Conference on Computer Science and Software Engineering, 2015

Simplification of Cylindrical Algebraic Formulas.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

Regular Chains under Linear Changes of Coordinates and Applications.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

2014

Zigzag Form over Families of Parametric Matrices.

[BibT_eX]

[DOI]

Robert M. Corless

Steven E. Thornton

ACM Commun. Comput. Algebra, 2014

Basic Polynomial Algebra Subprograms.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2014

Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - International Conference, 2014

MetaFork: A Framework for Concurrency Platforms Targeting Multicores.

[BibT_eX]

[DOI]

Proceedings of the Using and Improving OpenMP for Devices, Tasks, and More, 2014

Dense Arithmetic over Finite Fields with the CUMODP Library.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

Solving Parametric Polynomial Systems by RealComprehensiveTriangularize.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

Cylindrical Algebraic Decomposition in the RegularChains Library.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

Real Quantifier Elimination in the RegularChains Library.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

Doing Algebraic Geometry with the RegularChains Library.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

On the Parallelization of Subproduct Tree Techniques Targeting Many-Core Architectures.

[BibT_eX]

[DOI]

Sardar Anisul Haque

Farnam Mansouri

Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2013

Computing with semi-algebraic sets: Relaxation techniques and effective boundaries.

[BibT_eX]

[DOI]

J. Symb. Comput., 2013

Triangular decomposition of semi-algebraic systems.

[BibT_eX]

[DOI]

J. Symb. Comput., 2013

An Application of Regular Chain Theory to the Study of Limit cycles.

[BibT_eX]

[DOI]

Int. J. Bifurc. Chaos, 2013

An Algorithm for Computing the Limit Points of the Quasi-component of a Regular Chain

[BibT_eX]

[DOI]

Parisa Alvandi

CoRR, 2013

Computing the Limit Points of the Quasi-component of a Regular Chain in Dimension One.

[BibT_eX]

[DOI]

Parisa Alvandi

Proceedings of the Computer Algebra in Scientific Computing - 15th International Workshop, 2013

2012

On Solving Parametric Polynomial Systems.

[BibT_eX]

[DOI]

Bican Xia

Rong Xiao

Math. Comput. Sci., 2012

Algorithms for computing triangular decomposition of polynomial systems.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

Generating Program Invariants via Interpolation

[BibT_eX]

[DOI]

Rong Xiao

CoRR, 2012

Inversion Modulo Zero-Dimensional Regular Chains.

[BibT_eX]

[DOI]

Paul Vrbik

Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

On Fulton's Algorithm for Computing Intersection Multiplicities.

[BibT_eX]

[DOI]

Steffen Marcus

Paul Vrbik

Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

Degree and Dimension Estimates for Invariant Ideals of \(P\) -Solvable Recurrences.

[BibT_eX]

[DOI]

Rong Xiao

Proceedings of the Computer Mathematics, 2012

An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions.

[BibT_eX]

[DOI]

Proceedings of the Computer Mathematics, 2012

2011

When does <T> equal sat(T)?

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

Balanced Dense Polynomial Multiplication on Multi-Cores.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Inverting matrices modulo regular chains.

[BibT_eX]

[DOI]

Paul Vrbik

ACM Commun. Comput. Algebra, 2011

Solving bivariate polynomial systems on a GPU.

[BibT_eX]

[DOI]

Wei Pan

ACM Commun. Comput. Algebra, 2011

Computing the real solutions of polynomial systems with the RegularChains library in Maple.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2011

Algorithms for computing triangular decompositions of polynomial systems.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Computing with semi-algebraic sets represented by triangular decomposition.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Semi-algebraic Description of the Equilibria of Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 13th International Workshop, 2011

2010

Computing differential characteristic sets by change of ordering.

[BibT_eX]

[DOI]

François Boulier

François Lemaire

J. Symb. Comput., 2010

Abstract only: SPIRAL-generated modular FFTs.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2010

Cache friendly sparse matrix-vector multiplication.

[BibT_eX]

[DOI]

Sardar Anisul Haque

Shahadat Hossain

ACM Commun. Comput. Algebra, 2010

Almost linear time operations with triangular sets.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2010

Complexity and performance results for non FFT-based univariate polynomial multiplication.

[BibT_eX]

[DOI]

Muhammad F. I. Chowdhury

Wei Pan

ACM Commun. Comput. Algebra, 2010

Cache complexity and multicore implementation for univariate real root isolation.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2010

Efficient Evaluation of Large Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software, 2010

Spiral-generated modular FFT algorithms.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

Parallel computation of the minimal elements of a poset.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

2009

Fast arithmetic for triangular sets: From theory to practice.

[BibT_eX]

[DOI]

J. Symb. Comput., 2009

Computations modulo regular chains.

[BibT_eX]

[DOI]

Wei Pan

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Computing cylindrical algebraic decomposition via triangular decomposition.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

FFT-Based Dense Polynomial Arithmetic on Multi-cores.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing Systems and Applications, 2009

Real Root Isolation of Regular Chains.

[BibT_eX]

[DOI]

Proceedings of the Computer Mathematics, 2009

2008

Change of order for regular chains in positive dimension.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A bound for the Rosenfeld-Gröbner algorithm.

[BibT_eX]

[DOI]

Oleg Golubitsky

Marina V. Kondratieva

Alexey Ovchinnikov

J. Symb. Comput., 2008

On the verification of polynomial system solvers.

[BibT_eX]

[DOI]

Frontiers Comput. Sci. China, 2008

Automatic variable order selection for polynomial system solving (abstract only).

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

On the representation of constructible sets.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

The modpn library: bringing fast polynomial arithmetic into MAPLE.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

The complete root classification of a parametric polynomial on an interval.

[BibT_eX]

[DOI]

Songxin Liang

David J. Jeffrey

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

When does (<i>T</i>) equal sat(<i>T</i>)?

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

High-Performance Symbolic Computation in a Hybrid Compiled-Interpreted Programming Environment.

[BibT_eX]

[DOI]

Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

2007

On approximate triangular decompositions in dimension zero.

[BibT_eX]

[DOI]

J. Symb. Comput., 2007

Component-level parallelization of triangular decompositions.

[BibT_eX]

[DOI]

Proceedings of the Parallel Symbolic Computation, 2007

Multiprocessed parallelism support in ALDOR on SMPs and multicores.

[BibT_eX]

[DOI]

Proceedings of the Parallel Symbolic Computation, 2007

Multithreaded parallel implementation of arithmetic operations modulo a triangular set.

[BibT_eX]

[DOI]

Proceedings of the Parallel Symbolic Computation, 2007

On the Virtues of Generic Programming for Symbolic Computation.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Efficient Computations of Irredundant Triangular Decompositions with the RegularChains Library.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Comprehensive Triangular Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2006

An implementation report for parallel triangular decompositions.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Triangular decompositions of polynomial systems: from theory to practice.

[BibT_eX]

[DOI]