default search action
ISSAC 1989: Portland, Oregon, USA
- Gaston H. Gonnet:
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, ISSAC '89, Portland, Oregon, USA, July 17-19, 1989. ACM 1989, ISBN 0-89791-325-6 - Moulay A. Barkatou:
On the Reduction of Linear Systems of Difference Equations. 1-6 - J. Shackle:
A Differential-Equations Approach to Functional Equivalence. 7-10 - Richard J. Fateman:
Series Solutions of Algebraic and Differential Equations: A Comparison of Linear and Quadratic Algebraic Convergence. 11-16 - Fritz Schwarz:
A Factorization Algorithm for Linear Ordinary Differential Equations. 17-25 - Erich L. Kaltofen, Thomas Valente, Norika Yui:
An Improved Las Vegas Primality Test. 26-33 - Victor Y. Pan:
On Some Computations with Dense Structured Matrices. 34-42 - François Ollivier:
Inversibility of Rational Mappings and Structural Identifiability in Automatics. 43-54 - Franz Winkler:
Knuth-Bendix Procedure and Buchberger Algorithm: A Synthesis. 55-67 - Richard J. Fateman:
Lookup Tables, Recurrences and Complexity. 68-73 - Robert L. Grossman, Richard G. Larson:
Labeled Trees and the Efficient Computation of Derivations. 74-80 - Chandrajit L. Bajaj, John F. Canny, R. Garrity, Joe D. Warren:
Factoring Rational Polynomials over the Complexes. 81-90 - Trevor J. Smedley:
A new Modular Algorithm for Computation of Algebraic Number Polynomial Gcds. 91-94 - Stanley Cabay, George Labahn:
A Fast, Reliable Algorithm for Calculating Padé-Hermite Forms. 95-100 - Maria Emilia Alonso, Teo Mora, Mario Raimondo:
Computing with Algebraic Series. 101-111 - John Abbott:
Recovery of Algebraic Numbers from Their p-adic Approximations. 112-120 - John F. Canny, Erich L. Kaltofen, Yagati N. Lakshman:
Solving Systems of Nonlinear Polynomial Equations Faster. 121-128 - Russell J. Bradford:
Some Results on the Defect. 129-135 - Laureano González, Henri Lombardi, Tomás Recio, Marie-Françoise Roy:
Sturm-Habicht Sequence. 136-146 - James M. Purtilo:
MINION: An Environment to Organize Mathematical Problem Solving. 147-154 - John P. Fitch:
Can REDUCE be Run in Parallel? 155-162 - J. A. van Hulzen, Ben J. A. Hulshof, Barbara L. Gates, M. C. van Heerwaarden:
A Code Optimization Package for REDUCE. 163 - T. H. Einwohner, Richard J. Fateman:
A MACSYMA Package for the Generation and Manipulation of Chebyshev Series. 180-185 - Sanjiva Weerawarana, Paul S. Wang:
GENCRAY: A Portable Code Generator for Cray Fortran. 186-191 - Carlo Traverso, L. Donati:
Experimenting the Gröbner Basis Algorithm with the A1PI System. 192-198 - B. R. Miller:
A Program Generator for Efficient Evaluation of Fourier Series. 199-206 - Manuel Bronstein:
Simplification of Real Elementary Functions. 207-211 - Keith O. Geddes, L. Yohanes Stefanus:
On the Risch-Norman Integration Method and Its Implementation in MAPLE. 212-217 - R. A. Ravenscroft Jr., Edmund A. Lamagna:
Symbolic Summation with Generating Functions. 228-233 - Bruce W. Char:
Automatic Reasoning about Numerical Stability of Rational Expressions. 234-241 - Guoting Chen:
Computing the Normal Forms of Matrices Depending on Parameters. 242-249 - Marc Giusti:
On the Castelnuovo Regularity for Curves. 250-253 - B. Kutzler:
Careful Algebraic Translations of Geometry Theorems. 254-263 - George E. Collins, Jeremy R. Johnson:
Quantifier Elimination and the Sign Variation Method for Real Root Isolation. 264-271 - S. Rabinowitz:
On the Computer Solution of Symmetric Homogeneous Triangle Inequalities. 272-286 - S. C. Porter:
Dense Representation of Affine Coordinate Rings of Curves with One Point at Infinity. 287-297 - B. David Saunders, Hong R. Lee, S. Kamal Abdali:
A Parallel Implementation of the Cylindrical Algebraic Decomposition Algorithm. 298-307 - André Deprit, Etienne Deprit:
Massively Parallel Symbolic Computation. 308-316 - Françoise Siebert-Roch:
Parallel Algorithms for Hermite Normal Form of an Integer Matrix. 317-321 - Jürgen Avenhaus, Dieter Wissmann:
Using Rewriting Techniques to Solve the Generalized Word Problem in Polycyclic Groups. 322-337 - Norbert Kuhn, Klaus Madlener:
A Method for Enumerating Cosets of a Group Presented by a Canonical System. 338-350 - Gene Cooperman, Larry Finkelstein, Eugene M. Luks:
Reduction of Group Constructions to Point Stabilizers. 351-356 - Mitsuhiro Okada:
Strong Normalizability for the Combined System of the Typed lambda Calculus and an Arbitrary Convergent Term Rewrite System. 357-363 - Peter W. O'Hearn, Zbigniew Stachniak:
Note on Theorem Proving Strategies for Resolution Counterparts of Non-Classical Logics. 364-372 - Neil V. Murray, Erik Rosenthal:
Employing Path Dissolution to Shorten Tableaux Proofs. 373-381 - Claude Kirchner, Hélène Kirchner:
Constrained Equational Reasoning. 382-389 - Annick Valibouze:
Resolvents and Symmetric Functions. 390-399
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.