Photo: ©KOBE CONVENTION & VISITORS ASSOCIATION


List of Accepted Papers

  1. Fredrik Johansson. Evaluating parametric holonomic sequences using rectangular splitting
  2. Hongbo Li, Changpeng Shao, Lei Huang and Yue Liu. Reduction among Bracket Polynomials
  3. Manfred Minimair. Randomized Detection of Extraneous Factors
  4. Michael Sagraloff. A Near-Optimal Algorithm for Computing Real Roots of Sparse Polynomials
  5. Adam Strzeboński. Cylindrical Algebraic Decomposition Using Local Projections
  6. Manuel Kauers. Bounds for D-Finite Closure Properties
  7. David Sevilla, J Rafael Sendra and Carlos Villarino. Covering of surfaces parametrized without projective base points
  8. Georg Grasegger. Radical Solutions of First Order Autonomous Algebraic Ordinary Differential Equations
  9. Erich Kaltofen and Zhengfeng Yang. Sparse Multivariate Function Recovery With a High Error Rate in the Evaluations
  10. Shaoshi Chen, Ruyong Feng, Ziming Li and Michael F. Singer. Parallel Telescoping and Parameterized Picard--Vessiot Theory
  11. Katsusuke Nabeshima and Shinichi Tajima. On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases
  12. Wei Zhou and George Labahn. Unimodular Completion of Polynomial Matrices
  13. Shaoshi Chen, Manuel Kauers and Christoph Koutschan. A Generalized Apagodu-Zeilberger Algorithm
  14. Jonathan Kausch and Volker Diekert. Logspace computations in graph products
  15. Oscar Garcia-Morchon, Domingo Gomez-Perez, Jaime Gutierrez, Ronald Rietman and Ludo Tolhuizen. The MMO problem
  16. Jean-Guillaume Dumas and Erich Kaltofen. Essentially Optimal Interactive Certificates in Linear Algebra
  17. Saruchi, Damien Stehlé, Gilles Villard and Ivan Morel. LLL reducing with the most significant bits
  18. Thomas Kahle, Robert Krone and Anton Leykin. Equivariant lattice generators and Markov bases
  19. Romain Lebreton and Pascal Giorgi. Online order basis algorithm and its impact on block Wiedemann algorithm
  20. Markus Bläser and Gorav Jindal. A New Deterministic Algorithm for Sparse Multivariate Polynomial Interpolation
  21. Bruno Grenet. Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach
  22. Alin Bostan, Xavier Caruso and Éric Schost A fast algorithm for computing the characteristic polynomial of the p-curvature
  23. Jonathan D. Hauenstein, Ian Haywood and Alan Liddell. An a posteriori certification algorithm for Newton homotopies
  24. Bernard Mourrain and Philippe Trebuchet. Toric Border Basis
  25. Konstantin Ziegler. Tame decompositions and collisions
  26. Madalina Erascu and Hoon Hong. Synthesis of Optimal Numerical Algorithms using Real Quantifier Elimination (Case Study: Square Root Computation)
  27. Suzy S. Maddah, Moulay A. Barkatou and Hassan Abbas. On the Reduction of Singularly-Perturbed Linear Differential Systems
  28. Suzy S. Maddah, Moulay A. Barkatou and Hassan Abbas. Formal Solutions of a Class of Pfaffian Systems in Two Variables
  29. Joris van der Hoeven. Faster relaxed multiplication
  30. Tristan Vaccon. Matrix-F5 algorithms over finite-precision complete discrete valuation fields
  31. Elizabeth Gross and Jose Rodriguez. Maximum likelihood geometry in the presence of data zeros
  32. Erich Kaltofen and Clément Pernet. Sparse Polynomial Interpolation Codes and Their Decoding Beyond Half the Minimal Distance
  33. Lingchuan Meng and Jeremy Johnson. High Performance Implementation of the TFT
  34. Alin Bostan, Thierry Combot and Mohab Safey El Din. Computing necessary integrability conditions for planar parametrized homogeneous potentials
  35. Jean-Charles Faugère, Pierre-Jean Spaenlehauer and Jules Svartz. Sparse Gröbner Bases: The Unmixed Case
  36. Francois Le Gall. Powers of Tensors and Fast Matrix Multiplication
  37. Jose Gomez-Torrecillas, F.J. Lobillo and Gabriel Navarro. On isomorphisms of modules over non-commutative PID
  38. Changbo Chen and Marc Moreno Maza. Quantifier Elimination by Cylindrical Algebraic Decomposition Based on Regular Chains
  39. Mark Giesbrecht, Albert Heinle and Viktor Levandovskyy. Factoring Linear Differential Operators in $n$ Variables
  40. Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget and Fabrice Rouillier. Improved algorithm for computing separating linear forms for bivariate systems
  41. Jean-Charles Faugère, Pierrick Gaudry, Louise Huot and Guénaël Renault. Sub-Cubic Change of Ordering for Gröbner Basis. A Probabilistic Approach.
  42. Daouda Niang Diatta, Fabrice Rouillier and Marie-Françoise Roy. On the computation of the topology of plane curves
  43. Andrew Arnold, Mark Giesbrecht and Daniel Roche. Sparse interpolation over finite fields via low-order roots of unity
  44. Luca De Feo, Javad Doliskani and Éric Schost. Fast arithmetic in the algebraic closure of finite fields
  45. Arne Storjohann and Shiyun Yang. Linear independence oracles and applications to rectangular and low rank linear systems
  46. Andrew Arnold and Daniel S. Roche. Multivariate sparse interpolation using randomized Kronecker substitutions
  47. Reinhold Burger. Solving Higher Order Linear Differential Equations having Elliptic Function Coefficients
  48. Jingjun Han, Liyun Dai and Bican Xia. Constructing Fewer Open Cells by GCD Computation in CAD Projection
  49. R Corless, David Jeffrey and Fei Wang. The asymptotic analysis of some interpolated nonlinear recurrence relations
  50. Ioannis Emiris and Raimundas Vidunas. Root counts of semi-mixed systems, and an application to counting Nash equilibria
  51. Carlos Arreche. Computing the differential Galois group of a parameterized second-order linear differential equation