


default search action
ISSAC 2019: Beijing, China
- James H. Davenport, Dongming Wang, Manuel Kauers, Russell J. Bradford:

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019. ACM 2019, ISBN 978-1-4503-6084-5
Invited Talks
- William Y. C. Chen:

The Art of Telescoping. 1-3 - Lorenzo Robbiano:

Linear Algebra, Old and New. 4-9 - Virginia Vassilevska Williams:

Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. 10
Tutorials
- Shaoshi Chen:

A Reduction Approach to Creative Telescoping. 11-14 - Satoshi Aoki:

Algebraic Methods in the Design of Experiments. 15-20 - Anna Maria Bigatti

:
Linear Algebra for Zero-Dimensional Ideals. 21-25
Contributed Papers (singular on the pdfs)
- Moulay A. Barkatou, Thomas Cluzeau, Ali El-Hajj:

Simple Forms and Rational Solutions of Pseudo-Linear Systems. 26-33 - Erick Rodríguez Bazan, Evelyne Hubert:

Symmetry Preserving Interpolation. 34-41 - Matías R. Bender

, Jean-Charles Faugère, Elias P. Tsigaridas:
Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems. 42-49 - Anna Maria Bigatti

, Jónathan Heras, Eduardo Sáenz-de-Cabezón
:
Monomial Resolutions for Efficient Computation of Simplicial Homology. 50-57 - Stavros Birmpilis, George Labahn, Arne Storjohann:

Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication. 58-65 - Florent Bréhard, Mioara Joldes, Jean-Bernard Lasserre:

On Moment Problems with Holonomic Functions. 66-73 - Xavier Caruso, Tristan Vaccon

, Thibaut Verron
:
Gröbner Bases Over Tate Algebras. 74-81 - Shaoshi Chen, Lixin Du

, Chaochao Zhu:
Existence Problem of Telescopers for Rational Functions in Three Variables: the Mixed Cases. 82-89 - Jin-San Cheng, Junyi Wen:

Certified Numerical Real Root Isolation for Bivariate Polynomial Systems. 90-97 - Thierry Combot:

Symbolic Integration of Hyperexponential 1-Forms. 98-105 - Svyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza, Lin-Xiao Wang:

Big Prime Field FFT on Multi-core Processors. 106-113 - Felipe Cucker, Alperen Ali Ergür

, Josué Tonelli-Cueto
:
Plantinga-Vegter Algorithm takes Average Polynomial Time. 114-121 - Luca De Feo, Hugues Randriam, Édouard Rousseau:

Standard Lattices of Compatibly Embedded Finite Fields. 122-130 - Jean-Guillaume Dumas

, Joris van der Hoeven
, Clément Pernet
, Daniel S. Roche:
LU Factorization with Errors. 131-138 - Ashish Dwivedi, Rajat Mittal, Nitin Saxena

:
Efficiently Factoring Polynomials Modulo p4. 139-146 - Manuel Eberl:

Verified Real Asymptotics in Isabelle/HOL. 147-154 - Elisabeth Gaar

, Angelika Wiegele
, Daniel Krenn
, Susan Margulies:
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. 155-162 - Vladimir P. Gerdt, Daniel Robertz:

Algorithmic Approach to Strong Consistency Analysis of Finite Difference Approximations to PDE Systems. 163-170 - Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:

Efficient Integer-Linear Decomposition of Multivariate Polynomials. 171-178 - Mark Giesbrecht, Armin Jamshidpey, Éric Schost:

Quadratic-Time Algorithms for Normal Elements. 179-186 - Pascal Giorgi, Bruno Grenet

, Daniel S. Roche:
Generic Reductions for In-place Polynomial Multiplication. 187-194 - Andrea Guidolin

, Jose Divasón
, Ana Romero
, Francesco Vaccarino
:
Computing Multipersistence by Means of Spectral Systems. 195-202 - Pei Huang, Minghao Liu

, Cunjing Ge, Feifei Ma, Jian Zhang:
Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing. 203-210 - Bo Huang, Chee Yap:

An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: The Averaging Method Revisited. 211-218 - Qiao-Long Huang:

Sparse Polynomial Interpolation over Fields with Large or Zero Characteristic. 219-226 - Seung Gyu Hyun, Stephen Melczer

, Éric Schost, Catherine St-Pierre:
Change of Basis for m-primary Ideals in One and Two Variables. 227-234 - Seung Gyu Hyun, Vincent Neiger

, Éric Schost:
Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants. 235-242 - Stavros Kousidis

:
Krawtchouk Polynomials and Quadratic Semi-Regular Sequences. 243-250 - Adam Kurpisz

, Timo de Wolff:
New Dependencies of Hierarchies in Polynomial Optimization. 251-258 - Pierre Lairez, Marc Mezzarobba, Mohab Safey El Din:

Computing the Volume of Compact Semi-Algebraic Sets. 259-266 - Michael A. Burr, Kisun Lee, Anton Leykin:

Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions. 267-274 - Jianwei Li, Phong Q. Nguyen:

Computing a Lattice Basis Revisited. 275-282 - Renzhang Liu, Yanbin Pan:

Computing Hermite Normal Form Faster via Solving System of Linear Equations. 283-290 - Victor Magron, Henning Seidler, Timo de Wolff:

Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentials. 291-298 - Michael B. Monagan:

Linear Hensel Lifting for Fp[x, y] and Z[x] with Cubic Cost. 299-306 - Yossef Musleh, Éric Schost:

Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module. 307-314 - Taihei Oki

:
Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation. 315-322 - Grigoris Paouris

, Kaitlyn Phillipson, J. Maurice Rojas:
A Faster Solution to Smale's 17th Problem I: Real Binomial Systems. 323-330 - Zahra Mohammadi, Gregory J. Reid, Tracy Shih-lung Huang:

Introduction of the MapDE Algorithm for Determination of Mappings Relating Differential Equations. 331-338 - Xiaoxian Tang, Timo de Wolff, Rukai Zhao:

A New Method for Computing Elimination Ideals of Likelihood Equations. 339-346 - Jie Wang, Haokun Li, Bican Xia:

A New Sparse SOS Decomposition Algorithm Based on Term Sparsity. 347-354 - Juan Xu, Chee Yap:

Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis. 355-362 - Zhenbing Zeng, Lu Yang, Lydia Dehbi

:
On the Number of Congruent Classes of the Tetrahedra Determined by Given Volume, Circumradius and Face Areas. 363-370 - Tao Zheng, Bican Xia:

An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers. 371-378

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














