Abstract is missing.
- Construction of Irreducible Polynomials over Finite FieldsSergey Abrahamyan. 1-3 [doi]
- Factorization of Polynomials and GCD Computations for Finding Universal DenominatorsSergei A. Abramov, A. Gheffar, D. E. Khmelnov. 4-18 [doi]
- A Role of Symbolic Computations in Beam PhysicsSerge N. Andrianov. 19-30 [doi]
- Thomas Decomposition of Algebraic and Differential SystemsThomas Bächler, Vladimir P. Gerdt, Markus Lange-Hegermann, Daniel Robertz. 31-54 [doi]
- On Multivariate Homogeneous Polynomial DecompositionPaula Bustillo, Jaime Gutierrez. 55-60 [doi]
- Computing Matrix Representations of Filiform Lie AlgebrasManuel Ceballos, Juan Núñez, Ángel F. Tenorio. 61-72 [doi]
- Type Specialization in AldorLaurentiu Dragan, Stephen M. Watt. 73-84 [doi]
- An Algebraic Implicitization and Specialization of Minimum KL-Divergence ModelsAmbedkar Dukkipati, Joel George Manathara. 85-96 [doi]
- On Sufficient Conditions for Integrability of a Planar System of ODEs Near a Degenerate Stationary PointVictor F. Edneral, Valery G. Romanovski. 97-105 [doi]
- Symbolic-Numeric Algorithms for Computer Analysis of Spheroidal Quantum Dot ModelsA. A. Gusev, Ochbadrakh Chuluunbaatar, Vladimir P. Gerdt, V. A. Rostovtsev, Sergey I. Vinitsky, V. L. Derbov, V. V. Serov. 106-122 [doi]
- On Reduction of Lagrange SystemsValentin Irtegov, Tatyana Titorenko. 123-133 [doi]
- Series Transformations to Improve and Extend ConvergenceG. A. Kalugin, D. J. Jeffrey. 134-147 [doi]
- Differential Resultant, Computer Algebra and Completely Integrable Dynamical SystemsZoia Kostova, Nikolay Kostov, Vladimir Gerdjikov. 148-161 [doi]
- Generic, Type-Safe and Object Oriented Computer Algebra SoftwareHeinz Kredel, Raphael Jolly. 162-177 [doi]
- Implementing Data Parallel Rational Multiple-Residue Arithmetic in EdenOleg Lobachev, Rita Loogen. 178-193 [doi]
- Fast Generalized Bruhat DecompositionGennadi I. Malaschonok. 194-202 [doi]
- Computational Science in Armenia (Invited Talk)H. Marandjian, Yu. Shoukourian. 203 [doi]
- From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk)Ernst W. Mayr. 204 [doi]
- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity TestsWinfried Neun, Thomas Sturm, Stefan Vigerske. 205-219 [doi]
- Term Cancellations in Computing Floating-Point Gröbner BasesTateaki Sasaki, Fujio Kako. 220-231 [doi]
- One Class of Third-Order Linear ODE'sS. Yu. Slavyanov. 232-237 [doi]
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate PolynomialsAkira Terui. 238-249 [doi]
- Derivation of Explicit Difference Schemes for Ordinary Differential Equations with the Aid of Lagrange-Burmann ExpansionsEvgenii V. Vorozhtsov. 250-266 [doi]
- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)Andreas Weber 0004, Thomas Sturm, Werner M. Seiler, Essam O. Abdel-Rahman. 267-279 [doi]
- An Analytical Model for the Probability Characteristics of a Crack Hitting an Encapsulated Self-healing Agent in ConcreteSerguey V. Zemskov, Henk M. Jonkers, Fred J. Vermolen. 280-292 [doi]
- Extending Clause Learning of SAT Solvers with Boolean Gröbner BasesChristoph Zengler, Wolfgang Küchlin. 293-302 [doi]