Abstract is missing.
- Succinct Data Structures ... Potential for Symbolic Computation?J. Ian Munro. 5-8 [doi]
- Symbolic Summation in Difference Rings and ApplicationsCarsten Schneider. 9-12 [doi]
- Symbolic Computation of Parameter IntegralsClemens G. Raab. 13-15 [doi]
- Symbolic Computation with Integro-Differential OperatorsGeorg Regensburger. 17-18 [doi]
- Formal Algorithmic Elimination for PDEsDaniel Robertz. 19-22 [doi]
- Detecting Similarities of Rational Space CurvesJuan Gerardo Alcázar, Carlos Hermoso, Georg Muntingh. 23-30 [doi]
- Solving Generic Nonarchimedean Semidefinite Programs Using Stochastic Game AlgorithmsXavier Allamigeon, Stéphane Gaubert, Mateusz Skomra. 31-38 [doi]
- Computing Limits of Real Multivariate Rational FunctionsParisa Alvandi, Mahsa Kazemi, Marc Moreno Maza. 39-46 [doi]
- Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime TestEric Bach, Rex Fernando. 47-54 [doi]
- Baby-Step Giant-Step Algorithms for the Symmetric GroupEric Bach, Bryce Sandlund. 55-62 [doi]
- Computing the Lie Algebra of the Differential Galois Group of a Linear Differential SystemMoulay A. Barkatou, Thomas Cluzeau, Jacques-Arthur Weil, Lucia Di Vizio. 63-70 [doi]
- Complexity Analysis of Root Clustering for a Complex PolynomialRuben Becker, Michael Sagraloff, Vikram Sharma 0001, Juan Xu, Chee Yap. 71-78 [doi]
- A Superfast Randomized Algorithm to Decompose Binary FormsMatías R. Bender, Jean-Charles Faugère, Ludovic Perret, Elias Tsigaridas. 79-86 [doi]
- Analysis of the Brun Gcd AlgorithmValérie Berthé, Loïck Lhote, Brigitte Vallée. 87-94 [doi]
- Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear AlgebraJérémy Berthomieu, Jean-Charles Faugère. 95-102 [doi]
- Determinantal Sets, Singularities and Application to Optimal Control in Medical ImageryBernard Bonnard, Jean-Charles Faugère, Alain Jacquemard, Mohab Safey El Din, Thibaut Verron. 103-110 [doi]
- Computation of the Similarity Class of the p-CurvatureAlin Bostan, Xavier Caruso, Éric Schost. 111-118 [doi]
- Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime FieldAlin Bostan, Gilles Christol, Philippe Dumas. 119-126 [doi]
- Efficient Algorithms for Mixed Creative TelscopingAlin Bostan, Louis Dumont, Bruno Salvy. 127-134 [doi]
- GBLA: Gröbner Basis Linear Algebra PackageBrice Boyer, Christian Eder, Jean-Charles Faugère, Sylvian Lachartre, Fayssal Martani. 135-142 [doi]
- Validating the Completeness of the Real Solution Set of a System of Polynomial EquationsDaniel A. Brake, Jonathan D. Hauenstein, Alan C. Liddell Jr.. 143-150 [doi]
- On the Complexity of Solving Zero-Dimensional Polynomial Systems via ProjectionCornelius Brand, Michael Sagraloff. 151-158 [doi]
- Division and Slope Factorization of p-Adic PolynomialsXavier Caruso, David Roe, Tristan Vaccon. 159-166 [doi]
- Existence Problem of Telescopers: Beyond the Bivariate CaseShaoshi Chen, Qing-Hu Hou, George Labahn, Rong-Hua Wang. 167-174 [doi]
- Reduction-Based Creative Telescoping for Algebraic FunctionsShaoshi Chen, Manuel Kauers, Christoph Koutschan. 175-182 [doi]
- Critical Point Computations on Smooth Varieties: Degree and Complexity BoundsMohab Safey El Din, Pierre-Jean Spaenlehauer. 183-190 [doi]
- Fast Fourier OrthogonalizationLéo Ducas, Thomas Prest. 191-198 [doi]
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse MatrixJean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé, Gilles Villard. 199-206 [doi]
- Selecting Algorithms for Black Box Matrices: Checking For Matrix Properties That Can Simplify ComputationsWayne Eberly. 207-214 [doi]
- On the Bit Complexity of Solving Bilinear Polynomial SystemsIoannis Z. Emiris, Angelos Mantzaflaris, Elias P. Tsigaridas. 215-222 [doi]
- Computing Small Certificates of Inconsistency of Quadratic Fewnomial SystemsJean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz. 223-230 [doi]
- Computer Assisted Proof for Apwenian SequencesHao Fu, Guo-Niu Han. 231-238 [doi]
- Bounds for Orders of Derivatives in Differential Elimination AlgorithmsRichard Gustavson, Alexey Ovchinnikov, Gleb Pogudin. 239-246 [doi]
- Numerical Sparsity Determination and Early TerminationZhiwei Hao, Erich L. Kaltofen, Lihong Zhi. 247-254 [doi]
- 60David Harvey, Joris van der Hoeven, Grégoire Lecerf. 255-262 [doi]
- A Factorization Algorithm for G-Algebras and ApplicationsAlbert Heinle, Viktor Levandovskyy. 263-270 [doi]
- A Fast Parallel Sparse Polynomial GCD AlgorithmJiaxiong Hu, Michael B. Monagan. 271-278 [doi]
- New Bounds for Hypergeometric Creative TelescopingHui Huang. 279-286 [doi]
- Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite FieldsMing-Deh Huang, Lian Liu. 287-294 [doi]
- Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary ShiftsClaude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard. 295-302 [doi]
- Computing Real Roots of Real Polynomials ... and now For Real!Alexander Kobel, Fabrice Rouillier, Michael Sagraloff. 303-310 [doi]
- Equivariant Gröbner Bases of Symmetric Toric IdealsRobert Krone. 311-318 [doi]
- On p-Adic Differential Equations with Separation of VariablesPierre Lairez, Tristan Vaccon. 319-323 [doi]
- Positive Root Isolation for Poly-PowersJing-Cao Li, Cheng-Chao Huang, Ming Xu, Zhi-Bin Li. 325-332 [doi]
- Symbolic-Numeric Tools for Analytic Combinatorics in Several VariablesStephen Melczer, Bruno Salvy. 333-340 [doi]
- A Fast Algorithm for Computing the Truncated ResultantGuillaume Moroz, Éric Schost. 341-348 [doi]
- Comprehensive Gröbner Systems in Rings of Differential Operators, Holonomic D-modules and B-functionsKatsusuke Nabeshima, Katsuyoshi Ohara, Shinichi Tajima. 349-356 [doi]
- Solving Rank-Constrained Semidefinite Programs in Exact ArithmeticSimone Naldi. 357-364 [doi]
- Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial EquationsVincent Neiger. 365-372 [doi]
- Faster LLL-type Reduction of Lattice BasesArnold Neumaier, Damien Stehlé. 373-380 [doi]
- System of Partial Differential Equations for the Hypergeometric Function 1F1 of a Matrix Argument on Diagonal RegionsMasayuki Noro. 381-388 [doi]
- Computing with Quasiseparable MatricesClément Pernet. 389-396 [doi]
- Algorithmic Operator Algebras via Normal Forms for TensorsJamal Hossein Poor, Clemens G. Raab, Georg Regensburger. 397-404 [doi]
- Algorithms for Simultaneous Padé ApproximationsJohan Sebastian Rosenkilde, Arne Storjohann. 405-412 [doi]
- Contraction of Ore Ideals with ApplicationsYi Zhang. 413-420 [doi]