Abstract is missing.
- Integration - What do we want from the theory?James H. Davenport. 2-11
- The Euclidean algorithm for Gaussian integersHeinrich Rolletschek. 12-23
- Multi polynominal remainder sequence and its application to linear diophantine equationsAkio Furukawa, Tateaki Sasaki. 24-35
- Towards mechanical solution of the Kahan Ellipse Problem 1Dennis S. Arnon, Scott F. Smith 0003. 36-44
- Automatically determining symmetries of ordinary differential equationsFritz Schwarz. 45-54
- Algebraic computation of the statistics of the solution of some nonlinear stochastic differential equationsFrançoise Lamnabhi-Lagarrigue, M. Lamnabhi. 55-67
- Characterization of a linear differential system with a regular singularityAziz Hilali. 68-77
- The Bath concurrent LISP machineJed Marti, John Fitch. 78-90
- The ecology of LISP or the case for the preservation of the environmentJulian A. Padget. 91-100
- The design of maple: A compact, portable and powerful computer algebra systemBruce W. Char, Keith O. Geddes, W. Morven Gentleman, Gaston H. Gonnet. 101-115
- LISP compilation viewed as provable semantics preserving program transformationHerbert Stoyan. 116-127
- Implementing REDUCE on a micro-computerJohn Fitch. 128-136
- A note on the complexity of constructing Gröbner-BasesBruno Buchberger. 137-145
- Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equationsDaniel Lazard. 146-156
- The computation of the Hilbert functionFerdinando Mora, H. Michael Möller. 157-167
- An algorithm for constructing detaching bases in the ring of polynominals over a fieldFranz Winkler. 168-179
- On the problem of Beha Eddin Amuli and the computation of height functionsHorst Günter Zimmer. 180-193
- A procedure for determining algebraic integers of given normU. Fincke, Michael Pohst. 194-202
- Computation of integral solutions of a special type of systems of quadratic equationsMichael Pohst. 203-213
- Factorization of sparse polynominalsJames H. Davenport. 214-224
- Early detection of true factors in univariate polynominal factorizationPaul S. Wang. 225-235
- On the complexity of finding short vectors in integer latticesErich Kaltofen. 236-244
- Factoring polynominals over algebraic number fieldsArjen K. Lenstra. 245-254
- The construction of a complete minimal set of contextual normal formsMonique Rice. 255-266
- A knowledge-based approach to user-friendliness in symbolic computingFrancesco Gardin, John A. Campbell. 267-274
- Computer algebra and VLSI, prospects for cross fertilizationJ. Smit. 275-285
- Code optimization of multivariate polynominal schemes: A pragmatic approachJ. A. van Hulzen. 286-300