Journal of Symbolic Computation, Volume 2, 1986

Volume 2, Number 1, March 1986

Jerald J. Kovacic: An Algorithm for Solving Second Order Linear Homogeneous Differential Equations. 3-43
M. D. Atkinson, R. A. Hassan: On the Computation of Group Characters. 45-50
Michael C. Slattery: Computing Character Degrees in p-Groups. 51-58
Ana Pasztor: Non-Standard Algorithmic and Dynamic Logic. 59-81
W. Böge, Rüdiger Gebauer, Heinz Kredel: Some Examples for Solving Systems of Algebraic Equations by Calculating Groebner Bases. 83-98
Chandrajit L. Bajaj: Proving Geometric Algorithm Non-Solvability: An Application of Factoring Polynomials. 99-102
Stanley J. Watowich, Jeffery L. Krause, R. Stephen Berry: Stability Analysis of an Optimally Controlled Light-Driven Engine. 103-108

Jürgen Avenhaus: On the Descriptive Power of Term Rewriting Systems. 109-122
Ulrich Furbach, Steffen Hölldobler: Modelling the Combination of Functional and Logic Programming Languages. 123-138
Lorenzo Robbiano: On the Theory of Graded Structures. 139-170
Herbert Edelsbrunner, Roman Waupotitsch: Computing a Ham-Sandwich Cut in Two Dimensions. 171-178
Bruce W. Char, Gregory J. Fee, Keith O. Geddes, Gaston H. Gonnet, Michael B. Monagan: A Tutorial Introduction to Maple. 179-200
Anthony Duncan, Ralph Roskies: Representations of Unusual Mathematical Structures in Scientific Applications of Symbolic Computation. 201-206
Carl Trindle: Application of the MuMATH(R) Symbol Manipulation System to Chemically Significant Permutation Groups. 207-21
Stanly Steinberg, Patrick J. Roache: Using MACSYMA to Write FORTRAN Subroutines. 213-216

B. F. Caviness: Computer Algebra: Past and Future. 217-236
James H. Davenport: Elementary and Liouvillian Solutions of Linear Differential Equations. 237-260
Heinrich Rolletschek: On the Number of Divisions of the Euclidean Algorithm Applied to Gaussian Integers. 261-291
David A. Plaisted, Steven Greenbaum: A Structure-Preserving Clause Form Translation. 293-304
Paul S. Wang: FINGER: A Symbolic System for Automatic Generation of Numerical Programs in Finite Element Analysis. 305-316

Ronald V. Book, Jörg H. Siekmann: On Unification: Equational Theories Are Not Bounded. 317-324
Lawrence C. Paulson: Constructing Recursion Operators in Intuitionistic Type Theory. 325-355
Murray R. Bremner: Fast Computation of Weight Multiplicities. 357-362
Philippe le Chenadec: A Catalogue of Complete Group Presentations. 363-381
Dieter Armbruster, Heinz Kredel: Constructing Universal Unfoldings Using Gröbner Bases. 383-388
B. Kutzler, Sabine Stifter: On the Application of Buchberger's Algorithm to Automated Geometry Theorem Proving. 389-397
Deepak Kapur: Using Gröbner Bases to Reason About Geometry Problems. 399-408