Abstract is missing.
- A Probabilistic Symbolic-Numerical Method for the Stability Analyses of Difference Schemes for PDEsVictor G. Ganzha, Evgenii V. Vorozhtsov. 9-13 [doi]
- Computer Generation of Normalizing Transformation for Systems of Nonlinear ODEVictor F. Edneral. 14-19 [doi]
- Finding all Hypergeometric Solutions of Linear Differential EquationsMarko Petkovsek, Bruno Salvy. 27-33 [doi]
- Numeric Code Optimization in Computer Algebra Systems and Recurrent Relations TechniqueEugene V. Zima. 42-46 [doi]
- A Hybrid Method for High Precision Calculation of Polynomial Real RootsGeorge E. Collins, Werner Krandick. 47-52 [doi]
- Parallelizing Programs with APsAlexander B. Godlevsky, Anatoly E. Doroshenko. 55-62 [doi]
- GRADIENT: Algorithmic Differentiation in MapleMichael B. Monagan, Walter M. Neuenschwander. 68-76 [doi]
- A Type System for Computer Algebra (abstract)Philip S. Santas. 77 [doi]
- The Regular Problem and Green Equivalences for Special MonoidsJinzhao Wu, Lian Li. 78-85 [doi]
- Decomposition of *-closed Algebras in Polynomial TimeLászló Babai, Katalin Friedl, Markus Stricker. 86-94 [doi]
- On the Assignment Complexity of Uniform TreesHongzhong Wu. 95-104 [doi]
- Decision Procedures for Stratified Set-Theoretic SyllogisticsDomenico Cantone, Vincenzo Cutello. 105-110 [doi]
- Deciding Finiteness of Matrix Groups in Deterministic Polynomial TimeLászló Babai, Robert Beals, Daniel N. Rockmore. 117-126 [doi]
- An Elementary Algorithm for Computing the Composition Factors of a Permutation GroupRobert Beals. 127-134 [doi]
- Aspect Graphs of Algebraic SurfacesMarie-Françoise Roy. 135-143 [doi]
- A Zero Structure Theorem for Exponential PolynomialsDaniel Richardson. 144-151 [doi]
- On the Greatest Common Divisor of Polynomials which Depend on a ParameterSergei A. Abramov, K. Yu. Kvashenko. 152-156 [doi]
- Noether s ::::S::::-Transformation Simplifies Curve Singularities Rationally: A Local AnalysisEmil Volcheck. 164-172 [doi]
- The 40 generic Positions of a Parallel RobotBernard Mourrain. 173-182 [doi]
- A Practical Method for the Sparse ResultantIoannis Z. Emiris, John F. Canny. 183-192 [doi]
- Parallel Computations with Toeplitz-like and Hankel-like MatricesDario Bini, Victor Y. Pan. 193-200 [doi]
- Efficient Algorithms for Hankel Matrices over Z[x::1::, ..., x::r::]J. Rafael Sendra, Juan Llovet. 201-208 [doi]
- On Hensel Construction of Eigenvalues and Eigenvectors of Matrices with Polynomial EntriesKazuhiro Yokoyama, Taku Takeshima. 218-224 [doi]
- Nested Expansions and Hardy FieldsJohn Shackell. 234-238 [doi]
- A New Algorithm for Computing Asymptotic SeriesDominik Gruntz. 239-244 [doi]
- Differential Term-OrdersVolker Weispfenning. 245-253 [doi]
- Computing Gröbner Bases in Monoid and Group RingsKlaus Madlener, Birgit Reinert. 254-263 [doi]
- Quantifier Elimination for Formulas Constrained by Quadratic EquationsHoon Hong. 264-274 [doi]
- A Dynamic Algorithm for Gröbner Basis ComputationMassimo Caboara. 275-283 [doi]
- Automated Geometry Theorem Proving by Vector CalculationShang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang. 284-291 [doi]
- Some Results on Theorem Proving in Geometry over Finite FieldsDongdai Lin, Zhuojun Liu. 292-300 [doi]
- Geometry Theorem Proving in Vector Spaces by Means of Gröbner BasesSabine Stifter. 301-310 [doi]
- An Application of IRENA to Systems of Nonlinear Equations Arising in Equilibrium Flows in Networks.G. Keady, M. G. Richardson. 311-320 [doi]