Papers
You may find the Call for Papers and the Manuscript Preparation Instructions here.
The following papers are scheduled to be presented, the actual program is here.
- Sergei Abramov: On some decidable and undecidable problems related to q-difference equations with parameters
- Moulay Barkatou, Eckhard Pfluegel and Carole El Bacha: Simultaneously row- and column-reduced higher-order linear differential systems
- Christine Berkesch and Anton Leykin: Algorithms for Bernstein–Sato polynomials and multiplier ideals
- Marco Bodrato: A Strassen-like matrix multiplication suited for squaring and higher power computation
- Alin Bostan, Shaoshi Chen, Frédéric Chyzak and Ziming Li: Complexity of the creative telescoping for bivariate rational functions
- Nicolas Brisebarre and Mioara Joldes: Chebyshev interpolation polynomial-based tools for rigorous computing
- Christopher Brown and Adam Strzebonski: Black-box/white-box simplification and applications to quantifier elimination
- Yongjae Cha, Mark van Hoeij and Giles Levy: Solving recurrence relations using local invariants
- Costanza Conti, Luca Gemignani and Lucia Romani: Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes
- Wayne Eberly: Yet Another Block Lanczos Algorithm: How to simplify the computation and reduce reliance on preconditioners in the small field case
- Ioannis Z. Emiris, Andre Galligo and Elias Tsigaridas: Random polynomials and expected-case complexity of real root isolation
- Ioannis Z. Emiris, Bernard Mourrain and Elias Tsigaridas: The DMM bound: multivariate (aggregate) separation bounds
- Jean-Charles Faugère, Joachim von zur Gathen and Ludovic Perret: Decomposition of multivariate polynomials
- Jean-Charles Faugère, Mohab Safey El Din and Pierre-Jean Spaenlehauer: Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Shuhong Gao, Yinhua Guan and Frank Volny: A New incremental algorithm for computing Groebner Bases
- Joachim von zur Gathen, Mark Giesbrecht and Konstantin Ziegler: Composition collisions and projective polynomials
- Vladimir Gerdt and Daniel Robertz: Consistency of finite difference approximations for linear PDE systems and its algorithmic verification
- Feng Guo, Mohab Safey El Din and Lihong Zhi: Global optimization of polynomials using generalized critical values and sums of squares
- Kevin Hammond, Peter Horn, Alexander Konovalov, Steve Linton, Dan Roozemond, Abdallah Al Zain and Phil Trinder: Easy composition of symbolic computation software: a new lingua franca for symbolic computation
- David Harvey and Daniel S. Roche: An in-place truncated Fourier transform and applications to polynomial multiplication
- Mark van Hoeij and Giles Levy: Liouvillian solutions of irreducible second order linear difference equations
- Sharon Hutton, Erich Kaltofen and Lihong Zhi: Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg’s method
- Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek and Martin Avendano: Randomized NP-Completeness for p-adic Rational Roots of Sparse Polynomials in One Variable
- Claude-Pierre Jeannerod and Christophe Mouilleron: Computing specified generators of structured matrix inverses
- Deepak Kapur, Yao Sun and Dingkang Wang: A new algorithm for computing comprehensive Groebner systems
- Manuel Kauers and Veronika Pillwein: When can we detect that a P-finite sequence is positive?
- Manuel Kauers and Carsten Schneider: Partial denominator bounds for partial linear difference equations
- Majid Khonji, Clement Pernet, Jean-Louis Roch, Thomas Roche and Thomas Stalinski: Output-sensitive decoding for redundant residue systems
- Zijia Li, Zhengfeng Yang and Lihong Zhi: Blind Image Deconvolution via Fast Approximate GCD
- Ernst W. Mayr and Stephan Ritscher: Degree bounds for Gröbner bases of low-dimensional polynomial ideals
- Marc Mezzarobba: NumGfun: a Package for numerical and analytic computation with D-finite functions
- Marc Moreno Maza, Changbo Chen, James Davenport, John P. May, Bican Xia and Rong Xiao: Triangular decomposition of semi-algebraic systems
- Victor Y. Pan and Ai-Long Zheng: Polynomial root-finding via matrix eigen-solving
- Bjarke Hammersholt Roune: A slice algorithm for corners and Hilbert-Poincaré series of monomial ideals
- Karl Rupp: Symbolic integration at compile time in finite element methods
- Fritz Schwarz and Dima Grigoriev: Absolute factoring of non-holonomic ideals in the plane
- David Sevilla and Daniel Wachsmuth: Polynomial integration on regions defined by a triangle and a conic
- Xiaoran Shi and Falai Chen: Computing the Singularities of Rational Space Curves
- Vlad Slavici, Xin Dong, Daniel Kunkle and Gene Cooperman: Fast multiplication of large permutations for disk, flash memory and RAM
- Frank Sottile, Ravi Vakil and Jan Verschelde: Solving Schubert problems with Littlewood-Richardson homotopies
- Adam Strzebonski: Computation with semialgebraic sets represented by cylindrical algebraic formulas
- Asli Ürgüplü and François Lemaire: A Method for Semi-Rectifying Algebraic and Differential Systems using Scaling type Lie Point Symmetries with Linear Algebra
- Quan Yuan and Mark van Hoeij: Finding all Bessel type solutions for linear differential equations with rational function coefficients
- Alberto Zanoni: Iterative Toom-Cook methods for very unbalanced long integer multiplication
- Christoph Zengler and Thomas Sturm: Parametric quantified SAT-solving
(subject to change)
