EUROSAM 1984: Cambridge, England, UK

@proceedings{DBLP:conf/eurosam/1984,
  editor    = {John Fitch},
  title     = {EUROSAM 84, International Symposium on Symbolic and Algebraic
               Computation, Cambridge, England, July 9-11, 1984, Proceedings},
  booktitle = {EUROSAM},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {174},
  year      = {1984},
  isbn      = {3-540-13350-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Differential Equations

• Jean Della Dora, Evelyne Tournier: Homogeneous Linear Difference Equation (Frobenius - Boole Method). 2-12
• Shunro Watanbe: An Experiment Toward a General Quadrature for Second Order Linear Ordinary Differential Equations by Symbolic Computation. 13-22
• Nikolaos Glinos, B. David Saunders: Operational Calculus Technique for Solving Differential Equations. 23-34

Applications 1

• G. Cesareo, R. Marino: On the Application of Symbolic Computation to Nonlinear Control Theory. 35-46
• Jan E. Åman, R. A. d'Inverno, G. C. Joly, Malcolm A. H. MacCallum: Quartic Equations and Algorithms for Riemann Tensor Classification. 47-58
• Ralph W. Wilkerson: Symbolic Computation and the Dirichlet Problem. 59-63

Simplification and Algorithm Implementations

• Guy Viry: Simplification of Polynomials in n Variables. 64-73
• Marisa Navarro, Fernando Orejas: On the Equivalence of Hierarchical and Non-Hierarchical Rewriting on Conditional Term Rewriting Systems. 74-85
• Paul S. Wang: Implementation of a p-adic Package for Polynomial Factorization and Other Related Operations. 86-99

Algebraic Number Computation

• Claire Dicrescenzo, Dominique Duval: Computations on Curves. 100-107
• Thomas G. Berry: Detecting Torsion Divisors on Curves of Genus 2. 108-114
• H. Najid-Zejli: Computation in Radical Extensions. 115-122

Languages for Symbolic Computing

• Richard D. Jenks: A Primer: 11 Keys to New Scratchpad. 123-147
• John Fitch, Julian A. Padget: A Pure and Really Simple Initial Functional Algebraic Language. 148-158

Groebner Basis Algorithms

• Marc Giusti: Some Effectivity Problems in Polynomial Ideal Theory. 159-171
• H. Michael Möller, Ferdinando Mora: Upper and Lower Bounds for the Degree of Groebner Bases. 172-183
• Franz Winkler: On the Complexity of the Groebner-Bases Algorithm over K[x, y, z]. 184-194
• Abdelilah Kandri-Rody, Deepak Kapur: Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings. 195-206

Computational Group Theory

• Robert H. Gilman: Computations with Rational Subsets of Confluent Groups. 207-212
• Jeffrey S. Leon: CAMAC2: A Portable System for Combinatorial and Algebraic Computation. 213-224
• Susan Landau: Polynomial Time Algorithms for Galois Groups. 225-236

Applications 2

• Paul S. Wang, T. Y. P. Chang, J. A. van Hulzen: Code Generation and Optimization for Finite Element Analysis. 237-247
• Stephen R. Czapor, Keith O. Geddes: A Comparison of Algorithms for the Symbolic Computation of Padé Approximants. 248-259
• Ben J. A. Hulshof, J. A. van Hulzen: Automatic Error Cumulation Control. 260-271

Factorization and GCD Computations

• Arjen K. Lenstra: Polynomial Factorization by Root Approximation. 272-276
• Erich Kaltofen: Effective Hilbert Irreducibility. 277-284
• Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet: GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation. 285-296
• Denis Lugiez: A New Lifting Process for the Multivariate Polynomial Factorization. 297-309

Number Theory Algorithms

• Erich Kaltofen, Noriko Yui: Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields with Class Numbers 7 and 11. 310-320
• Ming-Deh A. Huang: On a Simple Primality Testing Algorithm. 321-332
• Johannes Buchmann: A Criterion for the Equivalence of Two Ideals. 333-340

Integration

• James H. Davenport: y'+ fy = g. 341-350
• Guy W. Cherry, B. F. Caviness: Integration in Finite Terms with Special Functions: A Progress Report. 351-358
• Erich Kaltofen: A Note on the Risch Differential Equation. 359-366

Solution of Equations

• Klaus Thull: Approximation by Continued Fraction of a Polynomial Real Root. 367-377
• Maurice Mignotte: On the Automatic Resolution of Certain Diophantine Equations. 378-385
• Michael Rothstein: On Pseudo-Resultante. 386-396