Bruce W. Char, editor, SYMSAC 1986, Proceedings of the Symposium on Symbolic and Algebraic Manipulation, Waterloo, Ontario, Canada, July 21-23, 1986. ACM, 1986. [doi]

Conference: issac1986

Abstract is missing.

- Iris: design of an user interface program for symbolic algebra1-6 [doi]
- MathScribe: a user interface for computer algebra systems7-12 [doi]
- PowerMath: a system for the Macintosh13-15 [doi]
- Applications of a software interconnection system in mathematical problem solving environments16-23 [doi]
- An object-oriented approach to algebra system design24-30 [doi]
- Construction of rational approximations by means of REDUCE31-33 [doi]
- Alkahest III: automatic analysis of periodic weakly nonlinear ODEs34-38 [doi]
- Investigating the structure of a Lie algebra39-44 [doi]
- Code generation for hybrid mixed mode formulation in finite element analysis45-52 [doi]
- Algebraic decomposition of regular curves53-55 [doi]
- How to compute multivariate Pade approximants56-58 [doi]
- Divide-and-conquer in computational group theory59-64 [doi]
- Fast parallel algorithms for similarity of matrices65-70 [doi]
- Limitations to algorithm solvability: Galois methods and models of computation71-76 [doi]
- Summation of binomial coefficients using hypergeometric functions77-81 [doi]
- A fast carry-free algorithm and hardware design for extended integer GCD computation82-84 [doi]
- Symbolic algorithms for Lie algebra computation85-87 [doi]
- There is no "Uspensky's method."88-90 [doi]
- Usage of REDUCE for computations of group-theoretical weight of Feynman diagrams in non-Abelian gauge theories91-93 [doi]
- A numerical code generation facility for REDUCE94-99 [doi]
- Enlarging the REDUCE domain of computation100-106 [doi]
- Dialogue in REDUCE: experience and development107-109 [doi]
- A sparse distributed representation using prime numbers110-114 [doi]
- Simplification of algebraic expression by multiterm rewriting rules115-120 [doi]
- Constructive solid geometry: a symbolic computation approach121-126 [doi]
- New results for random determination of equivalence of expressions127-131 [doi]
- A semantic matcher for computer algebra132-134 [doi]
- Computer algebra in the undergraduate mathematics classroom135-140 [doi]
- An application of knowledge-base technology in education: a geometry theorem prover141-147 [doi]
- Computer understanding and generalization of symbolic mathematical calculations: a case study in physics problem solving148-153 [doi]
- Edusym - educational symbolic manipulator on a microcomputer154-156 [doi]
- The design of Macaulay: a system for computing in algebraic geometry and commutative algebra157-162 [doi]
- Conform: a conformal mapping system163-168 [doi]
- A system for manipulating polynomials given by straight-line programs169-175 [doi]
- The computer algebra system CAS1 for the IBM-PC176-178 [doi]
- Integration of Liouvillian functions with special functions179-184 [doi]
- Numerical integration in a symbolic context185-191 [doi]
- Formal solutions of linear difference equations: method of Pincherle-Ramis192-196 [doi]
- Algorithm for computing formal invariants of linear differential systems197-201 [doi]
- Geometry theorem proving using Hilbert's Nullstellensatz202-208 [doi]
- Automated geometry theorem proving using Buchberger's algorithm209-214 [doi]
- Critical-pair criteria for the Knuth-Bendix completion procedure215-217 [doi]
- Buchberger's algorithm and staggered linear bases218-221 [doi]
- The Grobner basis of a module over KUX1, ..., Xne and polynomial solutions of a system of linear equations222-224 [doi]
- Grobner bases of ideals of convergent power series225-227 [doi]
- A fast implementation of polynomial factorization228-232 [doi]
- On implementing Buchberger's algorithm for Grobner bases233-238 [doi]
- An implementation of operators for symbolic algebra systems239-243 [doi]
- An operator algebra for Macsyma244-246 [doi]
- Gsolve: a faster algorithm for solving systems of algebraic equations247-249 [doi]
- The Bath algebraic number package250-253 [doi]