Table of Contents

• A view on the future of symbolic computationBruno Buchberger. 1 [doi]
• D-finiteness: algorithms and applicationsBruno Salvy. 2-3 [doi]
• On a finite kernel theorem for polynomial-type optimization problems and some of its applicationsWu Wen-Tsün. 4 [doi]
• Gosper s algorithm, accurate summation, and the discrete Newton-Leibniz formulaSergei A. Abramov, M. Petkovssek. 5-12 [doi]
• Signature of symmetric rational matrices and the unitary dual of lie groupsJeffrey Adams, B. David Saunders, Zhendong Wan. 13-20 [doi]
• Sum of roots with positive real partsHirokazu Anai, Shinji Hara, Kazuhiro Yokoyama. 21-28 [doi]
• Algebraic general solutions of algebraic ordinary differential equationsJ. M. Aroca, J. Cano, Ruyong Feng, Xiao-Shan Gao. 29-36 [doi]
• Adherence is better than adjacency: computing the Riemann index using CADJames C. Beaumont, Russell J. Bradford, James H. Davenport, Nalina Phisanbut. 37-44 [doi]
• Fast algorithms for polynomial solutions of linear differential equationsAlin Bostan, Thomas Cluzeau, Bruno Salvy. 45-52 [doi]
• Non complete integrability of a magnetic satellite in circular orbitDelphine Boucher. 53-60 [doi]
• Symmetric and semisymmetric graphs construction using G-graphsAlain Bretto, Luc Gillibert, Bernard Laget. 61-67 [doi]
• Picard--Vessiot extensions for linear functional systemsManuel Bronstein, Ziming Li, Min Wu. 68-75 [doi]
• On using bi-equational constraints in CAD constructionChristopher W. Brown, Scott McCallum. 76-83 [doi]
• Hybrid symbolic-numeric integration in multiple dimensions via tensor-product seriesOrlando A. Carvajal, Frederick W. Chapman, Keith O. Geddes. 84-91 [doi]
• A BLAS based C library for exact linear algebra on integer matricesZhuliang Chen, Arne Storjohann. 92-99 [doi]
• Structure and asymptotic expansion of multiple harmonic sumsChristian Costermans, J. Y. Enjalbert, Hoang Ngoc Minh, Michel Petitot. 100-107 [doi]
• Lifting techniques for triangular decompositionsXavier Dahan, Marc Moreno Maza, Éric Schost, Wenyuan Wu, Yuzhen Xie. 108-115 [doi]
• Computing the multiplicity structure in solving polynomial systemsBarry H. Dayton, Zhonggang Zeng. 116-123 [doi]
• Algorithms for the non-monic case of the sparse modular GCD algorithmJennifer de Kleine, Michael B. Monagan, Allan D. Wittkopf. 124-131 [doi]
• Computing µ-bases of rational curves and surfaces using polynomial matrix factorizationJiansong Deng, Falai Chen, Liyong Shen. 132-139 [doi]
• Efficient computation of the characteristic polynomialJean-Guillaume Dumas, Clément Pernet, Zhendong Wan. 140-147 [doi]
• Selfintersections of a bézier bicubic surfaceAndré Galligo, Jean Pascal Pavone. 148-155 [doi]
• A procedure for proving special function inequalities involving a discrete parameterStefan Gerhold, Manuel Kauers. 156-162 [doi]
• Generalized Loewy-decomposition of d-modulesDima Grigoriev, Fritz Schwarz. 163-170 [doi]
• On computing nearest singular hankel matricesMarkus A. Hitz. 171-176 [doi]
• A reliable block Lanczos algorithm over small finite fieldsBradford Hovinen, Wayne Eberly. 177-184 [doi]
• Schur partition for symmetric ternary forms and readable proof to inequalitiesFangjian Huang, Shengli Chen. 185-192 [doi]
• Affine transformations of algebraic numbersDavid J. Jeffrey, Pratibha, K. B. Roach. 193-199 [doi]
• Architecture-aware classical Taylor shift by 1Jeremy R. Johnson, Werner Krandick, Anatole D. Ruslanov. 200-207 [doi]
• On the complexity of factoring bivariate supersparse (Lacunary) polynomialsErich Kaltofen, Pascal Koiran. 208-215 [doi]
• Generic matrix multiplication and memory management in linBoxErich Kaltofen, Dmitriy Morozov, George Yuhasz. 216-223 [doi]
• Exact analytical solutions to the nonlinear Schrödinger equation modelBiao Li, Yong Chen, Qi Wang. 224-230 [doi]
• Half-GCD and fast rational recoveryDaniel Lichtblau. 231-236 [doi]
• Application of Wu s method to symbolic model checkingWeibo Mao, Jinzhao Wu. 237-244 [doi]
• Probabilistic algorithms for computing resultantsMichael B. Monagan. 245-252 [doi]
• Generalized normal forms and polynomial system solvingBernard Mourrain. 253-260 [doi]
• Domains and expressions: an interface between two approaches to computer algebraCosmin E. Oancea, Stephen M. Watt. 261-268 [doi]
• Symbolic-numeric completion of differential systems by homotopy continuationGreg Reid, Jan Verschelde, Allan D. Wittkopf, Wenyuan Wu. 269-276 [doi]
• Algorithms for symbolic/numeric control of affine dynamical systemsAude Rondepierre, Jean-Guillaume Dumas. 277-284 [doi]
• Finding telescopers with minimal depth for indefinite nested sum and product expressionsCarsten Schneider. 285-292 [doi]
• Multivariate power series multiplicationÉric Schost. 293-300 [doi]
• Partial degree formulae for rational algebraic surfacesSonia Pérez-Díaz, J. Rafael Sendra. 301-308 [doi]
• Computing the rank and a small nullspace basis of a polynomial matrixArne Storjohann, Gilles Villard. 309-316 [doi]
• Approximation of dynamical systems using s-systems theory: application to biological systemsLaurent Tournier. 317-324 [doi]
• Generalized laplace transformations and integration of hyperbolic systems of linear partial differential equationsSergey P. Tsarev. 325-331 [doi]
• Preconditioners for singular black box matricesWilliam J. Turner. 332-339 [doi]
• Solving second order linear differential equations with Klein s theoremMark van Hoeij, Jacques-Arthur Weil. 340-347 [doi]
• Deterministic equation solving over finite fieldsChristiaan van de Woestijne. 348-353 [doi]
• Stability analysis of biological systems with real solution classificationDongming Wang, Bican Xia. 354-361 [doi]
• An open problem on metric invariants of tetrahedraLu Yang, Zhenbing Zeng. 362-364 [doi]
• Admissible orderings and finiteness criteria for differential standard basesAleksey Zobnin. 365-372 [doi]