default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSYMSAC 1986: Waterloo, Ontario, Canada
- Bruce W. Char:
Proceedings of the Symposium on Symbolic and Algebraic Manipulation, SYMSAC 1986, Waterloo, Ontario, Canada, July 21-23, 1986. ACM 1986, ISBN 0-89791-199-7 - Benton L. Leong:
Iris: design of an user interface program for symbolic algebra. 1-6 - Carolyn J. Smith, Neil Soiffer:
MathScribe: a user interface for computer algebra systems. 7-12 - James H. Davenport, C. E. Roth:
PowerMath: a system for the Macintosh. 13-15 - James M. Purtilo:
Applications of a software interconnection system in mathematical problem solving environments. 16-23 - S. Kamal Abdali, Guy W. Cherry, Neil Soiffer:
An object-oriented approach to algebra system design. 24-30 - Alexander P. Kryukov, A. Ya. Rodionov, Grigori L. Litvinov:
Construction of rational approximations by means of REDUCE. 31-33 - John P. Fitch, A. C. Norman, M. A. Moore:
Alkahest III: automatic analysis of periodic weakly nonlinear ODEs. 34-38 - D. W. Rand, P. Winternitz
:
Investigating the structure of a Lie algebra. 39-44 - Paul S. Wang, Hui-Qian Tan, Atef F. Saleeb, Tse-Yung P. Chang:
Code generation for hybrid mixed mode formulation in finite element analysis. 45-52 - Stefan Arnborg, Huichun Feng:
Algebraic decomposition of regular curves. 53-55 - Claudine Chaffy:
How to compute multivariate Pade approximants. 56-58 - Greg Butler:
Divide-and-conquer in computational group theory. 59-64 - Erich L. Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders:
Fast parallel algorithms for similarity of matrices. 65-70 - Chanderjit L. Bajaj:
Limitations to algorithm solvability: Galois methods and models of computation. 71-76 - Michael B. Hayden, Edmund A. Lamagna:
Summation of binomial coefficients using hypergeometric functions. 77-81 - David Y. Y. Yun, Chang Nian Zhang:
A fast carry-free algorithm and hardware design for extended integer GCD computation. 82-84 - Robert E. Beck, Bernard Kolman:
Symbolic algorithms for Lie algebra computation. 85-87 - Alkiviadis G. Akritas:
There is no "Uspensky's method.". 88-90 - Alexander P. Kryukov, A. Ya. Rodionov:
Usage of REDUCE for computations of group-theoretical weight of Feynman diagrams in non-Abelian gauge theories. 91-93 - Barbara L. Gates:
A numerical code generation facility for REDUCE. 94-99 - Russell J. Bradford, Anthony C. Hearn, Julian A. Padget, Eberhard Schrüfer:
Enlarging the REDUCE domain of computation. 100-106 - Alexander P. Kryukov:
Dialogue in REDUCE: experience and development. 107-109 - C. P. Mawata:
A sparse distributed representation using prime numbers. 110-114 - Tateaki Sasaki:
Simplification of algebraic expression by multiterm rewriting rules. 115-120 - Laurence L. Leff, David Y. Y. Yun:
Constructive solid geometry: a symbolic computation approach. 121-126 - Gaston H. Gonnet:
New results for random determination of equivalence of expressions. 127-131 - Gene Cooperman:
A semantic matcher for computer algebra. 132-134 - Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet, Beverly J. Marshman, Peter J. Ponzo:
Computer algebra in the undergraduate mathematics classroom. 135-140 - Mirsad Hadzikadic, Franz Lichtenberger, David Y. Y. Yun:
An application of knowledge-base technology in education: a geometry theorem prover. 141-147 - Jude W. Shavlik, Gerald DeJong:
Computer understanding and generalization of symbolic mathematical calculations: a case study in physics problem solving. 148-153 - Neven Jurkovic:
Edusym - educational symbolic manipulator on a microcomputer. 154-156 - David Bayer, Michael Eugene Stillman:
The design of Macaulay: a system for computing in algebraic geometry and commutative algebra. 157-162 - Harlan R. Seymour:
Conform: a conformal mapping system. 163-168 - Timothy S. Freeman, Gregory M. Imirzian, Erich L. Kaltofen:
A system for manipulating polynomials given by straight-line programs. 169-175 - Z. Renbao, X. Ling, R. Zhaoyang:
The computer algebra system CAS1 for the IBM-PC. 176-178 - Paul H. Knowles:
Integration of Liouvillian functions with special functions. 179-184 - Keith O. Geddes:
Numerical integration in a symbolic context. 185-191 - Jean Della Dora, Evelyne Tournier:
Formal solutions of linear difference equations: method of Pincherle-Ramis. 192-196 - Abdelaziz Hilali, A. Wazner:
Algorithm for computing formal invariants of linear differential systems. 197-201 - Deepak Kapur:
Geometry theorem proving using Hilbert's Nullstellensatz. 202-208 - B. Kutzler, Sabine Stifter:
Automated geometry theorem proving using Buchberger's algorithm. 209-214 - Leo Bachmair, Nachum Dershowitz:
Critical-pair criteria for the Knuth-Bendix completion procedure. 215-217 - Rüdiger Gebauer, H. Michael Möller:
Buchberger's algorithm and staggered linear bases. 218-221 - A. Furukawa, T. Sasaki, H. Kobayashi:
The Gröbner basis of a module over KUX1, ..., Xne and polynomial solutions of a system of linear equations. 222-224 - H. Kobayashi, A. Furukawa, T. Sasaki:
Gröbner bases of ideals of convergent power series. 225-227 - Michael Lucks:
A fast implementation of polynomial factorization. 228-232 - Stephen R. Czapor, Keith O. Geddes:
On implementing Buchberger's algorithm for Grobner bases. 233-238 - Gaston H. Gonnet:
An implementation of operators for symbolic algebra systems. 239-243 - J. P. Golden:
An operator algebra for Macsyma. 244-246 - Manuel Bronstein:
Gsolve: a faster algorithm for solving systems of algebraic equations. 247-249 - John A. Abbott, Russell J. Bradford, James H. Davenport:
The Bath algebraic number package. 250-253
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
