Moulay Barkatou, Thomas Cluzeau and Carole El Bacha.
Algorithms for Regular Solutions of Higher-Order Linear Differential Systems
Alexandre Benoit and Bruno Salvy.
Chebyshev Expansions for Solutions of Linear Differential Equations
Frederic Bihan, J. Maurice Rojas and Casey E. Stella.
Faster Real Feasibility via Circuit Discriminants
Alin Bostan and Eric Schost.
Fast algorithms for differential equations in positive characteristic
Brice Boyer, Jean-Guillaume Dumas, Clement Pernet and Wei Zhou.
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Christopher Brown and Scott McCallum.
On Delineability of Varieties in CAD-Based Quantifier Elimination with Equational Constraints
Christopher Brown.
Fast Simplifications for Tarski Formulas
YongJae Cha and Mark van Hoeij.
Liouvillian Solutions of Irreducible Linear Difference Equations
Changbo Chen, Marc Moreno Maza, Bican Xia and Lu Yang.
Computing Cylindrical Algebraic Decomposition via Triangular Decompositions
Jin-San Cheng, Xiao-Shan Gao and Jia Li.
Root Isolation for Bivariate Polynomial Systems with Local Generic Position Method
Fredric Chyzak, Manuel Kauers and Bruno Salvy.
A Non-Holonomic Systems Approach to Special Function Identities
Xavier Dahan.
Size of coefficients of lexicographical Groebner bases
Luca De Feo and Eric Schost.
Fast arithmetics in Artin-Schreier towers over finite fields
Jean-Guillaume Dumas, Clement Pernet and David Saunders.
On finding multiplicities of characteristic polynomial factors of black-box matrices
Ioannis Emiris and Angelos Mantzaflaris.
Multihomogeneous resultant matrices for systems with scaled support
Jean-Charles Faugere and Perret Ludovic.
High Order Derivatives and Decomposition of Multivariate Polynomials
Jean-Charles Faugere and Sajjad Rahmany.
Solving systems of polynomial equations with symmetries using SAGBI-Groebner bases
Joachim von zur Gathen.
Counting decomposable univariate polynomials
Laureano Gonzalez-Vega, Irene Polo-Blanco, Jon Gonzalez-Sanchez, Ignacio F. Rua, Alejandro Pinera and Jorge Caravantes.
Analyzing Group based Matrix Multiplication Algorithms
Stef Graillat and Philippe Trebuchet.
A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
Miroslav Halas, Ulle Kotta, Ziming Li, Hauifu Wang and Chunming Yuan.
Submersive Rational Difference Systems and Formal Accessibility
Hoon Hong and Mohab Safey El Din.
Variant Real Quantifier Elimination: Algorithm and Application
Gabor Ivanyos, Marek Karpinski and Nitin Saxena.
Schemes for Deterministic Polynomial Factoring
Masaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai and Shinji Hara.
Solution of Algebraic Riccati Equations Using the Sum of Roots
Daniel Kunkle and Gene Cooperman.
Biased Tadpoles: A Fast Algorithm for Centralizers in Large Matrix Groups
George Labahn and Bernhard Beckermann.
Fraction-Free Computation of Simultaneous Pade Approximants
George Labahn and Wei Zhou.
Efficient Computation of Order Bases
Viktor Levandovskyy, Jorge Martin Morales and Wolf Daniel Andres.
Principal Intersection and Bernstein-Sato Polynomial of Affine Variety
Kurt Mehlhorn and Michael Sagraloff.
A Deterministic Descartes Algorithm for Real Polynomials
Martin Mevissen, Kosuke Yokoyama and Nobuki Takayama.
Solutions of polynomial systems derived from the steady cavity flow problem
Seyed Mohammad Mahdi Javadi and Michael Monagan.
On Factorization of Multivariate Polynomials over Algebraic Number and Function Fields
Ivan Morel, Damien Stehle and Gilles Villard.
H-LLL: Using Householder Within LLL
Roman Pearce and Michael Monagan.
Parallel Sparse Polynomial Multiplication Using Heaps
Georg Regensburger, Markus Rosenkranz and Johannes Middeke.
A Skew Polynomial Approach to Integro-Differential Operators
Guenael Renault, Kazuhiro Yokoyama and Sebastien Orange.
Computation Schemes for Splitting Fields of Polynomials
Daniel S. Roche.
Space- and Time-Efficient Polynomial Multiplication
Ana Romero, Graham Ellis and Julio Rubio.
Interoperating between Computer Algebra systems: computing homology of groups with Kenzo and GAP
Eduardo Saenz-de-Cabezon and Anna Bigatti.
Computation of the (n-1)-st Koszul homology of monomial ideals and related algorithms
Yosuke Sato and Akira Suzuki.
Computation of Inverses in Residue Class Rings of Parametric Polynomial Ideals
David Saunders and Bryan Youse.
Large Matrix, Small Rank
Alan Sexton, Volker Sorge and Stephen Watt.
Computing with Abstract Matrix Structures
Arne Storjohann.
Integer matrix rank certification
Adam Strzebonski.
Real Root Isolation for Tame Elementary Functions
Akira Terui.
An Iterative Method for Calculating Approximate GCD of Univariate Polynomials
Li Xin, Marc Moreno Maza and Wei Pan.
Computations modulo Regular Chains
Chee Yap and W. Dale Brownawell.
Lower Bounds for Zero-Dimensional Projections
Zhonggang Zeng.
The Approximate Irreducible Factorization of a Univariate Polynomial Revisited