Table of Contents

• Building Bridges between Symbolic Computation and Satisfiability CheckingErika Ábrahám. 1-6 [doi]
• Algorithms for Finite Field ArithmeticÉric Schost. 7-12 [doi]
• Optimization Problems over Noncompact Semialgebraic SetsLihong Zhi. 13-14 [doi]
• Nonnegative Matrix Factorization: Algorithms, Complexity and ApplicationsAnkur Moitra. 15-16 [doi]
• Exact Linear Algebra Algorithmic: Theory and PracticeClément Pernet. 17-18 [doi]
• An Introduction to Finite Element MethodsVeronika Pillwein. 19-20 [doi]
• Error-Correcting Sparse Interpolation in the Chebyshev BasisAndrew Arnold, Erich L. Kaltofen. 21-28 [doi]
• Output-Sensitive Algorithms for Sumset and Sparse Polynomial MultiplicationAndrew Arnold, Daniel S. Roche. 29-36 [doi]
• Probabilistic Algorithm for Computing the Dimension of Real Algebraic SetsIvan Bannwarth, Mohab Safey El Din. 37-44 [doi]
• Formal Solutions of Linear Differential Systems with Essential Singularities in their CoefficientsMoulay A. Barkatou, Thomas Cluzeau, Achref Jalouli. 45-52 [doi]
• Removing Apparent Singularities of Systems of Linear Differential Equations with Rational Function CoefficientsMoulay A. Barkatou, Suzy S. Maddah. 53-60 [doi]
• Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional SequencesJérémy Berthomieu, Brice Boyer, Jean-Charles Faugère. 61-68 [doi]
• A Fast Algorithm for Computing the P-curvatureAlin Bostan, Xavier Caruso, Éric Schost. 69-76 [doi]
• Algebraic Diagonals and WalksAlin Bostan, Louis Dumont, Bruno Salvy. 77-84 [doi]
• Open Non-uniform Cylindrical Algebraic DecompositionsChristopher W. Brown. 85-92 [doi]
• Structure of Polyzetas and Explicit Representation on Transcendence Bases of Shuffle and Stuffle AlgebrasVan Chiên Bui, Gérard Henry Edmond Duchamp, Vincel Hoang Ngoc Minh. 93-100 [doi]
• p-Adic Stability In Linear AlgebraXavier Caruso, David Roe, Tristan Vaccon. 101-108 [doi]
• On þ-adic Expansions of Algebraic IntegersHsing-Hau Chen, Ming-Deh Huang. 109-116 [doi]
• A Modified Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric TermsShaoshi Chen, Hui Huang, Manuel Kauers, Ziming Li. 117-124 [doi]
• Computer Algebra Applied to a Solitary Waves StudyDidier Clamond, Denys Dutykh, André Galligo. 125-132 [doi]
• Graph-Coloring Ideals: Nullstellensatz Certificates, Gröbner Bases for Chordal Graphs, and Hardness of Gröbner BasesJesús A. De Loera, Susan Margulies, Michael Pernpeintner, Eric Riedl, David Rolnick, Gwen Spencer, Despina Stasi, Jon Swenson. 133-140 [doi]
• Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy ProblemVolker Diekert, Alexei G. Myasnikov, Armin Weiß. 141-148 [doi]
• Computing the Rank Profile MatrixJean-Guillaume Dumas, Clément Pernet, Ziad Sultan. 149-156 [doi]
• Minkowski Decomposition and Geometric Predicates in Sparse ImplicitizationIoannis Z. Emiris, Christos Konaxis, Zafeirakis Zafeirakopoulos. 157-164 [doi]
• Improving the Use of Equational Constraints in Cylindrical Algebraic DecompositionMatthew England, Russell J. Bradford, James H. Davenport. 165-172 [doi]
• Real Quantifier Elimination by Computation of Comprehensive Gröbner SystemsRyoya Fukasaku, Hidenao Iwane, Yosuke Sato. 173-180 [doi]
• Computation of Dimension in Filtered Free Modules by Gröbner ReductionChristoph Fürst, Günter Landsmann. 181-188 [doi]
• Separable Automorphisms on Matrix Algebras over Finite Field Extensions: Applications to Ideal CodesJosé Gómez-Torrecillas, F. J. Lobillo, Gabriel Navarro. 189-195 [doi]
• Randomized Root Finding over Finite FFT-fields using Tangent Graeffe TransformsBruno Grenet, Joris van der Hoeven, Grégoire Lecerf. 197-204 [doi]
• Optimizing a Parametric Linear Function over a Non-compact Real Algebraic VarietyFeng Guo, Mohab Safey El Din, Chu Wang, Lihong Zhi. 205-212 [doi]
• Certifying Isolated Singular Points and their Multiplicity StructureJonathan D. Hauenstein, Bernard Mourrain, Ágnes Szántó. 213-220 [doi]
• Real Root Finding for Rank Defects in Linear Hankel MatricesDidier Henrion, Simone Naldi, Mohab Safey El Din. 221-228 [doi]
• Constructing All Composition Series of a Finite GroupAlexander Hulpke. 229-234 [doi]
• Computing Hypergeometric Solutions of Second Order Linear Differential Equations using Quotients of Formal SolutionsErdal Imamoglu, Mark van Hoeij. 235-242 [doi]
• An Algorithm to Check Whether a Basis of a Parametric Polynomial System is a Comprehensive Gröbner Basis and the Associated Completion AlgorithmDeepak Kapur, Yiming Yang. 243-250 [doi]
• Integral D-Finite FunctionsManuel Kauers, Christoph Koutschan. 251-258 [doi]
• On the Sign of a Trigonometric ExpressionPierre-Vincent Koseleff, Fabrice Rouillier, Cuong Tran. 259-266 [doi]
• Implementation of the DKSS Algorithm for Multiplication of Large NumbersChristoph Lüders. 267-274 [doi]
• Formulas for Continued Fractions: An Automated Guess and Prove ApproachSébastien Maulat, Bruno Salvy. 275-282 [doi]
• De Nugis Groebnerialium 4: Zacharias, Spears, MöllerFerdinando Mora. 283-290 [doi]
• Computing Logarithmic Vector Fields Associated with Parametric Semi-Quasihomogeneous Hypersurface Isolated SingularitiesKatsusuke Nabeshima, Shinichi Tajima. 291-298 [doi]
• Improving Complexity Bounds for the Computation of Puiseux Series over Finite FieldsAdrien Poteaux, Marc Rybowicz. 299-306 [doi]
• Data-Discriminants of Likelihood EquationsJose Israel Rodriguez, Xiaoxian Tang. 307-314 [doi]
• Green's Functions for Stieltjes Boundary ProblemsMarkus Rosenkranz, Nitin Serwa. 315-321 [doi]
• Matrices with Two Nonzero Entries per RowB. David Saunders. 323-330 [doi]
• Near Optimal Subdivision Algorithms for Real Root IsolationVikram Sharma 0001, Prashant Batra. 331-338 [doi]
• A Relaxed Algorithm for Online Matrix InversionArne Storjohann, Shiyun Yang. 339-346 [doi]
• Subtropical Real Root FindingThomas Sturm 0001. 347-354 [doi]
• Matrix-F5 Algorithms and Tropical Gröbner Bases ComputationTristan Vaccon. 355-362 [doi]