EUROCAL 1983, London, England, UK

J. A. van Hulzen (Ed.): Computer Algebra, EUROCAL '83, European Computer Algebra Conference, London, England, March 28-30, 1983, Proceedings. Lecture Notes in Computer Science 162 Springer 1983, ISBN 3-540-12868-9

@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}
}

Algorithms 1 - Miscellaneous

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

Applications - Miscellaneous

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

Systems and Language Features

Jed Marti, John Fitch: The Bath concurrent LISP machine. 78-90
Julian A. Padget: The ecology of LISP or the case for the preservation of the environment. 91-100
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
Herbert Stoyan: LISP compilation viewed as provable semantics preserving program transformation. 116-127
John Fitch: Implementing REDUCE on a micro-computer. 128-136

Algorithms 2 - Polynominal Ideal Bases

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

Algorithms 3 - Computational Number Theory

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

Algorithms 4 - Factorization

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

System Oriented Applications

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