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

Click Here to go back to the ISSAC 2019 Home Page.

Krawtchouk polynomials and quadratic semi-regular sequences

Existence Problem of Telescopers for Rational Functions in Three Variables: the Mixed Cases

Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing

Efficiently factoring polynomials modulo $p^4$

An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: the Averaging Method Revisited

Effective certification of approximate solutions to systems of equations involving analytic functions

Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation

Certified Numerical Real Root Isolation for Bivariate Polynomial Systems

Computing Hermite Normal Form Faster via Solving System of Linear Equations

An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture

Verified Real Asymptotics in Isabelle/HOL

A New Method for Computing Elimination Ideals of Likelihood Equations

Linear Hensel Lifting for Fp[x,y] and Z[x] with Cubic Cost

An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers

LU factorization with errors

Symbolic integration of hyperexponential 1-forms

Simple forms and rational solutions of pseudo-linear systems

Symmetry Preserving Interpolation

Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems

Generic reductions for in-place polynomial multiplication

Approaching Asymptotically Optimal Interpolation Algorithms over a Field with Large Characteristic or Characteristic Zero

Standard lattices of compatibly embedded finite fields

Plantinga-Vegter algorithm takes average polynomial time

Computing multipersistence by means of spectral systems

A New Sparse SOS Decomposition Algorithm Based on Term Sparsity

Algorithmic approach to strong consistency analysis of finite difference approximations to PDE systems

Computing the characteristic polynomial of a finite rank-two Drinfeld module

Gröbner bases over Tate algebras

On a moment problem with holonomic functions

Introduction of the MapDE algorithm for mappings relating differential equations

Quadratic Probabilistic Algorithms for Normal Bases

Efficient Integer-Linear Decomposition of Multivariate Polynomials

Computing the volume of compact semi-algebraic sets

Deterministic reduction of integer nonsingular linear system solving to matrix multiplication

On the Number of Congruent Classes of the Tetrahedra Determined by Given Volume, Circumradius and Face Areas

Computing a Lattice Basis Revisited

Monomial resolutions for efficient computation of simplicial homology

A Faster Solution to Smale's 17th Problem I: Real Binomial Systems

Change of basis for $\mathfrak{m}$-primary ideals in one and two variables

New Dependencies of Hierarchies in Polynomial Optimization

Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis

Exact optimization via sums of nonnegative circuits and arithmetic-geometric-mean-exponentials

Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants

Big Prime Field FFT on Multi-core Processors