Table of Contents

• Iris: design of an user interface program for symbolic algebraBenton L. Leong. 1-6 [doi]
• MathScribe: a user interface for computer algebra systemsC. J. Smith, Neil Soiffer. 7-12 [doi]
• PowerMath: a system for the MacintoshJames H. Davenport, C. E. Roth. 13-15 [doi]
• Applications of a software interconnection system in mathematical problem solving environmentsJames M. Purtilo. 16-23 [doi]
• An object-oriented approach to algebra system designS. Kamal Abdali, Guy W. Cherry, Neil Soiffer. 24-30 [doi]
• Construction of rational approximations by means of REDUCEA. P. Kryukov, A. Ya. Rodionov, Grigori L. Litvinov. 31-33 [doi]
• Alkahest III: automatic analysis of periodic weakly nonlinear ODEsJohn Fitch, A. C. Norman, M. A. Moore. 34-38 [doi]
• Investigating the structure of a Lie algebraD. W. Rand, P. Winternitz. 39-44 [doi]
• Code generation for hybrid mixed mode formulation in finite element analysisPaul S. Wang, Hui-Qian Tan, Atef F. Saleeb, Tse-Yung P. Chang. 45-52 [doi]
• Algebraic decomposition of regular curvesStefan Arnborg, Huichun Feng. 53-55 [doi]
• How to compute multivariate Pade approximantsClaudine Chaffy. 56-58 [doi]
• Divide-and-conquer in computational group theoryGreg Butler. 59-64 [doi]
• Fast parallel algorithms for similarity of matricesErich Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders. 65-70 [doi]
• Limitations to algorithm solvability: Galois methods and models of computationChanderjit Bajaj. 71-76 [doi]
• Summation of binomial coefficients using hypergeometric functionsMichael B. Hayden, Edmund A. Lamagna. 77-81 [doi]
• A fast carry-free algorithm and hardware design for extended integer GCD computationDavid Y. Y. Yun, Chang-Nian Zhang. 82-84 [doi]
• Symbolic algorithms for Lie algebra computationRobert E. Beck, Bernard Kolman. 85-87 [doi]
• There is no "Uspensky's method."Alkiviadis G. Akritas. 88-90 [doi]
• Usage of REDUCE for computations of group-theoretical weight of Feynman diagrams in non-Abelian gauge theoriesA. P. Kryukov, A. Ya. Rodionov. 91-93 [doi]
• A numerical code generation facility for REDUCEBarbara L. Gates. 94-99 [doi]
• Enlarging the REDUCE domain of computationRussell J. Bradford, Anthony C. Hearn, Julian A. Padget, Eberhard Schrüfer. 100-106 [doi]
• Dialogue in REDUCE: experience and developmentA. P. Kryukov. 107-109 [doi]
• A sparse distributed representation using prime numbersC. P. Mawata. 110-114 [doi]
• Simplification of algebraic expression by multiterm rewriting rulesTateaki Sasaki. 115-120 [doi]
• Constructive solid geometry: a symbolic computation approachLaurence L. Leff, David Y. Y. Yun. 121-126 [doi]
• New results for random determination of equivalence of expressionsGaston H. Gonnet. 127-131 [doi]
• A semantic matcher for computer algebraGene Cooperman. 132-134 [doi]
• Computer algebra in the undergraduate mathematics classroomBruce W. Char, Keith O. Geddes, Gaston H. Gonnet, B. J. Marshman, P. J. Ponzo. 135-140 [doi]
• An application of knowledge-base technology in education: a geometry theorem proverMirsad Hadzikadic, Franz Lichtenberger, David Y. Y. Yun. 141-147 [doi]
• Computer understanding and generalization of symbolic mathematical calculations: a case study in physics problem solvingJude W. Shavlik, Gerald DeJong. 148-153 [doi]
• Edusym - educational symbolic manipulator on a microcomputerNeven Jurkovic. 154-156 [doi]
• The design of Macaulay: a system for computing in algebraic geometry and commutative algebraDavid Bayer, Michael Stillman. 157-162 [doi]
• Conform: a conformal mapping systemHarlan R. Seymour. 163-168 [doi]
• A system for manipulating polynomials given by straight-line programsTimothy S. Freeman, Gregory M. Imirzian, Erich Kaltofen. 169-175 [doi]
• The computer algebra system CAS1 for the IBM-PCZ. Renbao, X. Ling, R. Zhaoyang. 176-178 [doi]
• Integration of Liouvillian functions with special functionsPaul H. Knowles. 179-184 [doi]
• Numerical integration in a symbolic contextKeith O. Geddes. 185-191 [doi]
• Formal solutions of linear difference equations: method of Pincherle-RamisJean Della Dora, Evelyne Tournier. 192-196 [doi]
• Algorithm for computing formal invariants of linear differential systemsA. Hilali, A. Wazner. 197-201 [doi]
• Geometry theorem proving using Hilbert's NullstellensatzDeepak Kapur. 202-208 [doi]
• Automated geometry theorem proving using Buchberger's algorithmB. Kutzler, Sabine Stifter. 209-214 [doi]
• Critical-pair criteria for the Knuth-Bendix completion procedureLeo Bachmair, Nachum Dershowitz. 215-217 [doi]
• Buchberger's algorithm and staggered linear basesRüdiger Gebauer, H. Michael Möller. 218-221 [doi]
• The Grobner basis of a module over KUX1, ..., Xne and polynomial solutions of a system of linear equationsA. Furukawa, T. Sasaki, H. Kobayashi. 222-224 [doi]
• Grobner bases of ideals of convergent power seriesH. Kobayashi, A. Furukawa, T. Sasaki. 225-227 [doi]
• A fast implementation of polynomial factorizationMichael Lucks. 228-232 [doi]
• On implementing Buchberger's algorithm for Grobner basesStephen R. Czapor, Keith O. Geddes. 233-238 [doi]
• An implementation of operators for symbolic algebra systemsGaston H. Gonnet. 239-243 [doi]
• An operator algebra for MacsymaJ. P. Golden. 244-246 [doi]
• Gsolve: a faster algorithm for solving systems of algebraic equationsManuel Bronstein. 247-249 [doi]
• The Bath algebraic number packageJ. A. Abbott, Russell J. Bradford, James H. Davenport. 250-253 [doi]