Abstract is missing.
- Algorithmic Determination of Structure of Infinite Lie Pseudogroups of Symmetries of PDEsIan G. Lisle, Gregory J. Reid, A. Boulton. 1-6 [doi]
- Programs for Applying SymmetriesThomas Wolf. 7-15 [doi]
- Symmetries of 2:::::::nd::::::: and 3:::::::rd::::::: Order ODE sFritz Schwarz. 16-25 [doi]
- The Symbolic Computation of Differential Invariants of Polynomial Vector Field Systems Using TreesM. J. Doffou, Robert L. Grossman. 26-31 [doi]
- From Honest to Intelligent PlottingRon Avitzur, Olaf Bachmann, Norbert Kajler. 32-41 [doi]
- Simplification and Optimization Transformations of Chains of RecurrencesEugene V. Zima. 42-50 [doi]
- A Hybrid Symbolic-Numerical Method for Tracing Surface-to-Surface IntersectionsTrân Quoc Nam. 51-58 [doi]
- Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic SetsShankar Krishnan, Dinesh Manocha. 59-67 [doi]
- Computations with Relative Extensions of Number Fields with an Application to the Construction of Hilbert Class FieldsMario Daberkow, Michael Pohst. 68-76 [doi]
- On the Implementation of Dynamic EvaluationPeter A. Broadbery, T. Gómez-Díaz, Stephen M. Watt. 77-84 [doi]
- Finding Roots of Unity Among Quotients of the Roots of an Integral PolynomialKazuhiro Yokoyama, Ziming Li, István Nemes. 85-89 [doi]
- Algorithms for Computing Sparse Shifts for Multivariate PolynomialsDima Grigoriev, Yagati N. Lakshman. 96-103 [doi]
- A Simplified Method of Recognizing Zero Among Elementary ConstantsDaniel Richardson. 104-109 [doi]
- Fast Computation of the Smith Normal Form of an Integer MatrixMark Giesbrecht. 110-118 [doi]
- Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form ComputationArne Storjohann, George Labahn. 119-125 [doi]
- STAR/MPI: Binding a Parallel Library to Interactive Symbolic Algebra SystemsGene Cooperman. 126-132 [doi]
- Mathematical Typesetting in ::::Mathematica::::Neil Soiffer. 140-149 [doi]
- Theorems and Algorithms: An Interface between Isabelle and MapleClemens Ballarin, Karsten Homann, Jacques Calmet. 150-157 [doi]
- Representation for the Radical of a Finitely Generated Differential IdealFrançois Boulier, Daniel Lazard, François Ollivier, Michel Petitot. 158-166 [doi]
- Gröbner Duality and Multiplicities in Polynomial System SolvingMaria Grazia Marinari, Teo Mora, H. Michael Möller. 167-179 [doi]
- Implicitization of Parametric Curves and Surfaces by Using Symmetric FunctionsLaureano González-Vega, Guadalupe Trujillo. 180-186 [doi]
- Comparison of Various Multivariate Resultant FormulationsDeepak Kapur, Tushar Saxena. 187-194 [doi]
- The Singular Value Decomposition for Polynomial SystemsRobert M. Corless, Patrizia M. Gianni, Barry M. Trager, Stephen M. Watt. 195-207 [doi]
- Numerical Uniformization of Hyperelliptic CurvesKlaus-Dieter Semmler, Mika Seppälä. 208-215 [doi]
- On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their EvaluationsAngel Díaz, Erich Kaltofen. 232-239 [doi]
- Evaluation of the Heuristic Polynomial GCDHsin-Chao Liao, Richard J. Fateman. 240-247 [doi]
- A Solution to the Extended GCD ProblemBohdan S. Majewski, George Havas. 248-253 [doi]
- An Analysis of Lehmer s Euclidean GCD AlgorithmJonathan Sorenson. 254-258 [doi]
- Computing with Matrix Groups Using Permutation RepresentationsGene Cooperman, Larry Finkelstein, Michael Tselman. 259-264 [doi]
- Fast Recognition of the Nilpotency of Permutation GroupsFerenc Rakoczi. 265-269 [doi]
- On the Computation of Ordinary Irreducible Representations of Finite GroupsTorsten Minkwitz. 278-284 [doi]