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
- Avinash Kulkarni, Yue Ren, Mahsa Sayyary Namin and Bernd Sturmfels. Real Space Sextics and their Tritangents.
- Changpeng Shao and Hongbo Li. Fast Straightening Algorithm for Bracket Polynomials Based on Tableau Manipulations.
- Dong Lu, Dingkang Wang, Fanghui Xiao and Jie Zhou. Extending the GVW Algorithm to Local Ring.
- Deepak Kapur, Dong Lu, Michael Monagan, Yao Sun and Dingkang Wang. An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD.
- Tomás Recio, J. Rafael Sendra and Carlos Villarino. The Importance of Being Zero.
- Adam Strzeboński. Comparison of CAD-based Methods for Computation of Rational Function Limits.
- Alexander Hulpke. Constructive Membership Tests in Some Infinite Matrix Groups.
- Andrea Guidolin and Ana Romero. Effective Computation of Generalized Spectral Sequences.
- José Gómez Torrecillas, F. J. Lobillo and Gabriel Navarro. Computing Free Distances of Idempotent Convolutional Codes.
- Victor Magron and Mohab Safey El Din. On Exact Polya and Putinar's Representations.
- Shaoshi Chen, Hao Du and Ziming Li. Additive Decompositions in Primitive Extensions.
- Vincent Neiger, Johan Rosenkilde and Grigory Solomatov. Computing Popov and Hermite Forms of Rectangular Polynomial Matrices.
- Moulay Barkatou and Maximilian Jaroschek. Desingularization of First Order Linear Difference Systems with Rational Function Coefficients.
- Maria Jesus De La Puente and Pedro Luis Claveria. Volume of Alcoved Polyhedra and Mahler Conjecture.
- Pascal Giorgi and Vincent Neiger. Certification of Minimal Approximant Bases.
- Alin Bostan, Frédéric Chyzak, Pierre Lairez and Bruno Salvy. Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions.
- Timothée Pecatte, Ignacio Garcia Marco and Pascal Koiran. Polynomial Equivalence Problems for Sums of Affine Powers.
- Evangelos Bartzos, Ioannis Emiris, Jan Legerský and Elias Tsigaridas. On the Maximal Number of Real Embeddings for Spatial Minimally Rigid Graphs.
- Xavier Caruso, David Roe and Tristan Vaccon. ZpL: a p-adic Precision Package.
- Gleb Pogudin and Agnes Szanto. Irredundant Triangular Decomposition.
- Chenqi Mou and Yang Bai. On the Chordality of Polynomial Sets in Triangular Decomposition in Top-Down Style.
- Wen-Ding Li, Ming-Shing Chen, Po-Chun Kuo, Chen-Mou Cheng and Bo-Yin Yang. Frobenius Additive Fast Fourier Transform.
- Erdal Imamoglu, Erich Kaltofen and Zhengfeng Yang. Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases.
- Florent Bréhard. A Newton-like Validation Method for Chebyshev Approximate Solutions of Linear Ordinary Differential Systems.
- Daniel Roche. Error Correction in Fast Matrix Multiplication and Inverse.
- Mohab Safey El Din, Zhi-Hong Yang and Lihong Zhi. On the Complexity of Computing Real Radicals of Polynomial Systems.
- Joris van der Hoeven and Robin Larrieu. Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases.
- Yosuke Sato, Ryoya Fukasaku and Hiroshi Sekigawa. On Continuity of the Roots of a Parametric Zero Dimensional Multivariate Polynomial Ideal.
- Thierry Combot and Camilo Sanabria. A Symplectic Kovacic's Algorithm in Dimension 4.
- Curtis Bright, Ilias Kotsireas, Albert Heinle and Vijay Ganesh. Enumeration of Complex Golay Pairs via Programmatic SAT.
- Nathan Bliss, Timothy Duff, Anton Leykin and Jeff Sommars. Monodromy Solver: Sequential and Parallel.
- Alexander Levin. Bivariate Dimension Polynomials of Non-reflexive Prime Difference-differential Ideals. The Case of One Translation.
- Antonio Jimenez-Pastor and Veronika Pillwein. Algorithmic Arithmetics with DD-Finite Functions.
- Juan Xu, Michael Burr and Chee Yap. An Approach for Certifying Homotopy Continuation Paths: Univariate Case.
- Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris and Elias Tsigaridas. Bilinear Systems with Two Supports: Koszul Resultant Matrices, Eigenvalues, and Eigenvectors.
- Tristan Vaccon, Thibaut Verron and Kazuhiro Yokoyama. On Affine Tropical F5 Algorithms.
- Jingwei Chen, Damien Stehle and Gilles Villard. Computing LLL-Reduced Basis for Orthogonal Lattice.
- Toru Aoyama and Masayuki Noro. Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals.
- Moulay Barkatou, Joelle Saade and Jacques-Arthur Weil. A New Approach for Formal Reduction of Singular Linear Differential Systems using Eigenrings.
- Jérémy Berthomieu and Jean-Charles Faugère. A Polynomial-Division-based Algorithm for Computing Linear Recurrence Relations.
- Matías R. Bender, Jean-Charles Faugère and Elias Tsigaridas. Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case.
- Jean-Guillaume Dumas and Clément Pernet. Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix.
- Gilles Villard. On Computing the Resultant of Generic Bivariate Polynomials.
- Johannes Hoffmann and Viktor Levandovskyy. Constructive Arithmetics in Ore Localizations with Enough Commutativity.
- Didier Henrion, Simone Naldi and Mohab Safey El Din. Exact Algorithms for Semidefinite Programs with Degenerate Feasible Set.
- Cordian Riener and Mohab Safey El Din. Real Root Finding for Equivariant Semi-Algebraic Systems.
- Mark Giesbrecht, Joseph Haraldson and George Labahn. Computing Nearby Non-trivial Smith Forms.