@proceedings{DBLP:conf/eurocal/1983, editor = {J. A. van Hulzen}, title = {Computer Algebra, EUROCAL '83, European Computer Algebra Conference, London, England, March 28-30, 1983, Proceedings}, booktitle = {EUROCAL}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {162}, year = {1983}, isbn = {3-540-12868-9}, bibsource = {DBLP, http://dblp.uni-trier.de} }

- James H. Davenport: Integration - What do we want from the theory? 2-11 BibTeX
- Heinrich Rolletschek: The Euclidean algorithm for Gaussian integers. 12-23 BibTeX
- Akio Furukawa, Tateaki Sasaki: Multi polynominal remainder sequence and its application to linear diophantine equations. 24-35 BibTeX

- Dennis S. Arnon, Scott F. Smith: Towards mechanical solution of the Kahan Ellipse Problem 1. 36-44 BibTeX
- Fritz Schwarz: Automatically determining symmetries of ordinary differential equations. 45-54 BibTeX
- F. Lamnabhi-Lagarrigue, M. Lamnabhi: Algebraic computation of the statistics of the solution of some nonlinear stochastic differential equations. 55-67 BibTeX
- Aziz Hilali: Characterization of a linear differential system with a regular singularity. 68-77 BibTeX

- Jed Marti, John Fitch: The Bath concurrent LISP machine. 78-90 BibTeX
- Julian A. Padget: The ecology of LISP or the case for the preservation of the environment. 91-100 BibTeX
- Bruce W. Char, Keith O. Geddes, W. Morven Gentleman, Gaston H. Gonnet: The design of maple: A compact, portable and powerful computer algebra system. 101-115 BibTeX
- Herbert Stoyan: LISP compilation viewed as provable semantics preserving program transformation. 116-127 BibTeX
- John Fitch: Implementing REDUCE on a micro-computer. 128-136 BibTeX

- Bruno Buchberger: A note on the complexity of constructing Gröbner-Bases. 137-145 BibTeX
- Daniel Lazard: Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations. 146-156 BibTeX
- Ferdinando Mora, H. Michael Möller: The computation of the Hilbert function. 157-167 BibTeX
- Franz Winkler: An algorithm for constructing detaching bases in the ring of polynominals over a field. 168-179 BibTeX

- Horst Günter Zimmer: On the problem of Beha Eddin Amuli and the computation of height functions. 180-193 BibTeX
- U. Fincke, Michael Pohst: A procedure for determining algebraic integers of given norm. 194-202 BibTeX
- Michael Pohst: Computation of integral solutions of a special type of systems of quadratic equations. 203-213 BibTeX

- James H. Davenport: Factorization of sparse polynominals. 214-224 BibTeX
- Paul S. Wang: Early detection of true factors in univariate polynominal factorization. 225-235 BibTeX
- Erich Kaltofen: On the complexity of finding short vectors in integer lattices. 236-244 BibTeX
- Arjen K. Lenstra: Factoring polynominals over algebraic number fields. 245-254 BibTeX

- Monique Rice: The construction of a complete minimal set of contextual normal forms. 255-266 BibTeX
- Francesco Gardin, John A. Campbell: A knowledge-based approach to user-friendliness in symbolic computing. 267-274 BibTeX
- J. Smit: Computer algebra and VLSI, prospects for cross fertilization. 275-285 BibTeX
- J. A. van Hulzen: Code optimization of multivariate polynominal schemes: A pragmatic approach. 286-300 BibTeX