Full papers

Details on the ISSAC 2018 Paper Review Process were published here. Following this process the program committee has accepted the papers below.

List of Accepted Papers

  1. Avinash Kulkarni, Yue Ren, Mahsa Sayyary Namin and Bernd Sturmfels. Real Space Sextics and their Tritangents.
  2. Changpeng Shao and Hongbo Li. Fast Straightening Algorithm for Bracket Polynomials Based on Tableau Manipulations.
  3. Dong Lu, Dingkang Wang, Fanghui Xiao and Jie Zhou. Extending the GVW Algorithm to Local Ring.
  4. Deepak Kapur, Dong Lu, Michael Monagan, Yao Sun and Dingkang Wang. An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD.
  5. Tomás Recio, J. Rafael Sendra and Carlos Villarino. The Importance of Being Zero.
  6. Adam Strzeboński. Comparison of CAD-based Methods for Computation of Rational Function Limits.
  7. Alexander Hulpke. Constructive membership tests in some infinite matrix groups.
  8. Andrea Guidolin and Ana Romero. Effective computation of generalized spectral sequences.
  9. José Gómez Torrecillas, F. J. Lobillo and Gabriel Navarro. Computing free distances of idempotent convolutional codes.
  10. Victor Magron and Mohab Safey El Din. On Exact Polya and Putinar's Representations.
  11. Shaoshi Chen, Hao Du and Ziming Li. Additive Decompositions in Primitive Extensions.
  12. Vincent Neiger, Johan Rosenkilde and Grigory Solomatov. Computing Popov and Hermite forms of rectangular polynomial matrices.
  13. Moulay Barkatou and Maximilian Jaroschek. Desingularization of First Order Linear Difference Systems with Rational Function Coefficients.
  14. Maria Jesus De La Puente and Pedro Luis Claveria. Volume of alcoved polyhedra and Mahler conjecture.
  15. Pascal Giorgi and Vincent Neiger. Certification of minimal approximant bases.
  16. Alin Bostan, Frédéric Chyzak, Pierre Lairez and Bruno Salvy. Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions.
  17. Timothée Pecatte, Ignacio Garcia Marco and Pascal Koiran. Polynomial equivalence problems for sums of affine powers.
  18. Evangelos Bartzos, Ioannis Emiris, Jan Legerský and Elias Tsigaridas. On the maximal number of real embeddings for spatial minimally rigid graphs.
  19. Xavier Caruso, David Roe and Tristan Vaccon. ZpL: a p-adic precision package.
  20. Gleb Pogudin and Agnes Szanto. Irrendundant Triangular Decomposition.
  21. Chenqi Mou and Yang Bai. On the chordality of polynomial sets in triangular decomposition in top-down style.
  22. Wen-Ding Li, Ming-Shing Chen, Po-Chun Kuo, Chen-Mou Cheng and Bo-Yin Yang. Frobenius Additive Fast Fourier Transform.
  23. Erdal Imamoglu, Erich Kaltofen and Zhengfeng Yang. Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases.
  24. Florent Bréhard. A Newton-like Validation Method for Chebyshev Approximate Solutions of Linear Ordinary Differential Systems.
  25. Daniel Roche. Error correction in fast matrix multiplication and inverse.
  26. Mohab Safey El Din, Zhi-Hong Yang and Lihong Zhi. On the complexity of computing real radicals of polynomial systems.
  27. Joris van der Hoeven and Robin Larrieu. Fast reduction of bivariate polynomials with respect to sufficiently regular Gröbner bases.
  28. Yosuke Sato, Ryoya Fukasaku and Hiroshi Sekigawa. On continuity of the roots of a parametric zero dimensional multivariate polynomial ideal.
  29. Thierry Combot and Camilo Sanabria. A symplectic Kovacic's algorithm in dimension 4.
  30. Curtis Bright, Ilias Kotsireas, Albert Heinle and Vijay Ganesh. Enumeration of Complex Golay Pairs via Programmatic SAT.
  31. Nathan Bliss, Timothy Duff, Anton Leykin and Jeff Sommars. Monodromy Solver: sequential and parallel.
  32. Alexander Levin. Bivariate dimension polynomials of non-reflexive prime difference-differential ideals. The case of one translation.
  33. Antonio Jimenez-Pastor and Veronika Pillwein. Algorithmic Arithmetics with DD-Finite functions.
  34. Juan Xu, Michael Burr and Chee Yap. An Approach for Certifying Homotopy Continuation Paths: Univariate Case.
  35. Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris and Elias Tsigaridas. Bilinear systems with two supports: Koszul resultant matrices, eigenvalues, and eigenvectors.
  36. Tristan Vaccon, Thibaut Verron and Kazuhiro Yokoyama. On Affine Tropical F5 Algorithms.
  37. Jingwei Chen, Damien Stehle and Gilles Villard. Computing LLL-Reduced Basis for Orthogonal Lattice.
  38. Toru Aoyama and Masayuki Noro. Modular Algorithms for Computing Minimal Associated Primes and radicals of Polynomial Ideals.
  39. Moulay Barkatou, Joelle Saade and Jacques-Arthur Weil. A new approach for formal reduction of singular linear differential systems using eigenrings..
  40. Jérémy Berthomieu and Jean-Charles Faugère. A polynomial-division-based algorithm for computing linear recurrence relations.
  41. Matías R. Bender, Jean-Charles Faugère and Elias Tsigaridas. Towards Mixed Gröbner Basis algorithms: the Multihomogeneous and Sparse case.
  42. Jean-Guillaume Dumas and Clément Pernet. Symmetric indefinite triangular factorization revealing the rank profile matrix.
  43. Gilles Villard. On computing the resultant of generic bivariate polynomials.
  44. Johannes Hoffmann and Viktor Levandovskyy. Constructive Arithmetics in Ore localizations with enough commutativity.
  45. Didier Henrion, Simone Naldi and Mohab Safey El Din. Exact algorithms for semidefinite programs with degenerate feasible set.
  46. Cordian Riener and Mohab Safey El Din. Real root finding for equivariant semi-algebraic systems.
  47. Mark Giesbrecht, Joseph Haraldson and George Labahn. Computing Nearby Non-trivial Smith Forms.