ISSAC 2003: Philadelphia, Pennsylvania, USA

• Michael P. Barnett:
  Chemistry and computer algebra: past, present, future. 1-2
  
• Erich Kaltofen:
  Polynomial factorization: a success story. 3-4
  
• Reinhard C. Laubenbacher:
  A computer algebra approach to biological systems. 5-6
  
• Sergei A. Abramov, Ha Q. Le, Marko Petkovsek:
  Rational canonical forms and efficient representations of hypergeometric terms. 7-14
  
• F. Aroca, J. Cano, F. Jung:
  Power series solutions for non-linear PDE's. 15-22
  
• Abdolali Basiri, Jean-Charles Faugère:
  Changing the ordering of Gröbner bases with LLL: case of two variables. 23-29
  
• James C. Beaumont, Russell J. Bradford, James H. Davenport:
  Better simplification of elementary functions through power series. 30-36
  
• Alin Bostan, Grégoire Lecerf, Éric Schost:
  Tellegen's principle into practice. 37-44
  
• Delphine Boucher, Philippe Gaillard, Felix Ulmer:
  Fourth order linear differential equations with imprimitive group. 45-49
  
• Frederick W. Chapman:
  An elementary algorithm for the automatic derivation and proof of tensor product identities via computer algebra. 50-57
  
• Thomas Cluzeau:
  Factorization of differential systems in characteristic p. 58-65
  
• Gene Cooperman, Eric Robinson:
  Memory-based and disk-based algorithms for very high degree permutation groups. 66-73
  
• Ruchira S. Datta:
  Using computer algebra to find nash equilibria. 74-79
  
• Wayne Eberly:
  Early termination over small fields. 80-87
  
• Richard J. Fateman:
  High-level proofs of mathematical programs using automatic differentiation, simplification, and some common sense. 88-94
  
• Richard J. Fateman, Raymond Toy:
  Converting call-by-reference to call-by-value: Fortran and Lisp coexisting. 95-102
  
• Anne Fredet:
  Factorization of linear differential operators in exponential extensions. 103-110
  
• Keith O. Geddes, Wei Wei Zheng:
  Exploiting fast hardware floating point in high precision computation. 111-118
  
• Jürgen Gerhard, Mark Giesbrecht, Arne Storjohann, Eugene V. Zima:
  Shiftless decomposition and polynomial-time rational summation. 119-126
  
• Pascal Giorgi, Claude-Pierre Jeannerod, Gilles Villard:
  On the complexity of polynomial matrix computations. 135-142
  
• Joris van der Hoeven:
  Relaxed mltiplication using the middle product. 143-147
  
• E. Hubert, N. Le Roux:
  Computing power series solutions of a nonlinear PDE system. 148-155
  
• Alexander Hulpke, Steve Linton:
  Total ordering on subgroups and cosets. 156-160
  
• Erich Kaltofen, John May:
  On approximate irreducibility of polynomials in several variables. 161-168
  
• Wolfram Koepf:
  Power series, Bieberbach conjecture and the de Branges and Weinstein functions. 169-175
  
• Viktor Levandovskyy, Hans Schönemann:
  Plural: a computer algebra system for noncommutative polynomial algebras. 176-183
  
• Scott McCallum:
  On order-invariance of a binomial over a nullifying cell. 184-190
  
• Elizabeth L. Mansfield, Ágnes Szántó:
  Elimination theory for differential difference polynomials. 191-198
  
• Ludovic Meunier, Bruno Salvy:
  ESF: an automatically generated encyclopedia of special functions. 199-206
  
• Manfred Minimair:
  Factoring sparse resultants of linearly combined polynomials. 207-214
  
• Gregory J. Reid, Jianliang Tang, Lihong Zhi:
  A complete symbolic-numeric linear method for camera pose determination. 215-223
  
• Mohab Safey El Din, Éric Schost:
  Polar varieties and computation of one point in each connected component of a smooth real algebraic set. 224-231
  
• Tateaki Sasaki:
  The subresultant and clusters of close roots. 232-239
  
• Andreas Seidl, Thomas Sturm:
  A generic projection operator for partial cylindrical algebraic decomposition. 240-247
  
• Tanush Shaska:
  Determining the automorphism group of a hyperelliptic curve. 248-254
  
• Ulrich Vollmer:
  A note on the hermite basis computation of large integer matrices. 255-257
  
• Paul S. Wang, Norbert Kajler, Yi Zhou, Xiao Zou:
  WME: towards a web for mathematics education. 258-265
  
• Zhonggang Zeng:
  A method computing multiple roots of inexact polynomials. 266-272
  

Last update Fri May 25 08:24:21 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page