Table of Contents

• Computer algebra in physical research of Joint Institute for Nuclear ResearchR. N. Fedorova, Vladimir P. Gerdt, N. N. Govorun, V. P. Shirikov. 1-10
• Complexity of quantifier elimination in the theory of ordinary differential equationsD. Yu. Grigoryev. 11-25
• Groups and polynomialsGeoff C. Smith. 26-33
• Symbolic computation in relativity theoryMalcolm A. H. MacCallum. 34-43
• A zero structure theorem for polynomial-equations-solving and its applicationsWen-Tsun Wu. 44
• Some algorithms of rational function algebraSergei A. Abramov. 45-47
• The computer algebra system SIMATHR. Böffgen, M. A. Reichert. 48-49
• Converting SAC-2 code to LISPLars Langemyr. 50-51
• Computer algebra system for continued fractions manipulationV. Tomov, M. Nisheva, T. Tonev. 52-53
• Computing a lattice basis from a system of generating vectorsJohannes Buchmann, Michael Pohst. 54-63
• Expression optimization using high-level knowledgeMark P. W. Mutrie, Bruce W. Char, Richard H. Bartels. 64-70
• CATFACT: Computer algebraic tools for applications of catastrophe theoryR. G. Cowell, Francis J. Wright. 71-80
• Computer algebra applications for investigating integrability of nonlinear evolution systemsVladimir P. Gerdt, A. B. Shabat, S. I. Svinolupov, A. Yu. Zharkov. 81-92
• Computer classification of integrable seventh order MKdV-like equationsVladimir P. Gerdt, A. Yu. Zharkov. 93-94
• Symbolic computation and the finite element methodJohn Fitch, Richard G. Hall. 95-96
• Application of Lie group and computer algebra to nonlinear mechanicsD. M. Klimov, V. M. Rudenko, V. F. Zhuravlev. 97-106
• Hierarchical symbolic computations in the analysis of large-scale dynamical systemsJerzy Paczynski. 107-115
• SCHOONSCHIP for computing of gravitino interaction cross sections in n=2 supergravityN. I. Gurin. 116-117
• Creation of efficient symbolic-numeric interfaceN. N. Vasiliev. 118-119
• Automatic generation of FORTRAN-coded Jacobians and HessiansP. van den Heuvel, J. A. van Hulzen, V. V. Goldman. 120-131
• Laplace transformations in REDUCE 3Cristomir Kazasov. 132-133
• REDUCE 3.2 on iAPX 86/286-based personal computersTsuyoshi Yamamoto, Yoshinao Aoki. 134-135
• Some extensions and applications of REDUCE SystemM. Spiridonova. 136-137
• Infinite structures in SCRATCHPAD IIWilliam H. Burge, Stephen M. Watt. 138-148
• Application of a structured LISP system to computer algebraJ. Smit, Sabih H. Gerez, R. Mulder. 149-160
• Number-theoretic transforms of prescribed lengthReiner Creutzburg, Manfred Tasche. 161-162
• A Hybrid algebraic-numeric system ANS and its preliminary implementationMasayuki Suzuki, Tateaki Sasaki, Mitsuhisa Sato, Yoshinari Fukui. 163-171
• The calculation of QCD triangular Feynman graphs if the external gluonic field using REDUCE-2 systemL. S. Dulyan. 172-173
• Computer algebra application for determining local symmetries of differential equationsR. N. Fedorova, Vladimir V. Kornyak. 174-175
• Trace calculations for gauge theories on a personal computerJohannes Ranft, Holger Perlt. 176-177
• Evaluation of plasma fluid equations collision integrals using REDUCER. Liska, L. Drska. 178
• Computerised system of analytic transformations for analysing of differential equationsVladislav L. Katkov, Michail D. Popov. 179-185
• Integral equation with hidden Eigenparameter solver: REDUCE and FORTRAN in tandemEugene Shablygin. 186-191
• Combinatorial aspects of simplification of algebraic expressionsA. Ya. Rodionov, A. Yu. Taranov. 192-201
• Dynamic program improvementP. D. Pearce, John Fitch. 202-203
• Computer algebra and numerical convergenceKarl-Udo Jahn. 204-205
• Computer algebra and computation of Puiseux expansions of algebraic functionsVladimir P. Gerdt, N. A. Kostov, Z. T. Kostova. 206-207
• Boundary value problems for the Laplacian in the Euclidean space solved by symbolic computationF. Brackx, H. Serras. 208-215
• The methods for symbolic evaluation of determinants and their realization in the planner-analytic systemVitali A. Eltekov, Vladimir B. Shikalov. 216-222
• Transformation of computation formulae in systems of recurrence relationsEugene V. Zima. 223-224
• DIMREG - The package for calculations in the dimensional regularization with 4-dimensional gamma:::5:::-matrix in quantum field theoryV. A. Ilyin, A. P. Kryukov. 225-232
• CTS - Algebraic debugging system for REDUCE programsA. P. Kryukov, A. Ya. Rodionov. 233-243
• Applications of computer algebra in solid modellingAdrian Bowyer, James H. Davenport, Philip S. Milne, Julian A. Padget, Andrew F. Wallis. 244-245
• Implementation of a geometry theorem proving package in SCRATCHPAD IIK. Kusche, B. Kutzler, H. Mayr. 246-257
• Collision of convex objectsBernhard Roider, Sabine Stifter. 258-259
• Solving algebraic equations via Buchberger s algorithmStephen R. Czapor. 260-269
• Primary ideal decompositionHeinz Kredel. 270-281
• Solving systems of algebraic equations by using Gröbner basesMichael Kalkbrener. 282-292
• Properties of Gröbner bases under specializationsPatrizia M. Gianni. 293-297
• The computation of polynomial greatest common divisors over an algebraic number fieldLars Langemyr, Scott McCallum. 298-299
• An extension of Buchberger s algorithm to compute all reduced Gröbner bases of a polynomial idealKlaus-Peter Schemmel. 300-310
• Singularities of moduli spacesB. Martin, G. Pfister. 311-312
• Radical simplification using algebraic extension fieldsTrevor J. Smedley. 313-314
• Hermite normal forms for integer matricesRussell J. Bradford. 315-316
• Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matricesErich Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders. 317-322
• Fonctions symétriques et changements de basesAnnick Valibouze. 323-332
• Complexity of standard bases in projective dimension zeroMarc Giusti. 333-335
• Gröbner bases for polynomial ideals over commutative regular ringsVolker Weispfenning. 336-347
• Some algebraic algorithms based on head term elimination over polynomial ringsTateaki Sasaki. 348-354
• Algorithmic determination of the Jacobson radical of monomial algebrasTatiana Gateva-Ivanova. 355-364
• A recursive algorithm for computation of the Hilbert polynomialM. V. Kondratéva, E. V. Pankratév. 365-375
• An affine point of view on minima finding in integer lattices of lower dimensionsBrigitte Vallée. 376-378
• A combinatorial and logical approach to linear-time computabilityP. Scheffler, Detlef Seese. 379-380
• Complexity of computation of embedded resolution of algebraic curvesJ. P. G. Henry, M. Merle. 381-390
• Polynomial factorization: An exploration of Lenstra s algorithmJ. A. Abbott, James H. Davenport. 391-402
• A matrix-approach for proving inequalitiesAlois Ferscha. 403-411
• Using Automatic Program Synthesizer as a Problem Solver: Some Interesting ExperimentsPavol Návrat, Ludovit Molnár, Vladimir Vojtek. 412-423
• Strong splitting rules in automated theorem provingMatthias Baaz, Alexander Leitsch. 424-425
• Towards a refined classification of geometric search and computation problemsThomas Fischer. 426-437
• Matrix-Padé fractionsGeorge Labahn, Stanley Cabay. 438-449
• Computation of generalized Padé approximantsG. Németh, Magda Zimányi. 450-451
• A critical pair criterion for completion modulo a congruenceLeo Bachmair, Nachum Dershowitz. 452-453
• Shortest paths of a disc inside a polygonal regionGünter Werner. 454-455
• Rabin s width of a complete proof and the width of a semialgebraic setTomás Recio, Luis Miguel Pardo. 456-462
• Practical aspects of symbolic integration over Q(x)David M. Gillies, Bruce W. Char. 463-464
• Integration: Solving the Risch differential equationJ. A. Abbott. 465-467
• Computation and simplification in Lie fieldsJoachim Apel, W. Lassner. 468-478
• A package for the analytic investigation and exact solution of differential equationsThomas Wolf. 479-490
• An algorithm for the integration of elementary functionsManuel Bronstein. 491-497