Table of Contents

• The Art of TelescopingWilliam Y. C. Chen. 1-3 [doi]
• Linear Algebra, Old and NewLorenzo Robbiano. 4-9 [doi]
• Limits on All Known (and Some Unknown) Approaches to Matrix MultiplicationVirginia Vassilevska Williams. 10 [doi]
• A Reduction Approach to Creative TelescopingShaoshi Chen. 11-14 [doi]
• Algebraic Methods in the Design of ExperimentsSatoshi Aoki. 15-20 [doi]
• Linear Algebra for Zero-Dimensional IdealsAnna Maria Bigatti. 21-25 [doi]
• Simple Forms and Rational Solutions of Pseudo-Linear SystemsMoulay A. Barkatou, Thomas Cluzeau, Ali El Hajj. 26-33 [doi]
• Symmetry Preserving InterpolationErick Rodríguez Bazan, Evelyne Hubert. 34-41 [doi]
• Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial SystemsMatías R. Bender, Jean-Charles Faugère, Elias P. Tsigaridas. 42-49 [doi]
• Monomial Resolutions for Efficient Computation of Simplicial HomologyAnna Maria Bigatti, Jónathan Heras, Eduardo Sáenz-de-Cabezón. 50-57 [doi]
• Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix MultiplicationStavros Birmpilis, George Labahn, Arne Storjohann. 58-65 [doi]
• On Moment Problems with Holonomic FunctionsFlorent Bréhard, Mioara Joldes, Jean-Bernard Lasserre. 66-73 [doi]
• Gröbner Bases Over Tate AlgebrasXavier Caruso, Tristan Vaccon, Thibaut Verron. 74-81 [doi]
• Existence Problem of Telescopers for Rational Functions in Three Variables: the Mixed CasesShaoshi Chen, Lixin Du, Chaochao Zhu. 82-89 [doi]
• Certified Numerical Real Root Isolation for Bivariate Polynomial SystemsJin-San Cheng, Junyi Wen. 90-97 [doi]
• Symbolic Integration of Hyperexponential 1-FormsThierry Combot. 98-105 [doi]
• Big Prime Field FFT on Multi-core ProcessorsSvyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza, Lin-Xiao Wang. 106-113 [doi]
• Plantinga-Vegter Algorithm takes Average Polynomial TimeFelipe Cucker, Alperen A. Ergür, Josué Tonelli-Cueto. 114-121 [doi]
• Standard Lattices of Compatibly Embedded Finite FieldsLuca De Feo, Hugues Randriam, Édouard Rousseau. 122-130 [doi]
• LU Factorization with ErrorsJean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche. 131-138 [doi]
• Efficiently Factoring Polynomials Modulo p4Ashish Dwivedi, Rajat Mittal, Nitin Saxena 0001. 139-146 [doi]
• Verified Real Asymptotics in Isabelle/HOLManuel Eberl. 147-154 [doi]
• An Optimization-Based Sum-of-Squares Approach to Vizing's ConjectureElisabeth Gaar, Angelika Wiegele, Daniel Krenn, Susan Margulies. 155-162 [doi]
• Algorithmic Approach to Strong Consistency Analysis of Finite Difference Approximations to PDE SystemsVladimir P. Gerdt, Daniel Robertz. 163-170 [doi]
• Efficient Integer-Linear Decomposition of Multivariate PolynomialsMark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima. 171-178 [doi]
• Quadratic-Time Algorithms for Normal ElementsMark Giesbrecht, Armin Jamshidpey, Éric Schost. 179-186 [doi]
• Generic Reductions for In-place Polynomial MultiplicationPascal Giorgi, Bruno Grenet, Daniel S. Roche. 187-194 [doi]
• Computing Multipersistence by Means of Spectral SystemsAndrea Guidolin, Jose Divasón, Ana Romero, Francesco Vaccarino. 195-202 [doi]
• Investigating the Existence of Orthogonal Golf Designs via Satisfiability TestingPei Huang, Minghao Liu, Cunjing Ge, Feifei Ma, Jian Zhang. 203-210 [doi]
• An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: The Averaging Method RevisitedBo Huang, Chee Yap. 211-218 [doi]
• Sparse Polynomial Interpolation over Fields with Large or Zero CharacteristicQiao-Long Huang. 219-226 [doi]
• Change of Basis for m-primary Ideals in One and Two VariablesSeung Gyu Hyun, Stephen Melczer, Éric Schost, Catherine St-Pierre. 227-234 [doi]
• Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate ResultantsSeung Gyu Hyun, Vincent Neiger, Éric Schost. 235-242 [doi]
• Krawtchouk Polynomials and Quadratic Semi-Regular SequencesStavros Kousidis. 243-250 [doi]
• New Dependencies of Hierarchies in Polynomial OptimizationAdam Kurpisz, Timo de Wolff. 251-258 [doi]
• Computing the Volume of Compact Semi-Algebraic SetsPierre Lairez, Marc Mezzarobba, Mohab Safey El Din. 259-266 [doi]
• Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic FunctionsMichael Burr, Kisun Lee, Anton Leykin. 267-274 [doi]
• Computing a Lattice Basis RevisitedJianwei Li, Phong Q. Nguyen. 275-282 [doi]
• Computing Hermite Normal Form Faster via Solving System of Linear EquationsRenzhang Liu, Yanbin Pan. 283-290 [doi]
• Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentialsVictor Magron, Henning Seidler, Timo de Wolff. 291-298 [doi]
• Linear Hensel Lifting for Fp[x, y] and Z[x] with Cubic CostMichael B. Monagan. 299-306 [doi]
• Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld ModuleYossef Musleh, Éric Schost. 307-314 [doi]
• Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial RelaxationTaihei Oki. 315-322 [doi]
• A Faster Solution to Smale's 17th Problem I: Real Binomial SystemsGrigoris Paouris, Kaitlyn Phillipson, J. Maurice Rojas. 323-330 [doi]
• Introduction of the MapDE Algorithm for Determination of Mappings Relating Differential EquationsZahra Mohammadi, Gregory J. Reid, Tracy Shih-lung Huang. 331-338 [doi]
• A New Method for Computing Elimination Ideals of Likelihood EquationsXiaoxian Tang, Timo de Wolff, Rukai Zhao. 339-346 [doi]
• A New Sparse SOS Decomposition Algorithm Based on Term SparsityJie Wang, Haokun Li, Bican Xia. 347-354 [doi]
• Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity AnalysisJuan Xu, Chee Yap. 355-362 [doi]
• On the Number of Congruent Classes of the Tetrahedra Determined by Given Volume, Circumradius and Face AreasZhenbing Zeng, Lu Yang, Lydia Dehbi. 363-370 [doi]
• An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic NumbersTao Zheng, Bican Xia. 371-378 [doi]