Table of Contents

• A-hypergeometric functions: computational aspectsFrits Beukers. 1-2 [doi]
• Complexity of deciding connectivity in real algebraic sets: recent results and future research directionsMarie-Françoise Roy. 3-5 [doi]
• Asymptotic spectrum and matrix multiplicationVolker Strassen. 6-7 [doi]
• Upper bounds on real roots and lower bounds for the permanentPascal Koiran. 8 [doi]
• Elements of computer-algebraic analysisViktor Levandovskyy. 9-10 [doi]
• Algebraic statisticsSeth Sullivant. 11 [doi]
• On valuations of meromorphic solutions of arbitrary-order linear difference systems with polynomial coefficientsSergei A. Abramov, D. E. Khmelnov. 12-19 [doi]
• Computing Puiseux series for algebraic surfacesDanko Adrovic, Jan Verschelde. 20-27 [doi]
• The M4RIE library for dense linear algebra over small fields with even characteristicMartin R. Albrecht. 28-34 [doi]
• A root isolation algorithm for sparse univariate polynomialsMaria Emilia Alonso Garcia, André Galligo. 35-42 [doi]
• Computing closed form solutions of integrable connectionsMoulay A. Barkatou, Thomas Cluzeau, Carole El Bacha, Jacques-Arthur Weil. 43-50 [doi]
• Solving linear ordinary differential systems in hyperexponential extensionsMoulay A. Barkatou, Clemens G. Raab. 51-58 [doi]
• Relaxed p-adic Hensel lifting for algebraic systemsJérémy Berthomieu, Romain Lebreton. 59-66 [doi]
• Solving polynomial systems over finite fields: improved analysis of the hybrid approachLuk Bettale, Jean-Charles Faugère, Ludovic Perret. 67-74 [doi]
• A polynomial time algorithm for computing the HNF of a module over the integers of a number fieldJean-François Biasse, Claus Fieker. 75-82 [doi]
• Parallel sparse polynomial multiplication on modern hardware architecturesFrancesco Biscani. 83-90 [doi]
• 2Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler. 91-98 [doi]
• Fast computation of common left multiples of linear ordinary differential operatorsAlin Bostan, Frédéric Chyzak, Bruno Salvy, Ziming Li. 99-106 [doi]
• Power series solutions of singular (q)-differential equationsAlin Bostan, Bruno Salvy, Muhammad F. I. Chowdhury, Éric Schost, Romain Lebreton. 107-114 [doi]
• On the complexity of solving initial value problemsOlivier Bournez, Daniel S. Graça, Amaury Pouly. 115-121 [doi]
• Order-degree curves for hypergeometric creative telescopingShaoshi Chen, Manuel Kauers. 122-129 [doi]
• Telescopers for rational and algebraic functions via residuesShaoshi Chen, Manuel Kauers, Michael F. Singer. 130-137 [doi]
• Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input valuesMatthew T. Comer, Erich Kaltofen, Clément Pernet. 138-145 [doi]
• Fast computation of Smith forms of sparse matrices over local ringsMustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders. 146-153 [doi]
• On the complexity of solving a bivariate polynomial systemPavel Emeliyanenko, Michael Sagraloff. 154-161 [doi]
• Critical points and Gröbner bases: the unmixed caseJean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer. 162-169 [doi]
• Solving polynomial systems globally invariant under an action of the symmetric group and application to the equilibria of N vortices in the planeJean-Charles Faugère, Jules Svartz. 170-178 [doi]
• Twisting q-holonomic sequences by complex roots of unityStavros Garoufalidis, Christoph Koutschan. 179-186 [doi]
• Improving the accuracy of linear programming solvers with iterative refinementAmbros M. Gleixner, Daniel E. Steffy, Kati Wolter. 187-194 [doi]
• Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functionsFeng Guo, Erich Kaltofen, Lihong Zhi. 195-202 [doi]
• Practical Gröbner basis computationBjarke Hammersholt Roune, Michael Stillman. 203-210 [doi]
• On the complexity of multivariate blockwise polynomial multiplicationJoris van der Hoeven, Grégoire Lecerf. 211-218 [doi]
• Rational invariants of scalings from Hermite normal formsEvelyne Hubert, George Labahn. 219-226 [doi]
• Zeilberger's holonomic ansatz for PfaffiansMasao Ishikawa, Christoph Koutschan. 227-233 [doi]
• Algorithms for the universal decomposition algebraRomain Lebreton, Éric Schost. 234-241 [doi]
• An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert schemePaolo Lella. 242-248 [doi]
• Computing real solutions of polynomial systems via low-rank moment matrix completionYue Ma, Lihong Zhi. 249-256 [doi]
• Small homogeneous quandlesJames McCarron. 257-264 [doi]
• Border basis representation of a general quotient algebraBernard Mourrain, Philippe Trebuchet. 265-272 [doi]
• An algorithm to compute the differential equations for the logarithm of a polynomialToshinori Oaku. 273-280 [doi]
• Deterministic unimodularity certificationColton Pauderis, Arne Storjohann. 281-288 [doi]
• Programming before theorizing, a case studyAna Romero, Francis Sergeraert. 289-296 [doi]
• When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomialMichael Sagraloff. 297-304 [doi]
• Effective de Rham cohomology: the hypersurface casePeter Scheiblechner. 305-310 [doi]
• Construction of 2-closed M-representationsÁkos Seress. 311-318 [doi]
• Near optimal tree size bounds on a simple real root isolation algorithmVikram Sharma 0001, Chee-Keng Yap. 319-326 [doi]
• An efficient programming model for memory-intensive recursive algorithms using parallel disksVlad Slavici, Daniel Kunkle, Gene Cooperman, Stephen Linton. 327-334 [doi]
• Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulasAdam W. Strzebonski. 335-342 [doi]
• Univariate real root isolation in multiple extension fieldsAdam W. Strzebonski, Elias P. Tsigaridas. 343-350 [doi]
• A signature-based algorithm for computing Gröbner bases in solvable polynomial algebrasYao Sun, DingKang Wang, Xiaodong Ma, Yang Zhang. 351-358 [doi]
• Factorization of differential operators with ordinary differential polynomial coefficientsMingbo Zhang, Yong Luo. 359-365 [doi]
• Computing minimal nullspace basesWei Zhou, George Labahn, Arne Storjohann. 366-373 [doi]