


default search action
Journal of Symbolic Computation, Volume 19, 1995
Volume 19, Number 1-3, January/February/March 1995
- Bo Yi, Jiafu Xu:

Analogical Type Theory. 3-24 - Andreas Weber

:
On Coherence in Computer Algebra. 25-38 - Paolo Di Blasio, Marco Temperini

:
Subtyping Inheritance and Its Application in Languages for Symbolic Computation Systems. 39-63 - Anthony C. Hearn, Eberhard Schrüfer:

A Computer Algebra System Based on Ordersorted Algebra. 65-77 - Philip S. Santas:

A Type System for Computer Algebra. 79-109 - Hoon Hong

, Andreas Neubacher, Wolfgang Schreiner
:
The Design of the SACLIB/PACLIB Kernels. 111-132 - A. C. Norman:

Compact Delivery Support for REDUCE. 133-132 - Tudor Jebelean

:
A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers. 145-157 - Robert Fournier, Norbert Kajler, Bernard Mourrain:

Visualization of Mathematical Surfaces: The IZIC Server Approach. 159-173 - Gianna Cioni, Attilio Colagrossi, Alfonso Miola:

A Sequent Calculus for Automated Reasoning in Symbolic Computation Systems. 175-199 - William M. Farmer, Joshua D. Guttman

, F. Javier Thayer:
Context in Mathematical Reasoning and Computation. 210-206 - Ricardo Caferra, Michel Herment:

A Generic Graphic Framework for Combining Inference Tools and Editing Proofs and Formulae. 217-243 - Maria Paola Bonacina

, Jieh Hsiang:
Distributed Deduction by Clause-Diffusion: Distributed Contraction and the Aquarius Prover. 245-267 - Angel Díaz, Markus A. Hitz, Erich L. Kaltofen

, Austin Lobo, Thomas Valente:
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. 269-282
Volume 19, Number 4, April 1995
- Manfred Göbel:

Computing Bases for Rings of Permutation-Invariant Polynomials. 285-291 - D. E. G. Malm, T. N. Subramaniam:

The Summation of Rational Functions by an Extended Gosper Algorithm. 293-304 - Alain Poli:

A Deterministic Constructin of Normal Bases With Complexity O(n³+n log n log(log n) log q). 305-319 - Robert Nieuwenhuis

, Albert Rubio:
Theorem Proving with Ordering and Equality Constrained Clauses. 321-351 - Matthias Baaz

, Christian G. Fermüller:
Resolution-Based Theorem Proving for Manyvalued Logics. 353-391
Volume 19, Number 5, May 1995
- Hong R. Lee, B. David Saunders:

Fraction Free Gaussian Elimination for Sparse Matrices. 393-402 - Alexey Zharkov:

Coefficient Fields of Solutions in Kovacic's Algorithm. 403-408 - Joachim von zur Gathen, Jürgen Weiss:

Homogeneous Bivariate Decompositions. 409-434 - Ilaria Del Corso

:
Factorization of Prime Ideal Extensions in Dedekind Domains. 435-439 - Joachim Apel

:
A Gröbner Approach to Involutive Bases. 441-457 - S. Carmody, M. Leeming, Robert F. C. Walters:

The Todd-Coxeter Procedure and Left Kan Extensions. 459-488 - Jaroslav Jezek, George F. McNulty:

Perfect Bases for Equational Theories. 489-505
Volume 19, Number 6, June 1995
- Miguel Filgueiras, Ana Paula Tomás

:
A Fast Method for Finding the Basis of Nonnegative Solutions to a Linear Diophantine Equation. 507-526 - Cesar Alonso, Jaime Gutierrez

, Tomás Recio
:
A Rational Function Decomposition Algorithm by Near-Separated Polynomials. 527-544 - Hans-Gert Gräbe

:
Algorithms in Local Algebra. 545-557 - Peter A. Hendriks, Marius van der Put:

Galois Action on Solutions of a Differential Equation. 559-576 - Scott H. Murray

, E. A. O'Brien:
Selecting Base Points for the Schreier-Sims Algorithm for Matrix Groups. 577-584 - Gerhard Hiss, Klaus Lux, Jürgen Müller:

The 2-Modular Decomposition Matrices of the Non-Principal Blocks of Maximal Defect of the Triple Cover of the Sporadic Simple McLaughlin Group. 585-600 - Stefan Kahrs:

Confluence of Curried Term-Rewriting Systems. 601-623

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














