ISSAC 2005: Beijing, China

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