Last update:
Fri Mar 23 10:03:33 MDT 2007
Editors Symbolic Computation (An Editorial) . . 1--6
Etienne Paul Equational Methods in First Order
Predicate Calculus . . . . . . . . . . . 7--29
Elmar Eder Properties of Substitutions and
Unifications . . . . . . . . . . . . . . 31--46
B. Chazelle and
H. Edelsbrunner Optimal Solutions for a Class of Point
Retrieval Problems . . . . . . . . . . . 47--56
Erich Kaltofen Fast Parallel Absolute Irreducibility
Testing . . . . . . . . . . . . . . . . 57--67
Richard Pavelle and
Paul S. Wang MACSYMA from ${F}$ to ${G}$ . . . . . . 69--100
V. P. Gerdt and
A. B. Shvachka and
A. Yu. Zharkov Computer algebra application for
classification of integrable non-linear
evolution equations . . . . . . . . . . 101--107
K. S. Kölbig Explicit Evaluation of Certain Definite
Integrals Involving Powers of Logarithms 109--114
W. Bibel and
K. Aspetsberger A Bibliography on Parallel Inference
Machines . . . . . . . . . . . . . . . . 115--118
A. W. Biermann Automatic Programming: A Tutorial on
Formal Methodologies . . . . . . . . . . 119--142
Gregory Butler Effective Computations with Group
Homomorphisms . . . . . . . . . . . . . 143--158 (or 143--157??)
David R. Barton and
Richard Zippel Polynomial Decomposition Algorithms . . 159--168
Allan Borodin and
Ronald Fagin and
John E. Hopcroft and
Martin Tompa Decreasing the Nesting Depth of
Expressions Involving Square Roots . . . 169--188
Richard Zippel Simplification of Expressions Involving
Radicals . . . . . . . . . . . . . . . . 189--210
John P. Fitch Solving algebraic problems with REDUCE 211--228 (or 211--227??)
Fritz Schwarz An Algorithm for Determining Polynomial
First Integrals of Autonomous Systems of
Ordinary Differential Equations . . . . 229--234 (or 229--233??)
Miguel Navarro-Saad and
Kurt Bernardo Wolf Applications of a Factorization Theorem
for Ninth-order Aberration Optics . . . 235--240 (or 235--239??)
D. Coppersmith and
J. H. Davenport An Application of Factoring . . . . . . 241--243
W. Bibel Automated Inferencing . . . . . . . . . 245--260
D. Lazard Ideal Bases and Primary Decomposition:
Case of Two Variables . . . . . . . . . 261--270
E. V. Krishnamurthy Symbolic Iterative Algorithm for
Generalized Inversion of Rational
Polynomial Matrices . . . . . . . . . . 271--282 (or 271--281??)
G. W. Cherry Integration in Finite Terms with Special
Functions: the Error Function . . . . . 283--302
Michael Karr Theory of Summation in Finite Terms . . 303--316 (or 303--315??)
Nicola Rizzi and
Amabile Tatone Using Symbolic Computation in Buckling
Analysis . . . . . . . . . . . . . . . . 317--322 (or 317--321??)
Thierry Coquand and
Gérard A. Huet A Selected Bibliography on Constructive
Mathematics, Intuitionistic Type Theory
and Higher Order Deduction . . . . . . . 323--328
Leo Bachmair and
David A. Plaisted Termination Ordering for Associative
Commutative Rewriting Systems . . . . . 329--350 (or 329--349??)
D. F. Holt The Mechanical Computation of First and
Second Cohomology Groups . . . . . . . . 351--362 (or 351--361??)
G. Butler and
C. W. H. Lam A General Backtrack Algorithm for the
Isomorphism Problem of Combinatorial
Objects . . . . . . . . . . . . . . . . 363--382 (or 363--381??)
Klaus Madlener and
Friedrich Otto Pseudonatural algorithms for the word
problem for finitely presented monoids
and groups . . . . . . . . . . . . . . . 383--418
Ph. Tombal and
A. Moussiaux MACSYMA computation of the
Dirac-Bergmann algorithm for Hamiltonian
systems with constraints . . . . . . . . 419--421
Jerald J. Kovacic An Algorithm for Solving Second Order
Linear Homogeneous Differential
Equations . . . . . . . . . . . . . . . 3--43
M. D. Atkinson and
R. A. Hassan On the Computation of Group Characters 45--50
Michael C. Slattery Computing character degrees in
$p$-groups . . . . . . . . . . . . . . . 51--58
Ana Pasztor Non-Standard Algorithmic and Dynamic
Logic . . . . . . . . . . . . . . . . . 59--81
W. Boege and
R. Gebauer and
H. Kredel Some Examples for Solving Systems of
Algebraic Equations by Calculating
Gröbner Bases . . . . . . . . . . . . . . 83--98
Chanderjit Bajaj Proving Geometric Algorithm
Non-Solvability: An Application of
Factoring Polynomials . . . . . . . . . 99--102
S. J. Watowich and
J. L. Krause and
R. S. Berry Stability Analysis of an Optimally
Controlled Light-Driven Engine . . . . . 103--108
Jürgen Avenhaus On the Descriptive Power of Term
Rewriting Systems . . . . . . . . . . . 109--122
U. Furbach and
S. Hölldobler Modelling the Combination of Functional
and Logic Programming Languages . . . . 123--138
Lorenzo Robbiano On the Theory of Graded Structures . . . 139--170
H. Edelsbrunner and
R. Waupotitsch Computing a Ham-Sandwich Cut in Two
Dimensions . . . . . . . . . . . . . . . 171--178
Bruce W. Char and
G. J. Fee and
Keith O. Geddes and
Gaston H. Gonnet and
Michael B. Monagan A Tutorial Introduction to Maple . . . . 179--200
Anthony Duncan and
Ralph Roskies Representations of Unusual Mathematical
Structures in Scientific Applications of
Symbolic Computation . . . . . . . . . . 201--206 (or 201--207??)
C. Trindle Application of the MuMath(R) Symbol
Manipulation System to Chemically
Significant Permutation Groups . . . . . 207--212
Stanly Steinberg and
Patrick J. Roache Using Macsyma to Write FORTRAN
Subroutines . . . . . . . . . . . . . . 213--216
B. F. Caviness Computer Algebra: Past and Future . . . 217--236
J. H. Davenport and
M. F. Singer Elementary and Liouvillian solutions of
linear differential equations . . . . . 237--260
Heinrich Rolletschek On the Number of Divisions of the
Euclidean Algorithm Applied to Gaussian
Integers . . . . . . . . . . . . . . . . 261--292 (or 261--291??)
David A. Plaisted and
Steven Greenbaum A Structure Preserving Clause Form
Translation . . . . . . . . . . . . . . 293--304
Paul S. Wang FINGER: A symbolic system for automatic
generation of numerical programs in
finite element analysis . . . . . . . . 305--316
R. V. Book and
J. H. Siekmann On Unification: Equational Theories Are
Not Bounded . . . . . . . . . . . . . . 317--324
Lawrence C. Paulson Constructing Recursion Operators in
Intuitionistic Type Theory . . . . . . . 325--355
Murray R. Bremner Fast Computation of Weight
Multiplicities . . . . . . . . . . . . . 357--362
Philippe Le Chenadec A Catalogue of Complete Group
Presentations . . . . . . . . . . . . . 363--381
D. Armbruster and
H. Kredel Constructing universal unfoldings using
Gröbner bases . . . . . . . . . . . . . . 383--388
B. Kutzler and
S. Stifter On the application of Buchberger's
algorithm to automated geometry theorem
proving . . . . . . . . . . . . . . . . 389--397
Deepak Kapur Using Gröbner bases to reason about
geometry problems . . . . . . . . . . . 399--408
T. Coquand and
G. P. Huet A Selected Bibliography on Constructive
Mathematics, Intuitionistic Type Theory
and Higher Order Deduction . . . . . . . ??
Bruno Buchberger History and Basic Features of the
Critical-Pair/Completion Procedure . . . 3--38
Ronald V. Book Thue Systems as Rewriting Systems . . . 39--68
Nachum Dershowitz Termination of Rewriting . . . . . . . . 69--115
Michael Rusinowitch Path of Subterms Ordering and Recursive
Decomposition Ordering Revisited . . . . 117--132 (or 117--131??)
Jieh Hsiang Rewrite Method for Theorem Proving in
First Order Theory with Equality . . . . 133--151
Katherine A. Yelick Unification in Combinations of
Collapse-free Regular Theories . . . . . 153--181
Erik Tidén and
Stefan Arnborg Unification Problems with One-sided
Distributivity . . . . . . . . . . . . . 183--202
Dan Benanav and
Deepak Kapur and
Paliath Narendran Complexity of Matching Problems . . . . 203--216
Albrecht Fortenbacher An Algebraic Approach to Unification
Under Associativity and Commutativity 217--229
Charles C. Sims Verifying Nilpotence . . . . . . . . . . 231--247
F. Aurenhammer Recognising Polytopical Cell Complexes
and Constructing Projection Polyhedra 249--255
François Fages Associative-Commutative Unification . . 257--275
J. F. Ogilvie and
R. H. Tipping On the Analytic Solution by Computer
Algebra of Some Problems in the
Vibration-rotational Spectroscopy of
Diatomic Molecules . . . . . . . . . . . 277--281
W. A. Beyer and
L. Heller A Steiner Tree Associated with Tree
Quarks . . . . . . . . . . . . . . . . . 283--289
R. D. Mills Using a Small Algebraic Manipulation
System to Solve Differential and
Integral Equations by Variational and
Approximation Techniques . . . . . . . . 291--301
A. L. Semjonov and
L. S. Mel\cprimenikov and
V. A. Evstigneev Solving the Problems of Kinetics of
Complex Reactions by Symbolic Algebraic
Manipulation Methods . . . . . . . . . . 303--307
Michael Pohst Introduction . . . . . . . . . . . . . . 1--2
R. Böffgen and
M. A. Reichert Computing the Decomposition of Primes
$p$ and $p$-adic Absolute Values in
Semisimple Algebras over ${\bf Q}$ . . . 3--10
Johannes B. Buchmann and
H. C. Williams On Principal Ideal Testing in Algebraic
Number Fields . . . . . . . . . . . . . 11--19
L. Cerlienco and
M. Mignotte and
F. Piras Computing the Measure of a Polynomial 21--33
Harvey Cohn and
Jesse Ira Deutsch Application of Symbolic Manipulation to
the Hecke Transformations of Modular
Forms in Two Variables, II . . . . . . . 35--40
Carsten Eckhardt Computation of Class Numbers by an
Analytic Method . . . . . . . . . . . . 41--52
H. G. Folz and
H. G. Zimmer What is the Rank of the Demjanenko
Matrix? . . . . . . . . . . . . . . . . 53--67
David J. Ford The Construction of Maximal Orders Over
a Dedekind Domain . . . . . . . . . . . 69--75
Erich Kaltofen Deterministic Irreducibility Testing of
Polynomials over Large Finite Fields . . 77--82
Gunter Malle Polynomials for Primitive Nonsolvable
Permutation Groups of Degree $d \leq 15$ 83--92
B. Heinrich Matzat and
Andreas Zeh-Marschke Polynome mit der Galoisgruppe ${M}_{11}$
über ${\bf Q}$. (German) [Polynomials
with the Galois group ${M}_{11}$ over
${\bf Q}$] . . . . . . . . . . . . . . . 93--97
Eckart Maus Computation of integral bases in certain
${S}_n$ extensions of ${\bf Q}$ . . . . 99--102
Attila Pethö On the resolution of Thue inequalities 103--109
W. Plesken Towards a Soluble Quotient Algorithm . . 111--122
M. Pohst A Modification of the LLL-Reduction
Algorithm . . . . . . . . . . . . . . . 123--127
Anonymous Bibliography of Hans Zassenhaus . . . . 129--135
Joachim von zur Gathen Feasible Arithmetic Computations:
Valiant's Hypothesis . . . . . . . . . . 137--172
Neil V. Murray and
Erik Rosenthal Theory Links: Applications to Automated
Theorem Proving . . . . . . . . . . . . 173--190
Wolfram Büttner and
Helmut Simonis Embedding Boolean Expressions into Logic
Programming . . . . . . . . . . . . . . 191--205
Robert Paige and
Fritz Henglein Mechanical Translation of Set Theoretic
Problem Specifications into Efficient
RAM Code --- A Case Study . . . . . . . 207--232
Jean H. Gallier Fast algorithms for testing
unsatisfiability of ground Horn clauses
with equations . . . . . . . . . . . . . 233--254
Gordon F. Royle The Transitive Groups of Degree Twelve 255--268
Jacek Gibert Functional Programming with Combinators 269--293
Stéphane Kaplan Simplifying conditional term rewriting
systems: unification, termination and
confluence . . . . . . . . . . . . . . . 295--334
A. Hilali On the algebraic and differential
Newton-Puiseux polygons . . . . . . . . 335--349
Sabine Stifter A Generalization of Reduction Rings . . 351--364
D. A. Young and
P. S. Wang GI/S: a graphical user interface for
symbolic computation systems . . . . . . 365--380
W. A. Beyer and
L. R. Fawcett and
R. D. Mauldin and
B. K. Swartz The volume common to two congruent
circular cones whose axes intersect
symmetrically . . . . . . . . . . . . . 381--390
Isaac Elishakoff and
Brian Couch Application of Symbolic Algebra to the
Instability of a Nonconservative System 391--396
S. Bandyopadhyay and
J. S. Devitt SIS: a symbolic information management
system . . . . . . . . . . . . . . . . . 397--408
Nachum Dershowitz Corrigendum: ``Termination of
rewriting'' . . . . . . . . . . . . . . 409--410
Volker Weispfenning The Complexity of Almost Linear
Diophantine Problems . . . . . . . . . . 3--28 (or 3--27??)
James H. Davenport and
Joos Heintz Real Quantifier Elimination is Doubly
Exponential . . . . . . . . . . . . . . 29--36 (or 29--35??)
D. Yu. Grigor\cprimeev and
N. N. Vorobjov, Jr. Solving Systems of Polynomial
Inequalities in Sub-Exponential Time . . 37--64
D. Yu. Grigor\cprimeev Complexity of Deciding Tarski Algebra 65--108
Jean-Jacques J. Risler Some Aspects of Complexity in Real
Algebraic Geometry . . . . . . . . . . . 109--120 (or 109--119??)
M. Coste and
M. F. Roy Thom's Lemma, the Coding of Real
Algebraic Numbers and the Computation of
the Topology of Semi-Algebraic Sets . . 121--130 (or 121--129??)
Stefan Arnborg and
Huichun Feng Algebraic Decomposition of Regular
Curves . . . . . . . . . . . . . . . . . 131--140
Scott McCallum An Improved Projection Operation for
Cylindrical Algebraic Decomposition of
Three-Dimensional Space . . . . . . . . 141--162 (or 141--161??)
Dennis S. Arnon and
George E. Collins and
Scott McCallum An Adjacency Algorithm for Cylindrical
Algebraic Decompositions of
Three-Dimensional Space . . . . . . . . 163--188 (or 163--187??)
Dennis S. Arnon A Cluster-Based Cylindrical Algebraic
Decomposition Algorithm . . . . . . . . 189--212
Dennis S. Arnon and
Scott McCallum A Polynomial-time Algorithm for the
Topological Type of a Real Algebraic
Curve . . . . . . . . . . . . . . . . . 213--236
Dennis S. Arnon and
Maurice Mignotte On Mechanical Quantifier Elimination for
Elementary Algebra and Geometry . . . . 237--260 (or 237--259??)
Daniel Lazard Quantifier Elimination: Optimal
Solutions for Two Classical Examples . . 261--266
Dennis S. Arnon A Bibliography of Quantifier Elimination
for Real Closed Fields . . . . . . . . . 267--274
Gregory Butler A proof of Holt's algorithm . . . . . . 275--284 (or 275--283??)
S. P. Glasby Constructing Normalisers in Finite
Soluble Groups . . . . . . . . . . . . . 285--294
S. P. Glasby Intersecting Subgroups of Finite Soluble
Groups . . . . . . . . . . . . . . . . . 295--302 (or 295--301??)
Hidetsune Kobayashi and
Tetsuro Fujise and
Akio Furukawa Solving Systems of Algebraic Equations
by a General Elimination Method . . . . 303--320
Shojiro Sakata Finding a Minimal Set of Linear
Recurring Relations Capable of
Generating a Given Finite
Two-Dimensional Array . . . . . . . . . 321--338 (or 321--337??)
Klaus Madlener and
Friedrich Otto Pseudo-Natural Algorithms for Finitely
Generated Presentations of Monoids and
Groups . . . . . . . . . . . . . . . . . 339--358
G. Mints and
E. Tyugu The programming system PRIZ . . . . . . 359--376 (or 359--375??)
Martin L. Sage An algebraic treatment of quantum
vibrations using REDUCE . . . . . . . . 377--384
C. P. Mawata Solving the heat equation symbolically
with MuSimp . . . . . . . . . . . . . . 385--389
Leo Bachmair and
Nachum Dershowitz Critical Pair Criteria for Completion 1--18
Deepak Kapur and
David R. Musser and
Paliath Narendran Only Prime Superpositions Need be
Considered in the Knuth-Bendix
Completion Procedure . . . . . . . . . . 19--36
Abdelilah Kandri-Rody and
Deepak Kapur Computing a Gröbner basis of a polynomial
ideal over a Euclidean domain . . . . . 37--58 (or 37--57??)
Edmund F. Robertson Tietze Transformations with Weighted
Substring Search . . . . . . . . . . . . 59--64
Thomas J. Myers and
Maya B. Gokhale Parallel Scheduling of Recursively
Defined Arrays . . . . . . . . . . . . . 65--82 (or 65--81??)
Domenico Cantone and
Susanna Ghelfo and
Eugenio Omodeo The automation of syllogistic. I.
Syllogistic normal forms . . . . . . . . 83--98 (or 82--98??)
C. Wrathall The Word Problem for Free Partially
Commutative Groups . . . . . . . . . . . 99--104
Gerhard O. Michler An Algorithm for Determining the
Simplicity of a Modular Group
Representation . . . . . . . . . . . . . 105--112 (or 105--111??)
J. Dixmier and
D. Lazard Minimum number of fundamental invariants
for the binary form of degree 7 . . . . 113--116 (or 113--115??)
Alexander Ollongren On a particular restricted five-body
problem: an analysis with computer
algebra . . . . . . . . . . . . . . . . 117--127 (or 117--126??)
J. H. Davenport Computer Algebra Applied to Itself . . . 127--132
David Bayer and
Michael Stillman On the Complexity of Computing Syzygies 135--148 (or 135--147??)
Patrizia Gianni and
Barry Trager and
Gail Zacharias Gröbner bases and primary decomposition
of polynomial ideals . . . . . . . . . . 149--168 (or 149--167??)
R. Shtokhamer Lifting canonical algorithms from a ring
${R}$ to the ring ${R}[x]$ . . . . . . . 169--182 (or 169--181??)
Teo Mora and
Lorenzo Robbiano The Gröbner Fan of an ideal . . . . . . . 183--208
David Bayer and
Ian Morrison Standard bases and geometric invariant
theory. I. Initial ideals and state
polytopes . . . . . . . . . . . . . . . 209--218 (or 209--217??)
Giuseppa Carr\`a Ferro Gröbner bases and Hilbert schemes. I . . 219--230
Heinz Kredel and
Volker Weispfenning Computing dimension and independent sets
for polynomial ideals . . . . . . . . . 231--248 (or 231--247??)
Marc Giusti Combinatorial dimension theory of
algebraic varieties . . . . . . . . . . 249--266 (or 249--265??)
David Shannon and
Moss Sweedler Using Gröbner bases to determine algebra
membership, split surjective algebra
homomorphisms determine birational
equivalence . . . . . . . . . . . . . . 267--274 (or 267--273??)
Rüdiger Gebauer and
H. Michael Möller On an Installation of Buchberger's
Algorithm . . . . . . . . . . . . . . . 275--286
Franz Winkler A $p$-adic approach to the computation
of Gröbner bases . . . . . . . . . . . . 287--304
A. Miola and
T. Mora Constructive lifting in graded
structures: a unified view of Buchberger
and Hensel methods . . . . . . . . . . . 305--322
Michela Brundu and
Fabio Rossi On the computation of generalised
standard bases . . . . . . . . . . . . . 323--344 (or 323--343??)
H. Michael Möller On the construction of Gröbner bases
using syzygies . . . . . . . . . . . . . 345--360 (or 345--359??)
J. Apel and
W. Lassner An extension of Buchberger's algorithm
and calculations in enveloping fields of
Lie algebras . . . . . . . . . . . . . . 361--370
Tatiana Gateva-Ivanova and
Victor Latyshev On recognisable properties of
associative algebras . . . . . . . . . . 371--388
Hans W. Scholten and
Mark H. Overmars General Methods for Adding Range
Restrictions to Decomposable Searching
Problems . . . . . . . . . . . . . . . . 1--10
Richard Cole and
Micha Sharir Visibility Problems for Polyhedral
Terrains . . . . . . . . . . . . . . . . 11--30
Bruce W. Char and
Keith O. Geddes and
Gaston H. Gonnet GCDHEU: Heuristic Polynomial GCD
Algorithm Based on Integer GCD
Computation . . . . . . . . . . . . . . 31--48
S. R. Czapor Solving Algebraic Equations: Combining
Buchberger's Algorithm with Multivariate
Factorization . . . . . . . . . . . . . 49--54 (or 49--53??)
Luquan Pan On the D-Basis of Polynomial Ideals over
Principal Ideal Domains . . . . . . . . 55--70 (or 55--69??)
Leon Sterling and
Alan Bundy and
Lawrence Byrd and
Richard O'Keefe and
Bernard Silver Solving Symbolic Equations with PRESS 71--84
Ph. Tombal and
A. Moussiaux Algebraic programming of geometrical
calculus and Clifford algebra . . . . . 85--92 (or 85--91??)
Tze Beng Ng Computation of the cohomology of
${B}\hat{\rm S}{\rm O}_n\langle
16\rangle$ for $23\leq n\leq 26$ using
REDUCE . . . . . . . . . . . . . . . . . 93--100 (or 93--99??)
Martin L. Sage Erratum: ``An algebraic treatment of
quantum vibrations using REDUCE'' [J.
Symbolic Comput. \bf 5 (1988), no. 3,
377--384] . . . . . . . . . . . . . . . 101--101
Rick Statman The Word Problem for Smullyan's Lark
Combinator is Decidable . . . . . . . . 103--112
Masako Takahashi Parallel Reduction in $\lambda$-Calculus 113--124 (or 113--123??)
Danny de Schreye and
Maurice Bruynooghe On the Transformation of Logic Programs
with Instantiation Based Computation
Rules . . . . . . . . . . . . . . . . . 125--154
Marilena Pittaluga and
Elisabetta Strickland A computer oriented algorithm for the
determination of the dimension and
character of a modular irreducible ${\rm
{SL}}(n,{K})$-module . . . . . . . . . . 155--162 (or 155--161??)
R. D. Dutton and
R. C. Brigham and
F. Gomez INGRID: A Graph Invariant Manipulator 163--178 (or 163--177??)
S. A. Vorontsov An Example of the Application of
Symbolic Computation in Solid State
Physics . . . . . . . . . . . . . . . . 179--182 (or 179--181??)
B. Autin and
J. Bengtsson Symbolic Evaluation of Integrals
Occurring in Accelerator Orbit Theory 183--188 (or 183--187??)
J. F. Magnan A MACSYMA Program for the Multiple
Bifurcation Analysis of Double-Diffusive
Convection . . . . . . . . . . . . . . . 189--198 (or 189--197??)
W. Hirschberg and
D. Schramm Application of NEWEUL in Robot Dynamics 199--204
Jörg H. Siekmann Unification Theory . . . . . . . . . . . 207--274
Ursula Martin and
Tobias Nipkow Boolean Unification --- The Story So Far 275--294 (or 275--293??)
Werner Nutt and
Pierre Réty and
Gert Smolka Basic Narrowing Revisited . . . . . . . 295--318 (or 295--317??)
Jia-Huai You Enumerating Outer Narrowing Derivations
for Constructor-Based Term Rewriting
Systems . . . . . . . . . . . . . . . . 319--342 (or 319--341??)
Gert Smolka and
Hassan Aït-Kaci Inheritance Hierarchies: Semantics and
Unification . . . . . . . . . . . . . . 343--370
Hubert Comon and
Pierre Lescanne Equational Problems and Disunification 371--425 (or 371--426??)
Paris C. Kanellakis and
Peter Z. Z. Revesz On the Relationship of Congruence
Closure and Unification . . . . . . . . 427--444
Dexter Kozen and
Susan Landau Polynomial Decomposition Algorithms . . 445--456
Paliath Narendran and
Colm Ó'Dúnlaing Cancellativity in Finitely Presented
Semigroups . . . . . . . . . . . . . . . 457--472
C. W. H. Lam and
L. Thiel Backtrack Search with Isomorph Rejection
and Consistency Check . . . . . . . . . 473--486 (or 473--485??)
Eyal Mozes A deductive database based on
Aristotelian logic . . . . . . . . . . . 487--508 (or 487--507??)
Catherine Lassez and
Ken McAloon and
Graeme Port Stratification and Knowledge Base
Management . . . . . . . . . . . . . . . 509--522
Renato P. dos Santos Using REDUCE in Supersymmetry . . . . . 523--525
Bernd Martin and
Gerhard Pfister The kernel of the Kodaira-Spencer map of
the versal $\mu$-constant deformation of
an irreducible plane curve singularity
with ${\bf C}^r$-action. . . . . . . . . 527--532 (or 527--531??)
J. Traugott Deductive Synthesis of Sorting Programs 533--572
Patrick Suppes and
Shuzo Takahashi An Interactive Calculus Theorem-Prover
for Continuity Properties . . . . . . . 573--590
Teofilo Gonzalez and
Si-Qing Zheng Improved Bounds for Rectangular and
Guillotine Partitions . . . . . . . . . 591--610
W. I. Fushchich and
V. V. Kornyak Computer algebra application for
determining Lie and Lie-Bäcklund
symmetries of differential equations . . 611--619
Hans-Jürgen Bürckert and
Alexander Herold and
Manfred Schmidt-Schauss On Equational Theories, Unification, and
(Un)decidability . . . . . . . . . . . . 3--50 (or 3--49??)
Manfred Schmidt-Schauss Unification in a Combination of
Arbitrary Disjoint Equational Theories 51--100 (or 51--99??)
J. Gallier and
W. Snyder Higher-order unification revisited:
complete sets of transformations . . . . 101--140
Wayne Snyder and
Jean Gallier Higher order unification revisited:
Complete Sets of Transformations . . . . 101--140
Philippe Le Chenadec On the logic of unification . . . . . . 141--199
Michael Clausen and
Albrecht Fortenbacher Efficient Solution of Linear Diophantine
Equations . . . . . . . . . . . . . . . 201--216
Patrick Lincoln and
Jim Christian Adventures in Associative-Commutative
Unification . . . . . . . . . . . . . . 217--240
Gregory Butler and
John Cannon Computing in permutation and matrix
groups. III: Sylow subgroups . . . . . . 241--252
Laurent Fribourg A Strong Restriction of the Inductive
Completion Procedure . . . . . . . . . . 253--276
Martin Abadi and
Zohar Manna Temporal Logic Programming . . . . . . . 277--296 (or 277--295??)
F. Brackx and
D. Constales and
A. Ronveaux and
H. Serras On the Harmonic and Monogenic
Decomposition of Polynomials . . . . . . 297--304
A. D. Fitt Symbolic Computation of Hyperbolicity
Regions for Systems of Two-Phase Flow
Conservation Laws Using Maple . . . . . 305--308
Gordon F. Royle and
Cheryl E. Präger Constructing the Vertex-Transitive
Graphs of Order 24 . . . . . . . . . . . 309--326
Arne Dür On Computing the Canonical Form for a
Binary Form of Odd Degree . . . . . . . 327--334 (or 327--333??)
Laurence Puel Using Unavoidable Set of Trees to
Generalize Kruskal's Theorem . . . . . . 335--382
José Meseguer and
Joseph A. Goguen and
Gert Smolka Order Sorted Unification . . . . . . . . 383--414 (or 383--413??)
Manfred Schmidt-Schauss Unification in Permutative Equational
Theories is Undecidable . . . . . . . . 415--422 (or 415--421??)
M. L. Dudley and
R. W. James Computer-aided derivation of spherical
harmonic spectral equations in
astro-geophysics . . . . . . . . . . . . 423--427
Lars Langemyr and
Scott McCallum The Computation of Polynomial Greatest
Common Divisors Over an Algebraic Number
Field . . . . . . . . . . . . . . . . . 429--448
Alexandre Boudet and
Jean-Pierre P. Jouannaud and
Manfred Schmidt-Schauss Unification in Boolean rings and Abelian
groups . . . . . . . . . . . . . . . . . 449--478 (or 449--477??)
Franz Baader Unification in Commutative Theories . . 479--498 (or 479--497??)
Habib Abdulrab and
Jean-Pierre Pécuchet Solving Word Equations . . . . . . . . . 499--522 (or 499--521??)
Hans-Jürgen J. Bürckert Matching---A Special Case of
Unification? . . . . . . . . . . . . . . 523--536
A. Ronveaux and
G. Thiry Differential Equations of Some
Orthogonal Families in REDUCE . . . . . 537--541
Hidetsune Kobayashi and
Shuichi Moritsugu and
Robert W. Hogan On radial zero-dimensional ideals . . . 545--552
Kazuhiro Yokoyama and
Masayuki Noro and
Taku Takeshima Computing Primitive Elements of
Extension Fields . . . . . . . . . . . . 553--580
Takaji Umeno and
Syuichi Yamashita and
Osami Saito and
Kenichi Abe Symbolic Computation Application for the
Design of Linear Multivariable Control
Systems . . . . . . . . . . . . . . . . 581--588
Kô Sakai and
Akira Aiba CAL: a theoretical background of
constraint logic programming and its
applications . . . . . . . . . . . . . . 589--604 (or 589--603??)
Taisuke Sato and
Hisao Tamaki First order compiler: a deterministic
logic program synthesis algorithm . . . 605--628 (or 605--627??)
Tatsuya Hagino Codatatypes in ML . . . . . . . . . . . 629--650
Masami Hagiya Meta-circular Interpreter for a Strongly
Typed Language . . . . . . . . . . . . . 651--680
Sato Hiroyuki E-CCC: between CCC and topos --- its
expressive power from the viewpoint of
data type theory . . . . . . . . . . . . 681--695
A. Kandri-Rody and
V. Weispfenning Non-commutative Gröbner bases in algebras
of solvable type . . . . . . . . . . . . 1--26
Gilles Labonté An algorithm for the construction of
matrix representations for finitely
presented non-commutative algebras . . . 27--38
H. W. Gollan and
T. W. Ostermann Operation of Class Sums on Permutation
Modules . . . . . . . . . . . . . . . . 39--48 (or 39--47??)
Manuel Bronstein The transcendental Risch differential
equation . . . . . . . . . . . . . . . . 49--60
H. Caprasse Renormalization Group, Function
Iterations and Computer Algebra . . . . 61--72
S. A. Fulling The Analytic Approach to Recursion
Relations . . . . . . . . . . . . . . . 73--86 (or 73--85??)
Man Kam Kwong and
Mary Beth Dever Computer-aided study of a problem in
Hermitian matrix theory . . . . . . . . 87--112
D. Lazard and
R. Rioboo Integration of rational functions:
rational computation of the logarithmic
part . . . . . . . . . . . . . . . . . . 113--116 (or 113--115??)
Manuel Bronstein Integration of Elementary Functions . . 117--174 (or 117--173??)
Joachim von zur Gathen Inversion in Finite Fields Using
Logarithmic Depth . . . . . . . . . . . 175--184 (or 175--183??)
Alex Kean and
George Tsiknis An incremental method for generating
prime implicants/implicates . . . . . . 185--206
Moshe Eisenberger Application of Symbolic Algebra to the
Analysis of Plates on Variable Elastic
Foundation . . . . . . . . . . . . . . . 207--214 (or 207--213??)
N. G. Lloyd and
J. M. Pearson REDUCE and the Bifurcation of Limit
Cycles . . . . . . . . . . . . . . . . . 215--224
B. Buchberger and
E. Kaltofen Special Issue: Computational Algebraic
Complexity---Editorial . . . . . . . . . 225--228
Eric Bach and
Victor Shoup Factoring Polynomials Using Fewer Random
Bits . . . . . . . . . . . . . . . . . . 229--240 (or 229--239??)
John Canny Generalised Characteristic Polynomials 241--250
Don Coppersmith and
Shmuel Winograd Matrix Multiplication via Arithmetic
Progressions . . . . . . . . . . . . . . 251--280
Joachim von zur Gathen Functional Decomposition of Polynomials:
The Tame Case . . . . . . . . . . . . . 281--300 (or 281--299??)
Erich Kaltofen and
Barry M. Trager Computing with Polynomials Given by
Black Boxes for Their Evaluations:
Greatest Common Divisors, Factorization,
Separation of Numerators and
Denominators . . . . . . . . . . . . . . 300--320 (or 301--320??)
Erich Kaltofen Errata to: ``Fast parallel absolute
irreducibility testing'' [J.\ Symbolic
Comput. \bf 1 (1985), no. 1, 57--67, MR
87b:12002] . . . . . . . . . . . . . . . 320--320
Heinrich Rolletschek Shortest Division Chains in Imaginary
Quadratic Number Fields . . . . . . . . 321--354
Lajos Rónyai Computing the Structure of Finite
Algebras . . . . . . . . . . . . . . . . 355--374 (or 355--373??)
Richard Zippel Interpolating Polynomials from Their
Values . . . . . . . . . . . . . . . . . 375--403
Takis Sakkalis and
Rida Farouki Singular Points of Algebraic Curves . . 405--422 (or 405--421??)
Hantao Zhang Automated Proof of Ring Commutativity
Problems by Algebraic Methods . . . . . 423--428 (or 423--427??)
Keju Ma and
Joachim von zur Gathen Analysis of Euclidean Algorithms for
Polynomials over Finite Fields . . . . . 429--456 (or 429--455??)
Oliver Günther Minimum $K$-Partitioning of Rectilinear
Polygons . . . . . . . . . . . . . . . . 457--484 (or 457--483??)
R. Ramesh and
I. V. Ramakrishnan Parallel Tree Pattern Matching . . . . . 485--502 (or 485--501??)
R. M. Corless and
D. J. Jeffrey Solution of a hydrodynamic lubrication
problem with Maple . . . . . . . . . . . 503--514 (or 503--513??)
Stuart B. Savage Symbolic Computation of the Flow of
Granular Avalanches . . . . . . . . . . 515--530
S. B. Conlon Calculating characters of $p$-groups . . 535--550
S. B. Conlon Computing Modular and Projective
Character Degrees of Soluble Groups . . 551--570
Gerhard O. Michler Some Problems in Computational
Representation Theory . . . . . . . . . 571--582
R. A. Parker and
R. A. Wilson The Computer Construction of Matrix
Representations of Finite Groups over
Finite Fields . . . . . . . . . . . . . 583--590
A. J. E. Ryba Computer condensation of modular
representations . . . . . . . . . . . . 591--600
Gerhard J. A. Schneider Dixon's Character Table Algorithm
Revisited . . . . . . . . . . . . . . . 601--606 (or 600--606??)
Gerhard J. A. Schneider Computing with Endomorphism Rings of
Modular Representations . . . . . . . . 607--636
S. P. Glasby and
Michael C. Slattery Computing Intersections and Normalizers
in Soluble Groups . . . . . . . . . . . 637--652 (or 637--651??)
George Havas and
M. F. Newman and
M. R. Vaughan-Lee A Nilpotent Quotient Algorithm for
Graded Lie Rings . . . . . . . . . . . . 653--664
C. R. Leedham-Green and
L. H. Soicher Collection from the left and other
strategies . . . . . . . . . . . . . . . 665--676 (or 665--675??)
E. A. O'Brien The $p$-Group Generation Algorithm . . . 677--698
Charles C. Sims Computing the Order of a Solvable
Permutation Group . . . . . . . . . . . 699--706 (or 699--705??)
Charles C. Sims Implementing the
Baumslag-Cannonito-Miller Polycyclic
Quotient Algorithm . . . . . . . . . . . 707--724 (or 707--723??)
M. R. Vaughan-Lee Collection From the Left . . . . . . . . 725--733
Jean-Jacques J. Risler and
Felice Ronga Testing Polynomials . . . . . . . . . . 1--5
D. Yu. Grigor\cprimeev Complexity of Factoring and Calculating
the GCD of Linear Ordinary Differential
Operators . . . . . . . . . . . . . . . 7--37
Marie-Françoise F. Roy and
Aviva Szpirglas Complexity of Computation on Real
Algebraic Numbers . . . . . . . . . . . 39--52 (or 39--51??)
G. H. Norton On the Asymptotic Analysis of the
Euclidean Algorithm . . . . . . . . . . 53--58
Michael F. Singer Formal Solutions of Differential
Equations . . . . . . . . . . . . . . . 59--94
Daniel Ratner and
Manfred Warmuth The $(n^2-1)$-puzzle and related
relocation problems . . . . . . . . . . 111--137 (or 111--136??)
S. Cabay and
P. Kossowski Power series remainder sequences and Padé
fractions over an integral domain . . . 138--164 (or 139--163??)
Thomas Becker Standard Bases and Some Computations in
Rings of Power Series . . . . . . . . . 165--178
T. Deprit and
E. Deprit Processing Poisson Series in Parallel 179--202 (or 179--201??)
V. P. Gerdt and
A. Yu. Zharkov Computer Classification of Integrable
Coupled KdV-like Systems . . . . . . . . 203--208 (or 203--207??)
Aik-Koan K. Heng Some Remarks On Numerical Iterations in
a Symbolic Manipulation System . . . . . 209--221
P. Alevizos and
J. D. Boissonnat and
M. Yvinec Non Convex Contour Reconstruction . . . 225--252
Ketan Mulmuley A Fast Planar Partition Algorithm, I . . 253--280
Bernard Chazelle and
Micha Sharir An Algorithm for Generalized Point
Location and its Applications . . . . . 281--310 (or 281--309??)
David Avis and
Hiroshi Imai Locating a Robot with Angle Measurements 311--326
Nimrod Megiddo On the Complexity of Some Geometric
Problems in Unbounded Dimension . . . . 327--334
H. Edelsbrunner and
F. P. Preparata and
D. B. West Tetrahedrizing Point Sets in Three
Dimensions . . . . . . . . . . . . . . . 335--348 (or 335--347??)
Chee-Keng K. Yap Symbolic Treatment of Geometric
Degeneracies . . . . . . . . . . . . . . 349--370
Jacob T. Schwartz and
Micha Sharir On the two-dimensional
Davenport-Schinzel problem . . . . . . . 371--393
V. Weispfenning The Complexity of Almost Linear
Diophantine Problems . . . . . . . . . . 395--404 (or 395--403??)
F. Cucker and
M. F. Roy A Theorem on Random Polynomials and Some
Consequences in Average Complexity . . . 405--410 (or 405--409??)
H. B. Hunt, III and
R. E. Stearns The Complexity of Equivalence for
Commutative Rings . . . . . . . . . . . 411--436
Joachim von zur Gathen Functional Decomposition of Polynomials:
The Wild Case . . . . . . . . . . . . . 437--452
Marie-Hél\`ene H. Mathieu and
David Ford On $p$-adic Computation of the Rational
Form of a Matrix . . . . . . . . . . . . 453--464
P. Beckmann and
J. Stückrad The Concept of Gröbner Algebras . . . . . 465--479 (or 465--480??)
Gerard Lallement and
Robert McFadden On the Determination of Green's
Relations in Finite Transformation
Semigroups . . . . . . . . . . . . . . . 481--498
Glen C. Nielsen and
Mark O. McLinden and
Graham Morrison Use of Computer Algebra to Locate
Critical Loci in Fluid Mixtures . . . . 499--508
N. Vira and
T. Gill and
E. Tunstel Application of Symbolic Computation in
Robot Pose Error Modeling . . . . . . . 509--524 (or 509--523??)
M. D. Abouzahra and
R. Pavelle Computer algebra applied to radiation
from microstrip discontinuities . . . . 525--528
D. Kozen and
S. Landau Errata: ``Polynomial decomposition
algorithms'' [J. Symbolic Comput.\ \bf 7
(1989), no. 5, 445--456, MR 91c:13022] 529--529
Norbert Klingen Leopoldt's conjecture for imaginary
Galois number fields . . . . . . . . . . 531--546 (or 531--545??)
Joachim von zur Gathen and
Mark Giesbrecht Constructing Normal Bases in Finite
Fields . . . . . . . . . . . . . . . . . 547--570
Gert Almkvist and
Doron Zeilberger The Method of Differentiating under the
Integral Sign . . . . . . . . . . . . . 571--592 (or 571--591??)
Jeffrey Shallit On the Worst Case of Three Algorithms
for Computing the Jacobi Symbol . . . . 593--610
John Shackell Growth estimates for Exp-log functions 611--632
Walter Nef and
Peter-Michael M. Schmidt Computing a Sweeping-plane in Regular
(``General'') Position: a Numerical and
a Symbolic Solution . . . . . . . . . . 633--646
Robert A. Wilson The $2$- and $3$-modular characters of
$J_3$, its covering group and
automorphism group . . . . . . . . . . . 647--657 (or 647--656??)
D. I. Hughes Symbolic Computation with Fermions . . . 657--664
John Pais and
Gerald E. Peterson Using Forcing to Prove Completeness of
Resolution and Paramodulation . . . . . 3--19 (or 3--20??)
Michael Rusinowitch Theorem-proving with Resolution and
Superposition . . . . . . . . . . . . . 21--50 (or 21--49??)
Harald Ganzinger A Completion Procedure for Conditional
Equations . . . . . . . . . . . . . . . 51--82 (or 51--81??)
Deepak Kapur and
Paliath Narendran and
Hantao Zhang Automating Inductionless Induction using
Test Sets . . . . . . . . . . . . . . . 83--112 (or 83--111??)
Emmanuel Kounalis and
Michael Rusinowitch On Word Problems in Horn Theories . . . 113--128 (or 113--127??)
Rolf Socher On the Relation Between Resolution Based
and Completion Based Theorem Proving . . 129--148 (or 129--147??)
David A. Plaisted and
Richard C. Potter Term Rewriting: Some Experimental
Results . . . . . . . . . . . . . . . . 149--180
J. Chazarain and
A. Riscos and
J. A. Alonso and
E. Briales Multi-Valued Logic and Gröbner Bases with
Applications to Modal Logic . . . . . . 181--194
Doron Zeilberger The Method of Creative Telescoping . . . 195--204
Andrea Sattler-Klein Elimination of Composite Superpositions
May Cause Abortion . . . . . . . . . . . 205--212 (or 205--211??)
Graziano Gentili and
Michael A. O'Connor Rational Geometry in Space . . . . . . . 213--230 (or 213--229??)
Jean C. Piquette A method for symbolic evaluation of
indefinite integrals containing special
functions or their products . . . . . . 231--250 (or 231--249??)
Michael F. Singer Liouvillian Solution of Linear
Differential Equations with Liouvillian
Coefficients . . . . . . . . . . . . . . 251--274 (or 251--273??)
D. A. Diver Modelling Waves with Computer Algebra 275--290 (or 275--289??)
H. I. Cohen and
J. P. Fitch Uses Made of Computer Algebra in Physics 291--305
Carl G. Ponder Parallel Multiplication and Powering of
Polynomials . . . . . . . . . . . . . . 307--320
Alain Laville Comparison of Priority Rules in Pattern
Matching and Term Rewriting . . . . . . 321--348 (or 321--347??)
H. Comon and
D. Lugiez and
Ph. Schnoebelen A rewrite-based type discipline for a
subset of computer algebra . . . . . . . 349--368
Steven G. Krantz and
William H. Paulsen Asymptotic eigenfrequency distributions
for the ${N}$-beam Euler-Bernoulli
coupled beam equation with dissipative
joints . . . . . . . . . . . . . . . . . 369--418
Neil L. White Multilinear Cayley factorization . . . . 421--438
Bernd Sturmfels and
Walter Whiteley On the Synthetic Factorization of
Projectively Invariant Polynomials . . . 439--454 (or 439--453??)
Jacques Morgenstern Invariant and geometric aspects of
algebraic complexity theory. I . . . . . 455--470 (or 455--469??)
Tim McMillan and
Neil L. White The Dotted Straightening Algorithm . . . 471--482
Michael Clausen Multivariate Polynomials, Standard
Tableaux and Representations of
Symmetric Groups . . . . . . . . . . . . 483--522
Henry Crapo Invariant Theoretic Methods in Scene
Analysis and Structural Mechanics . . . 523--548
Walter Whiteley Invariant Computations for Analytic
Projective Geometry . . . . . . . . . . 549--578
Timothy F. Havel Some Examples of the Use of Distances as
Coordinates for Euclidean Geometry . . . 579--594 (or 579--593??)
Bernd Sturmfels Computational Algebraic Geometry of
Projective Configurations . . . . . . . 595--618
Chee-K. K. Yap A New Lower Bound Construction for the
Word Problem for Commutative Thue
Systems . . . . . . . . . . . . . . . . 1--28 (or 1--27??)
Yukihide Takayama Extraction of Redundancy-free Programs
from Constructive Natural Deduction
Proofs . . . . . . . . . . . . . . . . . 29--70 (or 29--69??)
Larry A. Lambe Resolutions via homological perturbation 71--88 (or 71--87??)
Marc Garbey and
Hans G. Kaper and
Gary K. Leaf and
Bernard J. Matkowsky Using MAPLE for the Analysis of
Bifurcation Phenomena in Condensed-Phase
Surface Combustion . . . . . . . . . . . 89--114 (or 89--113??)
Nour Eddine Oussous Macsyma Computation of Local Minimal
Realization of Dynamical Systems of
which Generating Power Series are Finite 115--126
Daniel Richardson Wu's method and the Khovanski\uì
finiteness theorem . . . . . . . . . . . 127--142 (or 127--141??)
H. M. M. ten Eikelder and
J. C. F. Wilmont Normal Forms for a Class of Formulas . . 143--160
Jan Willem Klop and
Aart Middeldorp Sequentiality in Orthogonal Term
Rewriting Systems . . . . . . . . . . . 161--196 (or 161--195??)
J. M. Champarnaud and
G. Hansel AUTOMATE, a Computing Package for
Automata and Finite Semigroups . . . . . 197--220
P. Pasini and
F. Semeria and
C. Zannoni Symbolic Computation of Orientational
Correlation Function Moments . . . . . . 221--231 (or 221--232??)
Dong Ming Wang Mechanical Manipulation for a Class of
Differential Systems . . . . . . . . . .