Table of Contents

• Computing with Arithmetic GroupsGabriele Nebe. 1-2 [doi]
• Closed Form Solutions for Linear Differential and Difference EquationsMark van Hoeij. 3-4 [doi]
• The Zero Problem for Exponential PolynomialsJames Worrell. 5 [doi]
• Automated Geometric Reasoning with Geometric Algebra: Theory and PracticeHongbo Li. 7-8 [doi]
• Algorithmic Approaches for Lattice Path CombinatoricsMarni Mishna. 9-10 [doi]
• Lattice Reduction AlgorithmsDamien Stehlé. 11-12 [doi]
• On the Extended Hensel Construction and its Application to the Computation of Limit PointsParisa Alvandi, Masoud Ataei, Marc Moreno Maza. 13-20 [doi]
• An Algorithm for Computing Minimal Associated Primes of Binomial Ideals without Producing Redundant ComponentsToru Aoyama. 21-27 [doi]
• Rational Points on the Unit Sphere: Approximation Complexity and Practical ConstructionsDaniel Bahrdt, Martin P. Seybold. 29-36 [doi]
• Irreducibility and Deterministic r-th Root Finding over Finite FieldsVishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena. 37-44 [doi]
• A Case Study on the Parametric Occurrence of Multiple Steady StatesRussell J. Bradford, James H. Davenport, Matthew England, Hassan Errami, Vladimir P. Gerdt, Dima Grigoriev, Charles Hoyt, Marek Kosta, Ovidiu Radulescu, Thomas Sturm 0001, Andreas Weber 0004. 45-52 [doi]
• Projection and Quantifier Elimination Using Non-uniform Cylindrical Algebraic DecompositionChristopher W. Brown. 53-60 [doi]
• The Complexity of an Adaptive Subdivision Method for Approximating Real CurvesMichael A. Burr, Shuhong Gao, Elias P. Tsigaridas. 61-68 [doi]
• Discriminants of Complete Intersection Space CurvesLaurent Busé, Ibrahim Nonkané. 69-76 [doi]
• Fast Multiplication for Skew PolynomialsXavier Caruso, Jérémy Le Borgne. 77-84 [doi]
• Big Prime Field FFT on the GPULiangyu Chen, Svyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza. 85-92 [doi]
• Criteria for Finite Difference Gröbner Bases of Normal Binomial Difference IdealsYu-Ao Chen, Xiao-Shan Gao. 93-100 [doi]
• nMichael Clausen, Paul Hühne. 101-108 [doi]
• Gcd Modulo a Primary Triangular Set of Dimension ZeroXavier Dahan. 109-116 [doi]
• Calculating the Power Residue Symbol and Ibeta: Applications of Computing the Group Structure of the Principal Units of a p-adic Number Field CompletionKoen de Boer, Carlo Pagano. 117-124 [doi]
• Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time CircuitsJean-Guillaume Dumas, Erich L. Kaltofen, Gilles Villard, Lihong Zhi. 125-132 [doi]
• Certificates for Triangular Equivalence and Rank ProfilesJean-Guillaume Dumas, David Lucas, Clément Pernet. 133-140 [doi]
• On Signature-Based Gröbner Bases Over Euclidean RingsChristian Eder, Gerhard Pfister, Adrian Popescu. 141-148 [doi]
• Matrix Representations by Means of InterpolationIoannis Z. Emiris, Christos Konaxis, Ilias S. Kotsireas, Clément Laroche. 149-156 [doi]
• Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming LanguageClaus Fieker, William Hart, Tommy Hofmann, Fredrik Johansson. 157-164 [doi]
• Parametrizations for Families of ECM-Friendly CurvesAlexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra. 165-171 [doi]
• An Algebraic-Geometric Method for Computing Zolotarev PolynomialsGeorg Grasegger, N. Thieu Vo. 173-180 [doi]
• Computing the Nearest Rank-Deficient Matrix PolynomialMark Giesbrecht, Joseph Haraldson, George Labahn. 181-188 [doi]
• Dimension-Dependent Upper Bounds for Gröbner BasesAmir Hashemi, Werner M. Seiler. 189-196 [doi]
• A Constructive Approach to Arithmetics in Ore LocalizationsJohannes Hoffmann, Viktor Levandovskyy. 197-204 [doi]
• Algorithms for Structured Linear Systems Solving and Their ImplementationSeung Gyu Hyun, Romain Lebreton, Éric Schost. 205-212 [doi]
• Formula Simplification for Real Quantifier Elimination Using Geometric InvarianceHidenao Iwane, Hirokazu Anai. 213-220 [doi]
• Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric SequencesAndreas Humenberger, Maximilian Jaroschek, Laura Kovács. 221-228 [doi]
• Efficiently Computing Real Roots of Sparse PolynomialsGorav Jindal, Michael Sagraloff. 229-236 [doi]
• Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error CorrectionErich L. Kaltofen, Clément Pernet, Arne Storjohann, Cleveland Waddell. 237-244 [doi]
• Bounds for Substituting Algebraic Functions into D-finite FunctionsManuel Kauers, Gleb Pogudin. 245-252 [doi]
• Popov Form Computation for Matrices of Ore PolynomialsMohamed Khochtali, Johan Rosenkilde, Arne Storjohann. 253-260 [doi]
• The Truncated Fourier Transform for Mixed RadicesRobin Larrieu. 261-268 [doi]
• Riemann Tensor Polynomial Canonicalization by Graph Algebra ExtensionHongbo Li, Zhang Li, Yang Li. 269-276 [doi]
• A New Algorithm for General Factorizations of Multivariate Polynomial MatricesDong Lu, Xiaodong Ma, DingKang Wang. 277-284 [doi]
• Algorithmic Verification of Linearizability for Ordinary Differential EquationsDmitry A. Lyakhov, Vladimir P. Gerdt, Dominik L. Michels. 285-292 [doi]
• M4GB: An Efficient Gröbner-Basis AlgorithmRusydi H. Makarim, Marc Stevens. 293-300 [doi]
• Sparse Rational Univariate RepresentationAngelos Mantzaflaris, Éric Schost, Elias P. Tsigaridas. 301-308 [doi]
• Resultants and Discriminants for Bivariate Tensor-Product PolynomialsAngelos Mantzaflaris, Elias P. Tsigaridas. 309-316 [doi]
• Reconstruction Algorithms for Sums of Affine PowersIgnacio García-Marco, Pascal Koiran, Timothée Pecatte. 317-324 [doi]
• Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant KJohannes Middeke. 325-332 [doi]
• Fast Algorithm for Border Bases of Artinian Gorenstein AlgebrasBernard Mourrain. 333-340 [doi]
• Parametric Greatest Common Divisors using Comprehensive Gröbner SystemsKosaku Nagasaka. 341-348 [doi]
• Fast Computation of the Roots of Polynomials Over the Ring of Power SeriesVincent Neiger, Johan Rosenkilde, Éric Schost. 349-356 [doi]
• Computing Canonical Bases of Modules of Univariate RelationsVincent Neiger, Thi Xuan Vu. 357-364 [doi]
• Exploring the Dynamic Buchberger AlgorithmJohn Perry. 365-372 [doi]
• Growth in Varieties of Multioperator Algebras and Groebner Bases in OperadsDmitri Piontkovski. 373-380 [doi]
• Improved Bounds on Absolute Positiveness of Multivariate PolynomialsSwaroop N. Prabhakar, Vikram Sharma 0001. 381-388 [doi]
• Characteristic Polynomials of p-adic MatricesXavier Caruso, David Roe, Tristan Vaccon. 389-396 [doi]
• Two Fast Parallel GCD Algorithms of Many IntegersSidi Mohamed Sedjelmaci. 397-404 [doi]
• n)Carlo Sircana. 405-412 [doi]
• CAD Adjacency Computation Using Validated NumericsAdam W. Strzebonski. 413-420 [doi]
• Functional Decomposition Using Principal SubfieldsLuiz Emilio Allem, Juliane G. Capaverde, Mark van Hoeij, Jonas Szutkoski. 421-428 [doi]
• A Tropical F5 AlgorithmTristan Vaccon, Kazuhiro Yokoyama. 429-436 [doi]
• The Frobenius FFTJoris van der Hoeven, Robin Larrieu. 437-444 [doi]
• Composition Modulo Powers of PolynomialsJoris van der Hoeven, Grégoire Lecerf. 445-452 [doi]