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 . . . . . . . . . . 233--254
Friedrich Otto When is an Extension of a Specification
Consistent? Decidable and Undecidable
Cases . . . . . . . . . . . . . . . . . 255--274 (or 255--273??)
B. Schend A Methodology for Detecting Shared
Variable Dependencies in Logic Programs 275--298
George E. Collins and
Hoon Hong Partial Cylindrical Algebraic
Decomposition for Quantifier Elimination 299--328
Göran Björck and
Ralf Fröberg A Faster Way to Count the Solution of
Inhomogeneous Systems of Algebraic
Equations, with Applications to Cyclic
$n$-Roots . . . . . . . . . . . . . . . 329--336
Carl Jacobsson and
Clas Löfwall Standard Bases for General Coefficient
Rings and a New Constructive Proof of
Hilbert's Basis Theorem . . . . . . . . 337--372 (or 337--371??)
V. Sailer and
G. Morales-Luna On the Polynomial Representation of
Generalized Liouville Operators . . . . 373--380 (or 373--379??)
Waldir L. Roque and
Renato P. dos Santos Computer Algebra in Spacetime Embedding 381--389
D. B. A. Epstein and
D. F. Holt and
S. E. Rees The Use of Knuth-Bendix Methods to Solve
the Word Problem in Automatic Groups . . 397--414
Stephen A. Linton Double Coset Enumeration . . . . . . . . 415--426
S. A. Linton Constructing Matrix Representations of
Finitely Presented Groups . . . . . . . 427--438
Charles C. Sims The Knuth-Bendix Procedure for Strings
as a Substitute for Coset Enumeration 439--442
Gregory Butler and
John Cannon Computing Sylow Subgroups of Permutation
Groups Using Homomorphic Images of
Centralizers . . . . . . . . . . . . . . 443--458 (or 443--457??)
P. J. Cameron and
J. Cannon Fast Recognition of Doubly Transitive
Groups . . . . . . . . . . . . . . . . . 459--474
Gene Cooperman and
Larry Finkelstein A strong generating test and short
presentations for permutation groups . . 475--498 (or 475--497??)
D. F. Holt The Computation of Normalizers in
Permutation Groups . . . . . . . . . . . 499--516
William M. Kantor Finding composition factors of
permutation groups of degree $n \leq
10^6$ . . . . . . . . . . . . . . . . . 517--526
Charles R. Leedham-Green and
Cheryl E. Praeger and
Leonard H. Soicher Computing with Group Homomorphisms . . . 527--532
Jeffrey S. Leon Permutation Group Algorithms Based on
Partitions, I: Theory and Algorithms . . 533--583
W. Herfort and
H. Penz A new notion of reduction: generating
universal Gröbner bases of ideals in
$K(x,y)$ . . . . . . . . . . . . . . . . 585--606 (or 585--605??)
J. Rafael Sendra and
Franz Winkler Symbolic Parametrization of Curves . . . 607--632 (or 607--631??)
Tobias Nipkow Combining Matching Algorithms: The
Regular Case . . . . . . . . . . . . . . 633--654 (or 633--653??)
David Hartley and
Robin W. Tucker A constructive implementation of the
Cartan-Kähler theory of exterior
differential systems . . . . . . . . . . 655--668 (or 655--667??)
Robert J. Yamartino and
Richard Pavelle An Application of Computer Algebra to a
Problem in Stratified Fluid Flow . . . . 669--672
Kurt Bernardo Wolf and
Guillermo Krötzsch Group-classified polynomials of phase
space in higher-order aberration
expansions . . . . . . . . . . . . . . . 673--694 (or 673--693??)
Carl M. Andersen and
James F. Geer Investigating a hybrid
perturbation-Galerkin technique using
computer algebra . . . . . . . . . . . . 695--714
Jean-Louis L. Lassez and
Ken McAloon A canonical form for generalized linear
constraints . . . . . . . . . . . . . . 1--24
J. Rafael Sendra and
Juan Llovet An Extended Polynomial GCD Algorithm
using Hankel Matrices . . . . . . . . . 25--40 (or 25--39??)
Susan Landau A Note on ``Zippel Denesting'' . . . . . 41--46 (or 41--45??)
Michael B. Monagan A Heuristic Irreducibility Test for
Univariate Polynomials . . . . . . . . . 47--58 (or 47--57??)
R. D. Mills Slope Retention Techniques for Solving
Boundary-Value Problems in Differential
Equations . . . . . . . . . . . . . . . 59--80
Ursula Martin and
Michael Lai Some Experiments with a Completion
Theorem Prover . . . . . . . . . . . . . 81--100
R. G. Cowell Application of Ordered Standard Bases to
Catastrophe Theory . . . . . . . . . . . 101--115
D. Lazard Solving Zero-Dimensional Algebraic
Systems . . . . . . . . . . . . . . . . 117--132 (or 117--131??)
Patrick Fitzpatrick and
John Flynn A Gröbner Basis Technique for Padé
Approximation . . . . . . . . . . . . . 133--138
Nikolaj N. Vorobjov, Jr. The Complexity of Deciding Consistency
of Systems of Polynomials in Exponent
Inequalities . . . . . . . . . . . . . . 139--173 (or 139--174??)
Stanley Burris Discriminator Varieties and Symbolic
Computation . . . . . . . . . . . . . . 175--208 (or 175--207??)
Matthew Dickerson The Inverse of an Automorphism in
Polynomial Time . . . . . . . . . . . . 209--220
W. A. Beyer and
L. R. Fawcett and
L. P. Harten and
B. K. Swartz The Volume Common to Two Congruent
Circular Cylinders . . . . . . . . . . . 221--230
D. Lazard A Note on Upper Bounds for
Ideal-Theoretic Problems . . . . . . . . 231--234 (or 231--233??)
Peter W. O'Hearn and
Zbigniew Stachniak A Resolution Framework for
Finitely-valued First-order Logics . . . 235--254
James Renegar On the Computational Complexity and
Geometry of the First-Order Theory of
the Reals, Part I: Introduction.
Preliminaries. The Geometry of
Semi-Algebraic Sets. The Decision
Problem for the Existential Theory of
the Reals . . . . . . . . . . . . . . . 255--299 (or 255--300??)
James Renegar On the Computational Complexity and
Geometry of the First-Order Theory of
the Reals, Part II: The General Decision
Problem. Preliminaries for Quantifier
Elimination . . . . . . . . . . . . . . 301--328 (or 301--327??)
James Renegar On the Computational Complexity and
Geometry of the First-order Theory of
the Reals. Part III: Quantifier
Elimination . . . . . . . . . . . . . . 329--352
William Y. Sit An Algorithm for Solving Parametric
Linear Systems . . . . . . . . . . . . . 353--394
Tateaki Sasaki and
Masayuki Suzuki Three New Algorithms for Multivariate
Polynomial GCD . . . . . . . . . . . . . 395--412 (or 395--411??)
Manuel Bronstein On Solutions of Linear Ordinary
Differential Equations in Their
Coefficient Field . . . . . . . . . . . 413--440 (or 413--439??)
Jochen Dörre and
William C. Rounds On Subsumption and Semiunification in
Feature Algebras . . . . . . . . . . . . 441--461
Bernard Beauzamy Products of Polynomials and a Priori
Estimates for Coefficients in Polynomial
Decompositions: A Sharp Result . . . . . 463--472
William W. Adams and
Ann K. Boyle Some results on Gröbner bases over
commutative rings . . . . . . . . . . . 473--484
Dinesh Manocha and
John F. Canny Implicit Representation of Rational
Parametric Surfaces . . . . . . . . . . 485--510
Robert Grossman and
Richard G. Larson Symbolic Computation of Derivations
Using Labelled Trees . . . . . . . . . . 511--524 (or 511--523??)
Paul H. Knowles Integration of a Class of Transcendental
Liouvillian Functions with
Error-Functions, Part I . . . . . . . . 525--544 (or 525--543??)
Richard J. Fateman A Review of Mathematica . . . . . . . . 545--579
Wolfram Koepf Power Series in Computer Algebra . . . . 581--604 (or 581--603??)
Maurice Mignotte On the Product of the Largest Roots of a
Polynomial . . . . . . . . . . . . . . . 605--612 (or 605--611??)
Ricardo Caferra and
Nicolas Zabel A Method for Simultaneous Search for
Refutations and Models by Equational
Constraint Solving . . . . . . . . . . . 613--642 (or 613--641??)
J. E. F. Guimaraes and
G. R. Heppler and
S. R. Czapor On the Derivation and Reduction of $C^1$
Trigonometric Basis Functions Using
Maple . . . . . . . . . . . . . . . . . 643--676 (or 643--675??)
Yeow Meng Chee On Graphical Quintuple Systems . . . . . 677--682 (or 677--681??)
W. Sarlet and
J. Vanden Bonne REDUCE-Procedures for the Study of
Adjoint Symmetries of Second- Order
Differential Equations . . . . . . . . . 683--693
Volker Weispfenning Comprehensive Gröbner Bases . . . . . . . 1--30 (or 1--29??)
Dave Bayer and
Mike Stillman Computation of Hilbert Functions . . . . 31--50
Mohamed Adi and
Claude Kirchner AC-Unification Race: The System Solving
Approach, Implementation and Benchmarks 51--70
Robert Harper Constructing Type Systems over an
Operational Semantics . . . . . . . . . 71--84
Volker Dietrich ELISE, an Algorithm to Compute
Asymptotic Representations for Solutions
of Linear Differential Equations,
Realized with the Computer Algebra
System MAPLE . . . . . . . . . . . . . . 85--92
J. Richardson The Blockhandler and the Bitfield
package . . . . . . . . . . . . . . . . 93--102 (or 93--101??)
John Carminati and
John S. Devitt and
Greg J. Fee Isogroups of Differential Equations
Using Algebraic Computing . . . . . . . 103--120
B. Buchberger Special Issue of JSC on ``Symbolic
Computation in Combinatorics'' ---
Foreward of the Editor-in-Chief . . . . 121--122
P. Paule and
D. Zeilberger Special Issue of JSC on ``Symbolic
Computation in Combinatorics'' ---
Foreward of the Guest Editors . . . . . 123--126
François Bergeron and
Nantel Bergeron Symbolic Manipulation for the Study of
the Descent Algebra of Finite Coxeter
Groups . . . . . . . . . . . . . . . . . 127--140 (or 127--139??)
Frank G. Garvan and
Gaston H. Gonnet A proof of the two parameter $q$-cases
of the Macdonald-Morris constant term
root system conjecture for ${S}({F}_4)$
and ${S}({F}_4)^\vee$ via Zeilberger's
method . . . . . . . . . . . . . . . . . 141--178 (or 141--177??)
Ira M. Gessel Super Ballot Numbers . . . . . . . . . . 179--194
Adalbert Kerber and
Axel Kohnert and
Alain Lascoux SYMMETRICA, an Object Oriented
Computer-Algebra System for the
Symmetric Group . . . . . . . . . . . . 195--204 (or 195--203??)
Axel Kohnert Schubert Polynomials and Skew Schur
Functions . . . . . . . . . . . . . . . 205--210
Gilbert Labelle Counting Asymmetric Enriched Trees . . . 211--242
Marko Petkov\vsek Hypergeometric Solutions of Linear
Recurrences with Polynomial Coefficients 243--264
Nobuki Takayama An Approach to the Zero Recognition
Problem by Buchberger Algorithm . . . . 265--282
Thierry Boy de la Tour An Optimality Result for Clause Form
Translation . . . . . . . . . . . . . . 283--302 (or 283--301??)
Daniel J. Dougherty and
Patricia Johann An improved general ${E}$-unification
method . . . . . . . . . . . . . . . . . 303--320
Dale Miller Unification Under a Mixed Prefix . . . . 321--358
Louxin Zhang Some Properties of Finite Special
String-Rewriting Systems . . . . . . . . 359--370 (or 359--369??)
George F. McNulty A Field Guide to Equational Logic . . . 371--398 (or 371--397??)
Kazuhiro Yokoyama and
Masayuki Noro and
Taku Takeshima Solutions of Systems of Algebraic
Equations and Linear Maps on Residue
Class Rings . . . . . . . . . . . . . . 399--417
Pierre Lescanne Well Rewrite Orderings and Well
Quasi-Orderings . . . . . . . . . . . . 419--436 (or 419--435??)
Ralf Treinen A New Method for Undecidability Proofs
of First Order Theories . . . . . . . . 437--458 (or 437--457??)
Xiao Shan Gao and
Shang-Ching Chou Implicitization of Rational Parametric
Equations . . . . . . . . . . . . . . . 459--470
Franz Pauer On Lucky Ideals for Gröbner Basis
Computations . . . . . . . . . . . . . . 471--482
Elizabeth W. Rutman Gröbner Bases and Primary Decomposition
of Modules . . . . . . . . . . . . . . . 483--504 (or 483--503??)
Ba Zhong Shen Solving a Congruence on a Graded Algebra
by a Subresultant Sequence and its
Application . . . . . . . . . . . . . . 505--522
Christine Barbier and
Peter Bettess and
Jacqueline A. Bettess Automatic Generation of Mapping
Functions for Infinite Elements Using
REDUCE . . . . . . . . . . . . . . . . . 523--534
Eric Domenjoud AC Unification Through Order-Sorted AC1
Unification . . . . . . . . . . . . . . 537--556
Josef Schicho On the Choice of Pencils in the
Parametrization of Curves . . . . . . . 557--576
Etienne Paul A General Refutational Completeness
Result for an Inference Procedure Based
on Associative --- Commutative
Unification . . . . . . . . . . . . . . 577--618
Daniel Richardson Computing the Topology of a Bounded
Non-Algebraic Curve in the Plane . . . . 619--644 (or 619--643??)
David Berque and
Ronald Cecchini and
Mark Goldberg and
Reid Rivenburgh The Set Player System for Symbolic
Computation on Power Sets . . . . . . . 645--662
Laurence Puel and
Ascánder Suárez Compiling Pattern Matching by Term
Decomposition . . . . . . . . . . . . . 1--26
G. Sidebottom Implementing CLP(IB) using the
connection theorem proving method and a
clause management system . . . . . . . . 27--48
W. W. Adams and
A. Boyle and
P. Loustaunau Transitivity for Weak and Strong Gröbner
Bases . . . . . . . . . . . . . . . . . 49--66 (or 49--65??)
Stanley Burris and
John Lawrence The Equivalence Problem for Finite Rings 67--72 (or 67--71??)
D. M. Klimov and
V. V. Leonov and
V. M. Rudenko The study of motion for a gyroscope with
gimbal suspension: obtaining the highest
approximations for a drift of Magnus . . 73--78
J. P. Bennett and
M. Grinfeld and
J. Hubble Computer Algebra Techniques in Affinity
Binding Equations: the Dimer Case . . . 79--84 (or 79--83??)
A. Yu. Zharkov Computer Classification of the
Integrable Coupled Kdv-like Systems with
Unit Main Matrix . . . . . . . . . . . . 85--90
Harry S. D. Mills Symbolically precise solutions to a
homogeneous second order matrix ordinary
differential equation with Macsyma . . . 91--98
Dinesh Manocha and
John F. Canny MultiPolynomial Resultant Algorithms . . 99--122
Hirokazu Murao and
Hidetsune Kobayashi and
Tetsuro Fujise On factorizing the symbolic
${U}$-resultant---application of the
${\rm ddet}$ operator . . . . . . . . . 123--142
Michael Kalkbrener A Generalized Euclidean Algorithm for
Computing Triangular Representations of
Algebraic Varieties . . . . . . . . . . 143--168 (or 143--167??)
Tudor Jebelean An Algorithm for Exact Division . . . . 169--180
Carla Limongelli On an Efficient Algorithm for Big
Rational Number Computations by Parallel
$p$-adics . . . . . . . . . . . . . . . 181--198 (or 181--197??)
Hans-Gert Gräbe On Lucky Primes . . . . . . . . . . . . 199--210 (or 199--209??)
Martin Wursthorn Isomorphisms of modular group algebras:
An algorithm and its application to
groups of order $2^6$ . . . . . . . . . 211--228 (or 211--227??)
Greg Butler and
John J. Cannon On Holt's Algorithm . . . . . . . . . . 229--234 (or 229--233??)
Satish R. Thatte Finite Acyclic Theories are Unitary . . 235--249
Thomas Becker Standard Bases in Power Series Rings:
Uniqueness and Superfluous Critical
Pairs . . . . . . . . . . . . . . . . . 251--266 (or 251--265??)
Elizabeth W. Rutman Primary Decomposition of Modules: Two
Variables over a Field . . . . . . . . . 267--276 (or 267--275??)
Thomas W. Dubé A Combinatorial Proof of the Effective
Nullstellensatz . . . . . . . . . . . . 277--296
Frank Lippok On the Representation of 1 by Binary
Cubic Forms of Positive Discriminant . . 297--314 (or 297--313??)
Jesse Ira Deutsch Identities arising from Hecke
transformations of modular forms over
${\bf Q}(\sqrt{2})$ and ${\bf
Q}(\sqrt{3})$ . . . . . . . . . . . . . 315--324 (or 315--323??)
Robert A. Wilson The Brauer tree for ${J}_3$ in
characteristic $17$ . . . . . . . . . . 325--330
Aart Middeldorp and
Yoshihito Toyama Completeness of Combinations of
Constructor Systems . . . . . . . . . . 331--348
Rongdong Wang and
Peng-yung Woo Automatic computation of $z$- & inverse
$z$-transformations by Maple . . . . . . 349--363
François Bergeron Surprising Mathematics Using A Computer
Algebra System . . . . . . . . . . . . . 365--370
Guy Viry Factorization of Multivariate
Polynomials with Coefficients in ${\bf
F}_p$ . . . . . . . . . . . . . . . . . 371--392 (or 371--391??)
Bernard Beauzamy and
Vilmar Trevisan and
Paul S. Wang Polynomial Factorization: Sharp Bounds,
Efficient Algorithms . . . . . . . . . . 393--414 (or 393--413??)
Wayne Snyder A Fast Algorithm for Generating Reduced
Ground Rewriting Systems from a Set of
Ground Equations . . . . . . . . . . . . 415--450
C. N. Zhang and
B. Shirazi and
D. Y. Y. Yun An Efficient Algorithm and Parallel
Implementations for Binary and Residue
Number Systems . . . . . . . . . . . . . 451--462
W. Bibel and
A. W. Biermann Special Issue: Automatic Programming ---
Foreword of the Guest Editors . . . . . 463--466
Nachum Dershowitz and
Uday S. Reddy Deductive and Inductive Synthesis of
Equational Programs . . . . . . . . . . 467--494
Dmitri Boulanger and
Maurice Bruynooghe Deriving Fold/Unfold Transformations of
Logic Programs Using Extended OLDT-Based
Abstract Interpretation . . . . . . . . 495--522 (or 495--521??)
A. van Deursen and
P. Klint and
F. Tip Origin Tracking . . . . . . . . . . . . 523--546 (or 523--545??)
Philippe Clauss and
Catherine Mongenet Synthesis Aspects in the Design of
Efficient Processor Arrays from Affine
Recurrence Equations . . . . . . . . . . 547--570 (or 547--569??)
Douglas R. Smith Constructing Specification Morphisms . . 571--606
Christine Paulin-Mohring and
Benjamin Werner Synthesis of ML Programs in the System
Coq . . . . . . . . . . . . . . . . . . 607--640
Yukihide Takayama ${\rm QPC}_2$: a constructive calculus
with parameterized specifications . . . 641--672
Eugenio G. Omodeo and
Franco Parlamento and
Alberto Policriti A Derived Algorithm for Evaluating,
$\epsilon$-Expressions over Abstract
Sets . . . . . . . . . . . . . . . . . . 673--704
Ritu Chadha and
David A. Plaisted On the Mechanical Derivation of Loop
Invariants . . . . . . . . . . . . . . . 705--744
N. Dershowitz and
Y.-L. Lee Logical Debugging . . . . . . . . . . . 745--774 (or 745--773??)
Pierre Flener and
Yves Deville Logic Program Synthesis from Incomplete
Specifications . . . . . . . . . . . . . 775--806 (or 775--805??)
Amr F. Fahmy and
Alan W. Biermann Synthesis of Real Time Acceptors . . . . 807--842
M. Ph. Saux Picart Schur-Cohn Sub-Transforms of a
Polynomial . . . . . . . . . . . . . . . 1--8 (or 1--7??)
Michael F. Singer and
Felix Ulmer Galois Groups of Second and Third Order
Linear Differential Equations . . . . . 9--36
Michael F. Singer and
Felix Ulmer Liouvillian and Algebraic Solutions of
Second and Third Order Linear
Differential Equations . . . . . . . . . 37--74 (or 37--73??)
M. Kalkbrener and
M. Sweedler and
L. Taylor Low Degree Solutions to Linear Equations
with $K(x)$ Coefficients . . . . . . . . 75--81
Dong Ming Wang An Elimination Method for Polynomial
Systems . . . . . . . . . . . . . . . . 83--114
David W. Boyd Bounds for the Height of a Factor of a
Polynomial in Terms of Bombieri's Norms:
I. The Largest Factor . . . . . . . . . 115--130
David W. Boyd Bounds for the Height of a Factor of a
Polynomial in Terms of Bombieri's Norms:
II. The Smallest Factor . . . . . . . . 131--145
G. E. Andrews and
P. Paule Some Questions Concerning
Computer-Generated Proofs of a Binomial
Double-Sum Identity . . . . . . . . . . 147--154 (or 147--153??)
Peter Schorn An Axiomatic Approach to Robust
Geometric Programs . . . . . . . . . . . 155--166 (or 155--165??)
Klaus Madlener and
Andrea Sattler-Klein and
Friedrich Otto On the Problem of Generating Small
Convergent Systems . . . . . . . . . . . 167--188 (or 167--187??)
T. Torgersen Parallel Scheduling of Recursively
Defined Arrays: Revisited . . . . . . . 189--226
Paul H. Knowles Integration of a Class of Transcendental
Liouvillian Functions with
Error-Functions, Part II . . . . . . . . 227--242 (or 227--241??)
Petr Lison\vek and
Peter Paule and
Volker Strehl Improvement of the Degree Setting in
Gosper's Algorithm . . . . . . . . . . . 243--258
J. H. Rieger Computing View Graphs of Algebraic
Surfaces . . . . . . . . . . . . . . . . 259--272
Alyson Reeves and
Bernd Sturmfels A Note on Polynomial Reduction . . . . . 273--278 (or 273--277??)
Ralph Freese and
J. Je\vzek and
J. B. Nation Term Rewrite Systems for Lattice Theory 279--288
Irvin Roy Hentzel and
David P. Jacobs and
Sekhar V. Muddana Experimenting with the Identity
$(xy)z=y(zx)$ . . . . . . . . . . . . . 289--294 (or 289--293??)
István Gaál On the Resolution of ${F}(x,y)={G}(x,y)$ 295--304 (or 295--303??)
E. A. O'Brien Isomorphism Testing for $p$-Groups . . . 305--320
István Gaál A Fast Algorithm for Finding ``Small''
Solutions of $F(x,y)=G(x,y)$ over
Imaginary Quadratic Fields . . . . . . . 321--328
J. C. Faugere and
P. Gianni and
D. Lazard and
T. Mora Efficient Computation of
Zero-Dimensional Gröbner Bases by Change
of Ordering . . . . . . . . . . . . . . 329--344
Michael Vaughan-Lee An Algorithm for Computing Graded
Algebras . . . . . . . . . . . . . . . . 345--354
Yiu-Kwong Man On Computing Closed Forms for Indefinite
Summations . . . . . . . . . . . . . . . 355--376
John P. Boyd Chebyshev and Legendre Spectral Methods
in Algebraic Manipulation Languages . . 377--399
Harald Niederreiter and
Rainer Göttfert Factorization of Polynomials over Finite
Fields and Characteristic Sequences . . 401--412
Greg Butler The Transitive Groups of Degree Fourteen
and Fifteen . . . . . . . . . . . . . . 413--422
Yiu-Kwong Man Computing Closed Form Solutions of First
Order ODEs Using the Prelle-Singer
Procedure . . . . . . . . . . . . . . . 423--444 (or 423--443??)
Peter Baumgartner and
Ulrich Furbach Consolution as a Framework for Comparing
Calculi . . . . . . . . . . . . . . . . 445--477
Alessandro Berarducci and
Marisa Venturini Zilli Generalizations of Unification . . . . . 478--492 (or 479--491??)
Evelyne Contejean Solving $*$-problems modulo
distributivity by a reduction to ${\rm
AC}1$-unification . . . . . . . . . . . 493--521
Amnon Rosenmann An Algorithm for Constructing Gröbner and
Free Schreier Bases in Free Group
Algebras . . . . . . . . . . . . . . . . 523--550 (or 523--549??)
Arno van den Essen An algorithm to compute the invariant
ring of a ${\bf G}_a$-action on an
affine variety . . . . . . . . . . . . . 551--556 (or 551--555??)
David P. Jacobs and
Sekhar V. Muddana The Word Problem for Free Partially
Commutative, Partially Associative
Groupoids . . . . . . . . . . . . . . . 557--562
István Gaál and
Attila Pethö and
Michael Pohst On the Resolution of Index Form
Equations in Quartic Number Fields . . . 563--584
Xiao Shan Gao and
Shang-Ching Chou A Zero Structure Theorem for
Differential Parametric Systems . . . . 585--596 (or 585--595??)
Alexandre Boudet Combining Unification Algorithms . . . . 597--626
Aart Middeldorp Completeness of Combinations of
Conditional Constructor Systems . . . . 3--21
H. Zantema Termination of term rewriting:
interpretation and type elimination . . 23--50
Claus-Peter Wirth and
Bernhard Gramlich A Constructor-Based Approach to
Positive/Negative-Conditional Equational
Specifications . . . . . . . . . . . . . 51--90
Dieter Hofbauer and
Maria Huber Linearizing Term Rewriting Systems Using
Test Sets . . . . . . . . . . . . . . . 91--129
E. A. O'Brien Isomorphism Testing for $p$-Groups . . . 133--148 (or 133--147??)
Ralf Fröberg and
Joachim Hollman Hilbert Series for Ideals Generated by
Generic Forms . . . . . . . . . . . . . 149--158 (or 149--157??)
Ronald Brown and
Andrew Tonks Calculations with Simplicial and Cubical
Groups in AXIOM . . . . . . . . . . . . 159--180 (or 159--179??)
Alex Kean and
George Tsiknis A corrigendum for the optimized-IPIA:
``An incremental method for generating
prime implicants/implicates'' [J.
Symbolic Comput. \bf 9 (1990), no. 2,
185--206, MR 91h:68071] . . . . . . . . 181--188 (or 181--187??)
Hantao Zhang A New Method for the Boolean Ring Based
Theorem Proving . . . . . . . . . . . . 189--212 (or 189--211??)
I. R. Hentzel and
D. P. Jacobs and
S. V. Muddana Erratum: ``Experimenting with the
identity $(xy)z=y(zx)$'' [J. Symbolic
Comput. 16 (1993), no. 3, 289--293, MR
94i:20101] . . . . . . . . . . . . . . . 213--213
Thomas Eiter Exact transversal hypergraphs and
application to Boolean $\mu$-functions 215--226 (or 215--225??)
Bruno Salvy Fast Computation of Some Asymptotic
Functional Inverses . . . . . . . . . . 227--236
Richard A. Davis Idempotent Computation over Finite
Fields . . . . . . . . . . . . . . . . . 237--258
Michel Dehon Classifying Geometries with Cayley . . . 259--276
Maurice Mignotte and
Philippe Glesser On the Smallest Divisor of a Polynomial 277--282
V. P. Gusynin and
V. V. Kornyak Symbolic Computation of
DeWitt-Seeley-Gilkey Coefficients on
Curved Manifolds . . . . . . . . . . . . 283--294
K. Mehlhorn and
S. Näher and
Nievergelt J. Special Issue on Algorithms:
Implementation, Libraries and
Use---Introduction of the Guest Editors 295
J. Nievergelt Complexity, Algorithms, Programs,
Systems: The Shifting Focus . . . . . . 297--310
P. Schorn Evolution of a Software System:
Interaction, Interfaces and Applications
in the XYZ GeoBench . . . . . . . . . . 311--320
G. Weber and
L. Knipping and
H. Alt An Application of Point Pattern Matching
in Astronautics . . . . . . . . . . . . 321--340
D. Raymond and
D. Wood Grail: A C++ Library for Automata and
Expressions . . . . . . . . . . . . . . 341--350
Emo Welzl and
Barbara Wolfers Surface Reconstruction between Simple
Polygons via Angle Criteria . . . . . . 351--369
Victor Shoup Fast Construction of Irreducible
Polynomials over Finite Fields . . . . . 371--391
Kim S. Larsen and
Michael I. Schwartzbach Injectivity of Composite Functions . . . 393--408
Andrea Lucchini and
Federico Menegazzo Computing a Set of Generators of Minimal
Cardinality in a Solvable Group . . . . 409--420
Rolf Backofen Regular Path Expressions in Feature
Logic . . . . . . . . . . . . . . . . . 421--455
D. J. Herbert Symbolic Local Refinement of Tetrahedral
Grids . . . . . . . . . . . . . . . . . 457--472
Jeffrey Shallit and
Jonathan Sorenson Analysis of a Left-Shift Binary GCD
Algorithm . . . . . . . . . . . . . . . 473--486
Patrick A. Worfolk Zeros of Equivariant Vector Fields:
Algorithms for an Invariant Approach . . 487--512 (or 487--511??)
Gene Cooperman and
Larry Finkelstein A Random Base Change Algorithm for
Permutation Groups . . . . . . . . . . . 513--528
Klaus Lux and
Jürgen Müller and
Michael Ringe Peakword condensation and submodule
lattices: an application of the MEAT-AXE 529--544
Kazuhiro Yokoyama and
Masayuki Noro and
Taku Takeshima Multi-Modular Approach to
Polynomial-Time Factorization of
Bivariate Integral Polynomials . . . . . 545--563
H. A. Priestley and
M. P. Ward A Multipurpose Backtracking Algorithm 1--40
Pierangelo Miglioli and
Ugo Moscato and
Mario Ornaghi Abstract Parametric Classes and Abstract
Data Types defined by Classical and
Constructive Logical Methods . . . . . . 41--82 (or 41--81??)
Ivo Düntsch A Microcomputer Based System for Small
Relation Algebras . . . . . . . . . . . 83--86
Craig R. Orr and
Doron Zeilberger A Computer Algebra Approach to the
Discrete Dirichlet Problem . . . . . . . 87--90
Robert Cremanns and
Friedrich Otto Finite derivation type implies the
homological finiteness condition ${\rm
FP}_3$ . . . . . . . . . . . . . . . . . 91--112
Hél\`ene Kirchner and
Christophe Ringeissen Combining Symbolic Constraint Solvers on
Algebraic Domains . . . . . . . . . . . 113--156 (or 113--155??)
Susumu Yamasaki and
Kentaro Iida Transformation of Logic Programs to FP
Programs Based on Dataflows . . . . . . 157--182
Victor Y. Pan Simple Multivariate Polynomial
Multiplication . . . . . . . . . . . . . 183--186
Xiang Dong Wang The Hecke operators on
${S}_k({\Gamma}_1({N}))$ . . . . . . . . 187--198
Klaus Meer Real Number Computations: On the Use of
Information . . . . . . . . . . . . . . 199--206
Hiroyuki Sawada and
Satoshi Terasaki and
Akira Aiba Parallel Computation of Gröbner Bases on
Distributed Memory Machines . . . . . . 207--222
Toshinori \=Oaku and
Takeshi Shimoyama A Gröbner Basis Method for Modules over
Rings of Differential Operators . . . . 223--248
Dong Ming Wang Differentiation and Integration of
Indefinite Summations with Respect to
Indexed Variables --- Some Rules and
Applications . . . . . . . . . . . . . . 249--264 (or 249--263??)
M. Sofroniou Symbolic Derivation of Runge-Kutta
Methods . . . . . . . . . . . . . . . . 265--296
D. Lugiez and
J. L. Moysset Tree automata help one to solve
equational formulae in AC-theories . . . 297--318
Iréne Durand Bounded, Strongly Sequential and
Forward-Branching Term Rewriting Systems 319--352
Mark van Hoeij An Algorithm for Computing an Integral
Basis in an Algebraic Function Field . . 353--364 (or 353--363??)
Michael Kalkbrener Prime Decompositions of Radicals in
Polynomial Rings . . . . . . . . . . . . 365--372
Freyja Hreinsdóttir A Case Where Choosing a Product Order
Makes the Calculations of a Gröbner Basis
Much Faster . . . . . . . . . . . . . . 373--378
Maurice Mignotte and
Philippe H. Glesser Landau's Inequality via Hadamard's . . . 379--384 (or 379--383??)
Felix Ulmer Irreducible Linear Differential
Equations of Prime Order . . . . . . . . 385--401
Osami Yamamoto On Some Bounds for Zeros of Norm-Bounded
Polynomials . . . . . . . . . . . . . . 403--428 (or 403--427??)
Dominique Duval Algebraic Numbers: An Example of Dynamic
Evaluation . . . . . . . . . . . . . . . 429--446 (or 429--445??)
Abdallah Assi On Flatness of Generic Projections . . . 447--462
Andreas Weiermann Complexity Bounds for Some Finite Forms
of Kruskal's Theorem . . . . . . . . . . 463--488
Krzysztof R. Apt and
Peter van Emde Boas and
Angelo Welling The STO-problem is NP-hard . . . . . . . 489--495
Boo Barkee and
Deh Cac Can and
Julia Ecks and
Theo Moriarty and
R. F. Ree Why You Cannot Even Hope to Use Gröbner
Bases in Public Key Cryptography: An
Open Letter to a Scientist Who Failed
and a Challenge to Those Who Have Not
Yet Failed . . . . . . . . . . . . . . . 497--502 (or 497--501??)
Yonghao Ma On the Minors Defined by a Generic
Matrix . . . . . . . . . . . . . . . . . 503--518
Ming-Deh D. Huang and
Doug Ierardi Efficient Algorithms for the
Riemann-Roch Problem and for Addition in
the Jacobian of a Curve . . . . . . . . 519--540 (or 519--539??)
Alice C. Niemeyer A Finite Soluble Quotient Algorithm . . 541--562 (or 541--561??)
John Pedersen and
Margaret Yoder Term Rewriting for the Conjugacy Problem
and the Braid Groups . . . . . . . . . . 563--572
Luca Gemignani Solving Hankel Systems over the Integers 573--584
Eric Bach Tensor Products and Computability . . . 585--593
Bo Yi and
Jia Fu Xu Analogical Type Theory . . . . . . . . . 3--24
Andreas Weber On Coherence in Computer Algebra . . . . 25--38
Paolo Di Blasio and
Marco Temperini Subtyping Inheritance and Its
Application in Languages for Symbolic
Computation Systems . . . . . . . . . . 39--64 (or 39--63??)
Anthony C. Hearn and
Eberhard Schrüfer A Computer Algebra System Based on
Order-Sorted Algebra . . . . . . . . . . 65--79 (or 65--77??)
Philip S. Santas A Type System for Computer Algebra . . . 79--110 (or 79--109??)
Hoon Hong and
Andreas Neubacher and
Wolfgang Schreiner The Design of the SACLIB/PACLIB Kernels 111--132
A. C. Norman Compact Delivery Support for REDUCE . . 133--143 (or 133--144??)
Tudor Jebelean A Double-Digit Lehmer-Euclid Algorithm
for Finding the GCD of Long Integers . . 145--158 (or 145--157??)
Robert Fournier and
Norbert Kajler and
Bernard Mourrain Visualization of Mathematical Surfaces:
the IZIC Server Approach . . . . . . . . 159--174 (or 159--173??)
Gianna Cioni and
Attilio Colagrossi and
Alfonso Miola A Sequent Calculus for Automated
Reasoning in Symbolic Computation
Systems . . . . . . . . . . . . . . . . 175--200 (or 175--199??)
William M. Farmer and
Joshua D. Guttman and
F. Javier Thayer Contexts in Mathematical Reasoning and
Computation . . . . . . . . . . . . . . 201--216
R. Caferra and
M. Herment A Generic Graphic Framework for
Combining Inference Tools and Editing
Proofs and Formulae . . . . . . . . . . 217--244 (or 217--243??)
Maria Paola Bonacina and
Jieh Hsiang Distributed Deduction by
Clause-Diffusion: Distributed
Contraction and the Aquarius Prover . . 245--268 (or 245--267??)
A. Diaz and
M. Hitz and
E. Kaltofen and
A. Lobo and
T. Valente Process Scheduling in DSC and the Large
Sparse Linear Systems Challenge . . . . 269--282
Manfred Göbel Computing Bases for Rings of
Permutation-Invariant Polynomials . . . 285--292 (or 285--291??)
D. E. G. Malm and
T. N. Subramaniam The Summation of Rational Functions by
an Extended Gosper Algorithm . . . . . . 293--304
Alain Poli A deterministic construction of normal
bases with complexity $O(n^3 + n \log n
\log(\log n) \log q)$ . . . . . . . . . 305--320 (or 305--319??)
Robert Nieuwenhuis and
Albert Rubio Theorem Proving with Ordering and
Equality Constrained Clauses . . . . . . 321--352 (or 321--351??)
Matthias Baaz and
Christian G. Fermüller Resolution-based Theorem Proving for
Many-valued Logics . . . . . . . . . . . 353--391
Hong R. Lee and
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 and
Jürgen Weiss Homogeneous Bivariate Decompositions . . 409--434
Ilaria del Corso Factorization of Prime Ideal Extensions
in Dedekind Domains . . . . . . . . . . 435--440 (or 435--439??)
Joachim Apel A Gröbner Approach to Involutive Bases 441--458 (or 441--457??)
S. Carmody and
M. Leeming and
R. F. C. Walters The Todd-Coxeter Procedure and Left Kan
Extensions . . . . . . . . . . . . . . . 459--488
Jaroslav Je\vzek and
George F. McNulty Perfect Bases for Equational Theories 489--505
Miguel Filgueiras and
Ana Paula Tomás A Fast Method for Finding the Basis of
Non-negative Solutions to a Linear
Diophantine Equation . . . . . . . . . . 507--526
Cesar Alonso and
Jaime Gutierrez and
Tomas Recio A rational function decomposition
algorithm by near-separated polynomials 527--544
Hans-Gert Gräbe Algorithms in Local Algebra . . . . . . 545--558 (or 545--557??)
Peter A. Hendriks and
Marius van der Put Galois Action on Solutions of a
Differential Equation . . . . . . . . . 559--576
Scott H. Murray and
E. A. O'Brien Selecting Base Points for the
Schreier-Sims Algorithm for Matrix
Groups . . . . . . . . . . . . . . . . . 577--584
Gerhard Hiss and
Klaus Lux and
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
Enno Ohlebusch Modular Properties of Composable Term
Rewriting Systems . . . . . . . . . . . 1--42 (or 1--41??)
Hans Zantema Total Termination of Term Rewriting is
Undecidable . . . . . . . . . . . . . . 43--60
István Gaál Computing Elements of Given Index in
Totally Complex Cyclic Sextic Fields . . 61--70 (or 61--69??)
Graham Norton On $n$-Dimensional Sequences. I . . . . 71--92
Graham Norton On the Minimal Realizations of a Finite
Sequence . . . . . . . . . . . . . . . . 93--115
Ioannis Z. Emiris and
John F. Canny Efficient Incremental Algorithms for the
Sparse Resultant and the Mixed Volume 117--150 (or 117--149??)
François Arnault Constructing Carmichael Numbers Which
are Strong Pseudoprimes to Several Bases 151--162 (or 151--161??)
Günter Czichowski A Note on Gröbner Bases and Integration
of Rational Functions . . . . . . . . . 163--168 (or 163--167??)
John Shackell and
Bruno Salvy Asymptotic Forms and Algebraic
Differential Equations . . . . . . . . . 169--178 (or 169--177??)
Gernot Haager and
Gerd Baumann and
Theo F. Nonnenmacher An algorithm to determine potential
systems in Mathematica . . . . . . . . . 179--196
David Hartley and
Philip Tuckey Gröbner Bases in Clifford and Grassmann
Algebras . . . . . . . . . . . . . . . . 197--206 (or 197--205??)
B. Curtis Eaves and
Uriel G. Rothblum Linear Problems and Linear Algorithms 207--214
Max Dauchet and
Anne-Cécile Caron and
Jean-Luc Coquidé Automata for Reduction Properties
Solving . . . . . . . . . . . . . . . . 215--233
Peter Paule Greatest Factorial Factorization and
Symbolic Summation . . . . . . . . . . . 235--268
Gilles Villard Generalized Subresultants for Computing
the Smith Normal Form of Polynomial
Matrices . . . . . . . . . . . . . . . . 269--286
George E. Collins and
Mark J. Encarnación Efficient Rational Number Reconstruction 287--298 (or 287--297??)
Mark J. Encarnación Computing GCDs of Polynomials over
Algebraic Number Fields . . . . . . . . 299--314 (or 299--313??)
Alberto Policriti and
Jacob T. Schwartz ${T}$-theorem proving. I . . . . . . . . 315--342
Miki Hermann and
Phokion G. Kolaitis The Complexity of Counting Problems in
Equational Matching . . . . . . . . . . 343--362
Victor Shoup A New Polynomial Factorization Algorithm
and its Implementation . . . . . . . . . 363--398 (or 363--397??)
Wolfram Koepf Algorithms for $m$-Fold Hypergeometric
Summation . . . . . . . . . . . . . . . 399--418 (or 399--417??)
Catherine S. Greenhill Theoretical and Experimental Comparison
of Efficiency of Finite Field Extensions 419--430 (or 419--429??)
D. Lugiez Positive and Negative Results for
Higher-Order Disunification . . . . . . 431--470
Janusz Konieczny Reduced Idempotents in the Semigroup of
Boolean Matrices . . . . . . . . . . . . 471--482
P. Paule and
V. Strehl Special Issue: Symbolic Computation in
Combinatorics $\Delta_1$: Foreword of
the Guest Editors . . . . . . . . . . . 483--486
George E. Andrews On a Conjecture of Peter Borwein . . . . 487--502 (or 487--501??)
M. Delest and
J. P. Dubernard and
I. Dutour Parallelogram Polyominoes and Corners 503--516 (or 503--515??)
Frank G. Garvan Ramanujan's Theories of Elliptic
Functions to Alternative Bases --- a
Symbolic Excursion . . . . . . . . . . . 517--536
Ira M. Gessel Finding Identities with the WZ Method 537--566
Gilbert Labelle Some Combinatorial Results First Found
Using Computer Algebra . . . . . . . . . 567--594
Petr Lison\vek Closed Forms for the Number of Polygon
Dissections . . . . . . . . . . . . . . 595--602 (or 595--601??)
Roberto Pirastu and
Kurt Siegl Parallel computation and indefinite
summation: a $\Vert$MAPLE$\Vert$
application for the rational case . . . 603--616
Roberto Pirastu and
Volker Strehl Rational summation and
Gosper-Petkov\vsek representation . . . 617--636 (or 617--635??)
Nobuki Takayama An Algorithm for Finding Recurrence
Relations of Binomial Sums and its
Complexity . . . . . . . . . . . . . . . 637--652 (or 637--651??)
Philippe Flajolet and
Bruno Salvy Computer Algebra Libraries for
Combinatorial Structures . . . . . . . . 653--672 (or 653--671??)
Peter Paule and
Markus A. Schorn A Mathematica Version of Zeilberger's
Algorithm for Proving Binomial
Coefficient Identities . . . . . . . . . 673--698
Doron Zeilberger Three Recitations on Holonomic Systems
and Hypergeometric Series . . . . . . . 699--724
Volker Strehl and
Herbert S. Wilf Five Surprisingly Simple Complexities 725--730 (or 725--729??)
Herbert S. Wilf The Computer-Aided Discovery of a
Theorem about Young Tableaux . . . . . . 731--736 (or 731--735??)
C. Krattenthaler HYP and HYPQ: Mathematica packages for
the manipulation of binomial sums and
hypergeometric series, respectively
$q$-binomial sums and basic
hypergeometric series . . . . . . . . . 737--744
István Nemes and
Marko Petkov\vsek RComp: A \em Mathematica Package for
Computing with Recursive Sequences . . . 745--754 (or 745--753??)
John R. Stembridge A Maple Package for Symmetric Functions 755--768
Graham Norton Corrigenda: ``On $n$-dimensional
sequences. I'' [J. Symbolic Comput.\ 20
(1995), no. 1, 71--92, 1 374 225] . . . 769--770
Chung-Jen Ho and
Chee Keng Yap The Habicht Approach to Subresultants 1--14
Richard Kennaway and
Jan Willem Klop and
Ronan Sleep and
Fer-Jan de Vries Comparing Curried and Uncurried
Rewriting . . . . . . . . . . . . . . . 15--40 (or 15--39??)
Peter Padawitz Inductive Theorem Proving for Design
Specifications . . . . . . . . . . . . . 41--100 (or 41--99??)
M. Sofroniou Order Stars and Linear Stability Theory 101--131
David Casperson and
David Ford and
John McKay Ideal Decompositions and Subfields . . . 133--138 (or 133--137??)
J. Lyn Miller Analogs of Gröbner Bases in Polynomial
Rings over a Ring . . . . . . . . . . . 139--154 (or 139--153??)
Franz Pauer and
Sandro Zampieri Gröbner Bases with Respect to Generalized
Term Orders and their Application to the
Modelling Problem . . . . . . . . . . . 155--168
A. G. Helminck Computing ${B}$-orbits on ${G}/{H}$ . . 169--210 (or 169--209??)
Franz Baader and
Klaus U. Schulz Unification in the Union of Disjoint
Equational Theories: Combining Decision
Procedures . . . . . . . . . . . . . . . 211--244 (or 211--243??)
Nestor E. Sanchez The Method of Multiple Scales:
Asymptotic Solutions and Normal Forms
for Nonlinear Oscillatory Problems . . . 245--252
Claude Marché Normalized Rewriting: An Alternative to
Rewriting Modulo a Set of Equations . . 253--288
Benedetto Intrigila and
Marisa Venturini Zilli A Remark on Infinite Matching vs.
Infinite Unification . . . . . . . . . . 289--292
Giuseppe Attardi and
Tito Flagella Memory Management in the PoSSo Solver 293--312 (or 293--311??)
George E. Collins and
Mark J. Encarnación Improved Techniques for Factoring
Univariate Polynomials . . . . . . . . . 313--328 (or 313--327??)
George Fix and
Chih-Ping Hsu and
Tie Luo Implicitization of Rational Parametric
Surfaces . . . . . . . . . . . . . . . . 329--336
Vladimir P. Gerdt and
Vladimir V. Kornyak Construction of Finitely Presented Lie
Algebras and Superalgebras . . . . . . . 337--350 (or 337--349??)
Gregor Kemper Calculating Invariant Rings of Finite
Groups over Arbitrary Fields . . . . . . 351--366
Nigel Smart Solving Discriminant Form Equations Via
Unit Equations . . . . . . . . . . . . . 367--374
H. Hong Special Issue on Parallel Symbolic
Computation: Foreword of the Guest
Editor . . . . . . . . . . . . . . . . . 377--377
Hirokazu Murao and
Tetsuro Fujise Modular Algorithm for Sparse
Multivariate Polynomial Interpolation
and its Parallel Implementation . . . . 377--396
Paul S. Wang Parallel Polynomial Operations on SMPs:
an Overview . . . . . . . . . . . . . . 397--410
Giuseppe Attardi and
Carlo Traverso Strategy-Accurate Parallel Buchberger
Algorithms . . . . . . . . . . . . . . . 411--426 (or 411--425??)
S. Dalmas and
M. Gaetano and
A. Sausse A Distributed and Cooperative
Environment for Computer Algebra . . . . 427--440 (or 427--439??)
Werner Krandick and
Tudor Jebelean Bidirectional Exact Integer Division . . 441--456 (or 441--455??)
Kenneth Weber Parallel Implementation of the
Accelerated Integer GCD Algorithm . . . 457--466
Giovanni Cesari and
Roman Maeder Performance Analysis of the Parallel
Karatsuba Multiplication Algorithm for
Distributed Memory Architectures . . . . 467--474 (or 467--473??)
Reinhard Bündgen and
Manfred Göbel and
Wolfgang Küchlin Strategy Compliant Multi-Threaded Term
Completion . . . . . . . . . . . . . . . 475--506 (or 475--505??)
Maria Paola Bonacina On the Reconstruction of Proofs in
Distributed Theorem Proving: A Modified
Clause-Diffusion Method . . . . . . . . 507--522
J. Denzinger and
S. Schulz Recording and Analysing Knowledge-Based
Distributed Deduction Processes . . . . 523--541 (or 523--542??)
Hantao Zhang and
Maria Paola Bonacina and
Jieh Hsiang PSATO: a Distributed Propositional
Prover and its Application to Quasigroup
Problems . . . . . . . . . . . . . . . . 543--560
Jonathan M. D. Hill and
Keith M. Clarke and
Richard Bornat Parallelizing Imperative Functional
Programs: the Vectorization Monad . . . 561--576
K. Gladitz and
H. Kuchen Shared Memory Implementation of the
Gamma-Operation . . . . . . . . . . . . 577--592 (or 577--591??)
Wolfgang Schreiner A Para-Functional Programming Interface
for a Parallel Computer Algebra Package 593--614
A. Sodan A Semi-Automatic Multiple-Strategy
Approach To Mapping Tree-Structured
Symbolic Processing Programs . . . . . . 615--634
Jean-Marc Andreoli and
Uwe M. Borghoff and
Remo Pareschi The Constraint-Based Knowledge Broker
Model: Semantics, Implementation and
Analysis . . . . . . . . . . . . . . . . 635--668 (or 635--667??)
Koen De Bosschere and
Jean-Marie Jacquet Extending the $\mu$Log Framework with
Local and Conditional Blackboard
Operations . . . . . . . . . . . . . . . 669--698 (or 669--697??)
Ho-Fung Leung and
Keith L. Clark Constraint Satisfaction in Distributed
Concurrent Logic Programming . . . . . . 699--714
P. Lopez and
M. Hermenegildo and
S. Debray A Methodology for Granularity-Based
Control of Parallelism in Logic Programs 715--734
Alexander L. Chistov Polynomial-Time Computation of the
Dimension of Algebraic Varieties in
Zero-Characteristic . . . . . . . . . . 1--26 (or 1--25??)
F. Leon Pritchard The Ideal Membership Problem in
Non-Commutative Polynomial Rings . . . . 27--48
Maribel Fernández AC Complement Problems: Satisfiability
and Negation Elimination . . . . . . . . 49--82
Laureano Gonzalez-Vega Applying Quantifier Elimination to the
Birkhoff Interpolation Problem . . . . . 83--104 (or 83--103??)
Srinivas Tummarakota and
Junghsen Lieh Symbolic Finite Element Modeling of
Structural Systems . . . . . . . . . . . 105--119
Uwe Egly On Different Structure-Preserving
Translations to Normal Form . . . . . . 121--142
Massimo Marchiori On the Modularity of Normal Forms in
Rewriting . . . . . . . . . . . . . . . 143--154
Robert Cremanns and
Friedrich Otto For groups the property of having finite
derivation type is equivalent to the
homological finiteness condition ${\rm
FP}_3$ . . . . . . . . . . . . . . . . . 155--178 (or 155--177??)
Felix Ulmer and
Jacques-Arthur Weil Note on Kovacic's Algorithm . . . . . . 179--200
R. T. Curtis and
Z. Hasan Symmetric Representation of the Elements
of the Janko Group $J_1$ . . . . . . . . 201--214
Francis Buekenhout and
Dimitri Leemans On the List of Finite Primitive
Permutation Groups of Degree $\leq 50$ 215--226 (or 215--225??)
D. Aschenwald and
T. Siegl and
R. F. Tichy MAPinsure ---A MAPLE Package for Life
Insurance . . . . . . . . . . . . . . . 227--234
Dexter Kozen and
Susan Landau and
Richard Zippel Decomposition of Algebraic Functions . . 235--246
Takeshi Shimoyama and
Kazuhiro Yokoyama Localization and Primary Decomposition
of Polynomial Ideals . . . . . . . . . . 247--278 (or 247--277??)
Jordi Levy and
Jaume Agustí Bi-rewrite Systems . . . . . . . . . . . 279--314
Manfred Schmidt-Schauß Decidability of Unification in the
Theory of One-sided Distributivity and a
Multiplicative Unit . . . . . . . . . . 315--344
Jun Zhang Symbolic Computation on Complex
Polynomial Solution of Differential
Equations . . . . . . . . . . . . . . . 345--354
Carlo Traverso Hilbert Functions and the Buchberger
Algorithm . . . . . . . . . . . . . . . 355--376
Victor Y. Pan Computing $x_m \bmod p(x)$ and an
Application to Splitting a Polynomial
Into Factors Over a Fixed Disc . . . . . 377--380
Bruno Salinier and
Robert Strandh Efficient Simulation of
Forward-Branching Systems with
Constructor Systems . . . . . . . . . . 381--400 (or 381--399??)
Zhenyu Qian and
Kang Wang Modular Higher-Order Equational
Preunification . . . . . . . . . . . . . 401--424
István Gaál and
Michael Pohst On the Resolution of Index Form
Equations in Sextic Fields with an
Imaginary Quadratic Subfield . . . . . . 425--434
Marian Mrozek Rigorous Error Analysis of Numerical
Algorithms via Symbolic Computations . . 435--458
Bram de Jager and
Bram van Asch Symbolic Solutions for a Class of
Partial Differential Equations . . . . . 459--468
V. Saraswat and
R. Jagadeesan and
V. Gupta Timed Default Concurrent Constraint
Programming . . . . . . . . . . . . . . 475--520
C. Caleiro and
G. Saake and
A. Sernadas Deriving Liveness Goals from Temporal
Logic Specifications . . . . . . . . . . 521--554 (or 521--553??)
T. Frühwirth Temporal Annotated Constraint Logic
Programming . . . . . . . . . . . . . . 555--584 (or 555--583??)
M. Ahmed and
G. Venkatesh Dense Time Logic Programming . . . . . . 585--614 (or 585--613??)
Joeri Engelfriet and
Jan Treur Executable Temporal Logic for
Non-monotonic Reasoning . . . . . . . . 615--626 (or 615--625??)
M. Fisher Temporal Semantics for Concurrent \sc
MetateM . . . . . . . . . . . . . . . . 627--648
J.-R. Gagne and
J. Plaice A Non-standard Temporal Deductive
Database System . . . . . . . . . . . . 649--664
Edjard Mota and
David Robertson and
Alan Smaill NatureTime: Temporal Granularity in
Simulation of Ecosystems . . . . . . . . 665--698
Chuchang Liu and
M. A. Orgun Dealing with Multiple Granularity of
Time in Temporal Logic Programming . . . 699--720
Anonymous Executable Temporal Logic Systems . . . 721--735
Robert Nieuwenhuis and
Albert Rubio Paramodulation with Built-in AC-Theories
and Symbolic Constraints . . . . . . . . 1--22 (or 1--21??)
Christopher Lynch Oriented Equational Logic Programming is
Complete . . . . . . . . . . . . . . . . 23--46 (or 23--45??)
Adel Bouhoula Automated Theorem Proving by Test Set
Induction . . . . . . . . . . . . . . . 47--78 (or 47--77??)
Yuichi Kaji and
Toru Fujiwara and
Tadao Kasami Solving a Unification Problem Under
Constrained Substitutions Using Tree
Automata . . . . . . . . . . . . . . . . 79--118 (or 79--114??)
B. M. Brown and
M. S. P. Eastham and
D. K. R. McCormack A New Algorithm for Computing the
Asymptotic Solutions of a Class of
Linear Differential Systems . . . . . . 119--131
C. M. Hoffmann and
J. R. Sendra and
F. Winkler Special Issue on Parametric Algebraic
Curves and Applications: Foreword by the
Guest Editors . . . . . . . . . . . . . 133--135
Laureano Gonzalez-Vega Implicitization of Parametric Curves and
Surfaces by Using Multidimensional
Newton Formulae . . . . . . . . . . . . 137--152 (or 137--151??)
Tom Sederberg and
Ron Goldman and
Hang Du Implicitizing Rational Curves by the
Method of Moving Algebraic Curves . . . 153--176 (or 153--175??)
Hoon Hong Implicitization of Nested Circular
Curves . . . . . . . . . . . . . . . . . 177--190 (or 177--189??)
J. Rafael Sendra and
Franz Winkler Parametrization of Algebraic Curves Over
Optimal Field Extensions . . . . . . . . 191--208 (or 191--207??)
Mark van Hoeij Rational Parametrizations of Algebraic
Curves Using a Canonical Divisor . . . . 209--228 (or 209--227??)
Michal M\vnuk An Algebraic Approach to Computing
Adjoint Curves . . . . . . . . . . . . . 229--240
Tomas Recio and
J. Rafael Sendra Real Reparametrizations of Real Curves 241--254
Martin Peternell and
Helmut Pottmann Computing Rational Parametrizations of
Canal Surfaces . . . . . . . . . . . . . 255--266
Enrique Arrondo and
Juana Sendra and
J. Rafael Sendra Parametric Generalized Offsets to
Hypersurfaces . . . . . . . . . . . . . 267--286 (or 267--285??)
Christoph M. Hoffmann and
Robert Joan-Arinyo Symbolic Constraints in Constructive
Geometric Constraint Solving . . . . . . 287--300 (or 287--299??)
Rida T. Farouki Conic Approximation of Conic Offsets . . 301--314 (or 301--313??)
Chandrajit L. Bajaj and
Guoliang Xu Spline Approximations of RealAlgebraic
Surfaces . . . . . . . . . . . . . . . . 315--333
Eugene M. Luks and
Ferenc Rákóczi and
Charles R. B. Wright Some Algorithms for Nilpotent
Permutation Groups . . . . . . . . . . . 335--354
Hoon Hong Subresultants Under Composition . . . . 355--366 (or 355--365??)
Amy Felty and
Laurent Théry Interactive Theorem Proving with
Temporal Logic . . . . . . . . . . . . . 367--398 (or 367--397??)
Alfons Geser Omega-Termination is Undecidable for
Totally Terminating Term Rewriting
Systems . . . . . . . . . . . . . . . . 399--412 (or 399--411??)
Sébastien Veigneau SP, a Package for Schubert Polynomials
Realized with the Computer Algebra
System MAPLE . . . . . . . . . . . . . . 413--426 (or 413--425??)
R. M. Corless and
D. J. Jeffrey and
M. B. Monagan and
Pratibha Two Perturbation Calculations in Fluid
Mechanics Using Large-Expression
Management . . . . . . . . . . . . . . . 427--443
L. A. Lambe Editorial . . . . . . . . . . . . . . . 445--446
B. Amrhein and
O. Gloor and
R. E. Maeder Visualizations for Mathematics Courses
Based on a Computer Algebra System . . . 447--452
N. Boston A Use of Computers to Teach Group Theory
and Introduce Students to Research . . . 453--458
J. Cannon and
C. Playoust Using the Magma Computer Algebra System
in Abstract Algebra Courses . . . . . . 459--484
R. M. Corless and
D. J. Jeffrey Scientific Computing: One Part of the
Revolution . . . . . . . . . . . . . . . 485--496
D. P. Jacobs A Course in Computational Nonassociative
Algebra . . . . . . . . . . . . . . . . 497--502
E. Kaltofen Teaching Computational Abstract Algebra 503--516
Elizabeth L. Mansfield and
Peter A. Clarkson Applications of the Differential Algebra
Package diffgrob2 to Classical
Symmetries of Differential Equations . . 517--534 (or 517--533??)
M. B. Monagan Worksheets and Notebooks: Can We Teach
Mathematical Algorithms with Them? . . . 535--550
N. Robidoux Computer Algebra and Interpolation: a
Lesson Plan . . . . . . . . . . . . . . 551--576
G. J. Sherman Trying to Do Group Theory with
Undergraduates and Computers . . . . . . 577--588
W. Y. Sit Mathematica Notebooks for a Conventional
Differential Equations Course . . . . . 589--623
Mark van Hoeij Formal Solutions and Factorization of
Differential Operators With Power Series
Coefficients . . . . . . . . . . . . . . 1--30
Yiu-Kwong Man and
Malcolm A. H. MacCallum A Rational Approach to the Prelle-Singer
Algorithm . . . . . . . . . . . . . . . 31--44 (or 31--43??)
Thom Mulders A Note on Subresultants and the
Lazard/Rioboo/Trager Formula in Rational
Function Integration . . . . . . . . . . 45--50
Michael Kalkbrener On the Stability of Gröbner Bases Under
Specializations . . . . . . . . . . . . 51--58
Nicolas Peltier Increasing Model Building Capabilities
by Constraint Solving on Terms With
Integer Exponents . . . . . . . . . . . 59--102 (or 59--101??)
Ivan I. Shevchenko Numeric Deduction in Symbolic
Computation. Application to Normalizing
Transformations . . . . . . . . . . . . 103--112 (or 103--111??)
Alberto Abad and
Felix San-Juan PSPCLink: A Cooperation Between General
Symbolic and Poisson Series Processors 113--122
Hoon Hong and
Richard Liska Special Issue on Applications of
Quantifier Elimination: Foreword of the
Guest Editors . . . . . . . . . . . . . 123--123
Dexter Kozen and
Kjartan Stefánsson Computing the Newtonian Graph . . . . . 125--136
Mats Jirstrand Nonlinear Control System Design by
Quantifier Elimination . . . . . . . . . 137--152
Peter Dorato and
Wei Yang and
Chaouki Abdallah Robust Multi-Objective Feedback Design
by Quantifier Elimination . . . . . . . 153--160 (or 153--159??)
Hoon Hong and
Richard Liska and
Stanly Steinberg Testing Stability by Quantifier
Elimination . . . . . . . . . . . . . . 161--188 (or 161--187??)
Volker Weispfenning Simulation and Optimization by
Quantifier Elimination . . . . . . . . . 189--208
Andreas Dolzmann and
Thomas Sturm Simplification of Quantifier-free
Formulae Over Ordered Fields . . . . . . 209--231
J. J. Cannon and
D. F. Holt Special Issue on Applications of
Quantifier Elimination: Foreword of the
Guest Editors . . . . . . . . . . . . . 233--234
Wieb Bosma and
John J. Cannon and
Catherine Playoust The Magma algebra system. I. The user
language . . . . . . . . . . . . . . . . 235--266 (or 235--265??)
M. Daberkow and
C. Fieker and
J. Klüners and
M. Pohst and
K. Roegner and
M. Schörnig and
K. Wildanger KANT V4 . . . . . . . . . . . . . . . . 267--283
M. Daberkow and
C. Fieker and
J. Klüners and
M. Pohst and
K. Roegner and
M. Schörnig and
K. Wildanger KANT V4 . . . . . . . . . . . . . . . . 267--284
John J. Cannon and
Derek F. Holt Computing Chief Series, Composition
Series and Socles in Large Permutation
Groups . . . . . . . . . . . . . . . . . 285--302 (or 285--301??)
John J. Cannon and
Bruce C. Cox and
Derek F. Holt Computing Sylow Subgroups in Permutation
Groups . . . . . . . . . . . . . . . . . 303--316
Jon F. Carlson and
Edward L. Green and
Gerhard J. A. Schnieder Computing Ext algebras for finite groups 317--326 (or 317--325??)
W. Plesken and
B. Souvignier Computing Isometries of Lattices . . . . 327--334
W. Plesken and
B. Souvignier Analysing Finitely Presented Groups by
Constructing Representations . . . . . . 335--350 (or 335--349??)
Wieb Bosma and
John J. Cannon and
Allan Steel Lattices of Compatibly Embedded Finite
Fields . . . . . . . . . . . . . . . . . 351--370 (or 351--369??)
M. Daberkow Computing with Subfields . . . . . . . . 371--384
M. Daberkow Computing with subfields . . . . . . . . 371--384
Jürgen Klüners and
Michael Pohst On computing subfields . . . . . . . . . 385--397
J. Klüners and
M. Pohst On Computing Subfields . . . . . . . . . 385--398
George Havas and
Bohdan S. Majewski Integer Matrix Diagonalization . . . . . 399--408
Allan Steel A New Algorithm for the Computation of
Canonical Forms of Matrices over Fields 409--432
H. Cohen and
F. Diaz y Diaz and
M. Olivier Subexponential Algorithms for Class
Group and Unit Computations . . . . . . 433--442 (or 433--441??)
Stéphane Collart and
Daniel Mall Toric Degenerations of Polynomial Ideals
and Geometric Localization of Fans . . . 443--464
S. Collart and
M. Kalkbrener and
D. Mall Converting Bases with the Gröbner Walk 465--470 (or 465--469??)
Gene Cooperman and
Larry Finkelstein and
Michael Tselman and
Bryant York Constructing Permutation Representations
for Matrix Groups . . . . . . . . . . . 471--488
D. F. Holt and
W. Plesken and
B. Souvignier Constructing a Representation of the
Group (2,3,7;11) . . . . . . . . . . . . 489--492
Ibrahim A. I. Suleiman and
Robert A. Wilson The $2$-modular characters of Conway's
third group ${\rm Co}_3$ . . . . . . . . 493--506
Scott McCallum On Testing a Bivariate Polynomial for
Analytic Reducibility . . . . . . . . . 509--536 (or 509--535??)
Mark van Hoeij Factorization of Differential Operators
with Rational Functions Coefficients . . 537--562 (or 537--561??)
D. J. Jeffrey Rectifying Transformations for the
Integration of Rational Trigonometric
Functions . . . . . . . . . . . . . . . 563--574 (or 563--573??)
Patrick Fitzpatrick Solving a Multivariable Congruence by
Change of Term Order . . . . . . . . . . 575--590 (or 575--589??)
Ünal Gökta\cs and
Willy Hereman Symbolic Computation of Conserved
Densities for Systems of Nonlinear
Evolution Equations . . . . . . . . . . 591--621
W. Krandick and
S. Rump Special Issue on Validated Numerical
Methods and Computer Algebra: Foreword
of the Guest Editors . . . . . . . . . . 625--626
Daniel Richardson How to Recognize Zero . . . . . . . . . 627--646 (or 627--645??)
Adam Wojciech Strzebo\'nski Computing in the Field of Complex
Algebraic Numbers . . . . . . . . . . . 647--656
Michael E. Pohst On Validated Computing in Algebraic
Number Fields . . . . . . . . . . . . . 657--666 (or 657--665??)
V. Hribernig and
H. J. Stetter Detection and Validation of Clusters of
Polynomial Zeros . . . . . . . . . . . . 667--681
Jean-Pierre Dedieu Estimations for the Separation Number of
a Polynomial System . . . . . . . . . . 683--693
Annie Cuyt Floating-Point Versus Symbolic
Computations in the $QD$-Algorithm . . . 695--704 (or 695--703??)
Akmal A. Vakhidov and
Nickolay N. Vasiliev A New Approach for Analytical
Computation of Hamiltonian of a
Satellite Perturbed Motion . . . . . . . 705--710
Ming-Deh D. Huang and
Doug Ierardi Counting Points on Curves Over Finite
Fields . . . . . . . . . . . . . . . . . 1--22 (or 1--21??)
Klaus Madlener and
Birgit Reinert A Generalization of Gröbner Basis
Algorithms to Polycyclic Group Rings . . 23--44 (or 23--43??)
Eddie H. Lo Finding Intersections and Normalizers in
Finitely Generated Nilpotent Groups . . 45--60 (or 45--59??)
Eddie H. Lo A Polycyclic Quotient Algorithm . . . . 61--98 (or 61--97??)
Jon Jones and
N. P. Karampetakis and
A. C. Pugh The Computation and Application of the
Generalized Inverse via
$\Vert$MAPLE$\Vert$ . . . . . . . . . . 99--124
Norbert Kajler and
Michael Monagan Special Issue on Graphical User
Interfaces and Protocols Foreword of the
Guest Editors . . . . . . . . . . . . . 125--125
N. Kajler and
N. Soiffer A Survey of User Interfaces for Computer
Algebra Systems . . . . . . . . . . . . 127--160
Y. Bertot and
L. Théry A Generic Approach to Building User
Interfaces for Theorem Provers . . . . . 161--194
M. B. Hayden and
E. A. Lamagna Newton: An Interactive Environment for
Exploring Mathematics . . . . . . . . . 195--212
S. Gray and
N. Kajler and
P. S. Wang Design and Implementation of MP, a
Protocol for Efficient Exchange of
Mathematical Expressions . . . . . . . . 213--238
H. Lowe and
A. Bundy and
D. McLean The Use of Proof Planning for
Co-operative Theorem Proving . . . . . . 239--262
J. S. Aitken and
P. Gray and
T. Melham and
M. Thomas Interactive Theorem Proving: An
Empirical Study of User Activity . . . . 263--284
Thomas Yan The Geobucket Data Structure for
Polynomials . . . . . . . . . . . . . . 285--294 (or 285--293??)
Dongming Wang Decomposing Polynomial Systems into
Simple Systems . . . . . . . . . . . . . 295--314
Jan Snellman Gröbner Bases and Normal Forms in a
Subring of the Power Series Ring on
Countably Many Variables . . . . . . . . 315--328
Bruno Salvy and
John Shackell Symbolic Asymptotics: Functions of Two
Variables, Implicit Functions . . . . . 329--350 (or 329--349??)
L. J. Rylands and
D. E. Taylor Matrix Generators for the Orthogonal
Groups . . . . . . . . . . . . . . . . . 351--360
L. Hajdu and
T. Herendi Explicit Bounds for the Solutions of
Elliptic Equations with Rational
Coefficients . . . . . . . . . . . . . . 361--366
Ladislav Kocbach and
Richard Liska Generation and Verification of
Algorithms for Symbolic-Numeric
Processing . . . . . . . . . . . . . . . 367--382
B. Paternoster and
M. Cafaro Computation of the Interval of Stability
of Runge-Kutta-Nyström Methods . . . . . 383--394
G. Smolka Special Issue on Order-Sorted Rewriting
Foreword by the Guest Editor . . . . . . 395--395
Hubert Comon Completion of Rewrite Systems with
Membership Constraints. Part I:
Deduction Rules . . . . . . . . . . . . 397--420 (or 397--419??)
Hubert Comon Completion of Rewrite Systems with
Membership Constraints. Part II:
Constraint Solving . . . . . . . . . . . 421--454 (or 421--453??)
Claus Hintermeier and
Claude Kirchner and
Hél\`ene Kirchner Dynamically Typed Computations for
Order-Sorted Equational Presentations 455--526
Andreas Werner A Semantic Approach to Order-Sorted
Rewriting . . . . . . . . . . . . . . . 527--569
Hoon Hong Bounds for Absolute Positiveness of
Multivariate Polynomials . . . . . . . . 571--586 (or 571--585??)
Alexei Yu. Uteshev and
Timofei M. Cherkasov The Search for the Maximum of a
Polynomial . . . . . . . . . . . . . . . 587--618
Raphael Nauheim Systems of Algebraic Equations with Bad
Reduction . . . . . . . . . . . . . . . 619--642 (or 619--641??)
Hoon Hong Gröbner Basis Under Composition I . . . . 643--664 (or 643--663??)
M. F. Newman and
Werner Nickel and
Alice C. Niemeyer Descriptions of Groups of Prime-power
Order . . . . . . . . . . . . . . . . . 665--682
Joachim Apel The Theory of Involutive Divisions and
an Application to Hilbert Function
Computations . . . . . . . . . . . . . . 683--704
Elie Compoint Differential Equations and Algebraic
Relations . . . . . . . . . . . . . . . 705--725
Wolfram Decker and
Agnes Eileen Heydtmann and
Frank-Olaf Schreyer Generating a Noetherian Normalization of
the Invariant Ring of a Finite Group . . 727--731
Aart Middeldorp and
Satoshi Okui A Deterministic Lazy Narrowing Calculus 733--757
Jean-Camille Birget Infinite String Rewrite Systems and
Complexity . . . . . . . . . . . . . . . 759--793
Josef Schicho Rational parametrization of surfaces . . 1--29
Jaime Gutierrez and
Tomas Recio Advances on the simplification of
sine-cosine equations . . . . . . . . . 31--70
Ioannis Z. Emiris and
Victor Y. Pan and
Yanqiang Yu Modular arithmetic for linear algebra
computations in the real field . . . . . 71--87
Torsten Minkwitz An algorithm for solving the
factorization problem in permutation
groups . . . . . . . . . . . . . . . . . 89--95
Maribel Fernández Negation elimination in empty or
permutative theories . . . . . . . . . . 97--133
Sebastian Egner and
Torsten Minkwitz Sparsification of rectangular matrices 135--149
Attila Pethö and
Robert F. Tichy On two-parametric quartic families of
Diophantine problems . . . . . . . . . . 151--171
Clemens Heuberger On a family of quintic Thue equations 173--185
Frédéric Chyzak and
Bruno Salvy Non-commutative elimination in Ore
algebras proves multivariate identities 187--227
Alyson A. Reeves A parallel implementation of
Buchberger's algorithm over $\bold Z_p$
for $p\leq 31991$ . . . . . . . . . . . 229--244
Massimo Caboara and
Eva Riccomagno An algebraic computational approach to
the identifiability of Fourier models 245--260
Manfred Göbel A constructive description of SAGBI
bases for polynomial invariants of
permutation groups . . . . . . . . . . . 261--272
Theo de Jong An algorithm for computing the integral
closure . . . . . . . . . . . . . . . . 273--277
Hoon Hong and
Josef Schicho Algorithms for trigonometric curves
(simplification, implicitization,
parameterization) . . . . . . . . . . . 279--300
Mulan Liu and
Lei Hu Properties of Gröbner bases and
applications to doubly periodic arrays 301--314
T. G. Berry Construction of linear systems on
hyperelliptic curves . . . . . . . . . . 315--327
Philip Feinsilver and
René Schott Computing representations of a Lie group
via the universal enveloping algebra . . 329--338
Daniel J. Bernstein Composing power series over a finite
ring in essentially linear time . . . . 339--341
Thomas Breuer and
Götz Pfeiffer Finding possible permutation characters 343--354
Ian G. Lisle and
Gregory J. Reid Geometry and structure of Lie
pseudogroups from infinitesimal defining
systems . . . . . . . . . . . . . . . . 355--379
M. Fournié and
J.-Ph. Furter and
D. Pinchon Computation of the maximal degree of the
inverse of a cubic automorphism of the
affine plane with Jacobian $1$ via
Gröbner bases . . . . . . . . . . . . . . 381--386
Ph. Saux Picart The Schur-Cohn Algorithm Revisited . . . 387--408
R. La Scala and
M. Stillman Strategies for Computing Minimal Free
Resolutions . . . . . . . . . . . . . . 409--432
J. Gutierrez and
R. R. San Miguel Reduced Gröbner Bases Under Composition 433--444
P. A. Hendriks An Algorithm Determining the Difference
Galois Group of Second Order Linear
Difference Equations . . . . . . . . . . 445--462
M. Giesbrecht Factoring in Skew-Polynomial Rings Over
Finite Fields . . . . . . . . . . . . . 463--486
A. Schiemann Classification of Hermitian Forms with
the Neighbour Method . . . . . . . . . . 487--508
S. Meyer Eikenberry and
J. P. Sorenson Efficient Algorithms for Computing the
Jacobi Symbol . . . . . . . . . . . . . 509--523
M. Kalkbrener Algorithmic Properties of Polynomial
Rings . . . . . . . . . . . . . . . . . 525--582
J. Von Zur Gathen and
S. Hartlieb Factoring Modular Polynomials . . . . . 583--606
M. Von Mohrenschildt Normal Form for Function Rings of
Piecewise Functions . . . . . . . . . . 607--620
F. Otto and
M. Katsura and
Y. Kobayashi Infinite Convergent String-Rewriting
Systems and Cross-Sections for Finitely
Presented Monoids . . . . . . . . . . . 621--648
S. M. Watt and
H. J. Stetter Special Issue on Symbolic Numeric
Algebra for Polynomials: Foreword of the
Guest Editors . . . . . . . . . . . . . 649--652
N. K. Karmarkar and
Y. N. Lakshman On Approximate GCDs of Univariate
Polynomials . . . . . . . . . . . . . . 653--666
Z. Lihong and
W. Wenda Nearest Singular Polynomials . . . . . . 667--676
B. Beckermann and
G. Labahn When are Two Numerical Polynomials
Relatively Prime? . . . . . . . . . . . 677--690
B. Beckermann and
G. Labahn A Fast and Numerically Stable
Euclidean-like Algorithm for Detecting
Relatively Prime Numerical Polynomials 691--714
B. Mourrain Computing the Isolated Roots by Matrix
Methods . . . . . . . . . . . . . . . . 715--738
Q.-N. Tran A Symbolic-Numerical Method for Finding
a Real Solution of an Arbitrary System
of Nonlinear Algebraic Equations . . . . 739--760
K. Shirayanagi and
M. Sweedler Remarks on Automatic Algorithm
Stabilization . . . . . . . . . . . . . 761--766
B. Huber and
F. Sottile and
B. Sturmfels Numerical Schubert Calculus . . . . . . 767--788
P. Gianni and
M. Seppälä and
R. Silhol and
B. Trager Riemann Surfaces, Plane Algebraic Curves
and Their Period Matrices . . . . . . . 789--803
D. F. Holt and
D. F. Hurt Computing Automatic Coset Systems and
Subgroup Presentations . . . . . . . . . 1--20
F. Cucker and
P. Koiran and
S. Smale A Polynomial Time Algorithm for
Diophantine Equations in One Variable 21--30
W. W. Adams and
S. Ho\csten and
P. Loustaunau and
J. L. Miller SAGBI and SAGBI-Gröbner Bases over
Principal Ideal Domains . . . . . . . . 31--48
R. C. Churchill and
M. A. Kummer A Unified Approach to Linear and
Nonlinear Normal Forms for Hamiltonian
Systems . . . . . . . . . . . . . . . . 49--131
S. M. Hermiller and
X. H. Kramer and
R. C. Laubenbacher Monomial Orderings, Rewriting Systems,
and Gröbner Bases for the Commutator
Ideal of a Free Algebra . . . . . . . . 133--142
J. Müller-Quade and
R. Steinwandt Basic Algorithms for Rational Function
Fields . . . . . . . . . . . . . . . . . 143--170
G. Kemper An Algorithm to Calculate Optimal
Homogeneous Systems of Parameters . . . 171--184
M. Bellia and
M. E. Occhiuto Lazy Linear Combinatorial Unification 185--206
P. Krysta and
L. Pacholski The STO Problem is NP-Complete . . . . . 207--220
T. Wolf and
A. Brand and
M. Mohammadzadeh Computer Algebra Algorithms and Routines
for the Computation of Conservation Laws
and Fixing of Gauge in Differential
Expressions . . . . . . . . . . . . . . 221--238
P. A. Hendriks and
M. F. Singer Solving Difference Equations in Finite
Terms . . . . . . . . . . . . . . . . . 239--260
J. Klüners On Polynomial Decompositions . . . . . . 261--270
J. Avenhaus and
K. Becker A Framework for Operational Equational
Specifications with Pre-defined
Structures . . . . . . . . . . . . . . . 271--310
F. Du Cloux A Transducer Approach to Coxeter Groups 311--324
G. H. Norton On Shortest Linear Recurrences . . . . . 325--349
A. M. Bigatti and
R. La Scala and
L. Robbiano Computing Toric Ideals . . . . . . . . . 351--366
S. McCallum Factors of Iterated Resultants and
Discriminants . . . . . . . . . . . . . 367--386
H. U. Besche and
B. Eick Construction of Finite Groups . . . . . 387--404
H. U. Besche and
B. Eick The Groups of Order at Most 1000 Except
512 and 768 . . . . . . . . . . . . . . 405--414
A. Hulpke Computing Subgroups Invariant Under a
Set of Automorphisms . . . . . . . . . . 415--428
E. Bach Sheaf Cohomology is #P-Hard . . . . . . 429--433
K. Stokkermans A Categorical Critical-pair Completion
Algorithm . . . . . . . . . . . . . . . 435--478
J. Q. Ying and
L. Xu and
Z. Lin A Computational Method for Determining
Strong Stabilizability of $n$-D Systems 479--500
E. S. Cheb-Terrab and
A. D. Roche Integrating Factors for Second-order
ODEs . . . . . . . . . . . . . . . . . . 501--519
Edlyn Teske The Pohlig-Hellman Method Generalized
for Group Structure Computation . . . . 521--534
Ronald de Man The Generating Function for the Number
of Roots of a Coxeter Group . . . . . . 535--541
Bruno Salvy and
John Shackell Symbolic Asymptotics: Multiseries of
Inverse Functions . . . . . . . . . . . 543--563
Nicolai Vorobjov Complexity of Computing the Local
Dimension of a Semialgebraic Set . . . . 565--579
D. J. Broadhurst and
D. Kreimer Renormalization Automated by Hopf
Algebra . . . . . . . . . . . . . . . . 581--600
Ioannis Z. Emiris and
Bernard Mourrain Matrices in Elimination Theory . . . . . 3--43
P. Bikker and
A. Yu. Uteshev On the Bézout Construction of the
Resultant . . . . . . . . . . . . . . . 45--88
Laureano Gonzalez-Vega and
Neila Gonzalez-Campos Simultaneous Elimination by using
Several Tools from Real Algebraic
Geometry . . . . . . . . . . . . . . . . 89--103
Philippe Aubry and
Daniel Lazard and
Marc Moreno Maza On the Theories of Triangular Sets . . . 105--124
Philippe Aubry and
Marc Moreno Maza Triangular Sets for Solving Polynomial
Systems: a Comparative Implementation of
Four Methods . . . . . . . . . . . . . . 125--154
J. Maurice Rojas Solving Degenerate Sparse Polynomial
Systems Faster . . . . . . . . . . . . . 155--186
Tangan Gao and
T. Y. Li and
Xiaoshen Wang Finding All Isolated Zeros of Polynomial
Systems in $C_n$ via Stable Mixed
Volumes . . . . . . . . . . . . . . . . 187--212
Dan Richardson Weak Wu Stratification in $R^n$ . . . . 213--223
Lu Yang Recent Advances on Determining the
Number of Real Roots of Parametric
Polynomials . . . . . . . . . . . . . . 225--242
Masayuki Noro and
Kazuhiro Yokoyama A Modular Method to Compute the Rational
Univariate Representation of
Zero-dimensional Ideals . . . . . . . . 243--264
Michael Kalkbrener On the Complexity of Gröbner Bases
Conversion . . . . . . . . . . . . . . . 265--273
Karin Gatermann and
Frédéric Guyard Gröbner Bases, Invariant Theory and
Equivariant Dynamics . . . . . . . . . . 275--302
Dongming Wang Polynomial Systems from Certain
Differential Equations . . . . . . . . . 303--315
Ulla Koppenhagen and
Ernst W. Mayr An Optimal Algorithm for Constructing
the Reduced Gröbner Basis of Binomial
Ideals . . . . . . . . . . . . . . . . . 317--338
Eddie H. Lo and
Gretchen Ostheimer A Practical Algorithm for Finding Matrix
Representations for Polycyclic Groups 339--360
Gretchen Ostheimer Practical Algorithms for Polycyclic
Matrix Groups . . . . . . . . . . . . . 361--379
Patrick Viry Elimination of Conditions . . . . . . . 381--401
Victor G. Ganzha and
Evgenii V. Vorozhtsov Application of Computer Algebra Systems
for Stability Analysis of Difference
Schemes on Curvilinear Grids . . . . . . 401--433
William Sit and
Manuel Bronstein Foreword of the Guest Editors . . . . . 435--440
Marius van der Put Galois Theory of Differential Equations,
Algebraic Groups and Lie Algebras . . . 441--472
Elie Compoint and
Michael F. Singer Computing Galois Groups of Completely
Reducible Differential Equations . . . . 473--494
Raimundas Vidunas Differential Equations of Order Two with
One Singular Point . . . . . . . . . . . 495--520
R. C. Churchill Two Generator Subgroups of \boldmath
$SL(2,C)$ and the Hypergeometric,
Riemann, and Lamé Equations . . . . . . . 521--545
Moulay A. Barkatou On Rational Solutions of Systems of
Linear Differential Equations . . . . . 547--567
Moulay Barkatou and
Eckhard Pflügel An Algorithm Computing the Regular
Formal Solutions of a System of Linear
Differential Equations . . . . . . . . . 569--587
Mark Van Hoeij and
Jean-François Ragot and
Felix Ulmer and
Jacques-Arthur Weil Liouvillian Solutions of Linear
Differential Equations of Order Three
and Higher . . . . . . . . . . . . . . . 589--609
Georg M. Reinhart The Schmidt-Kolchin Conjecture . . . . . 611--630
Sally Morrison The Differential Ideal $[P]$ :
$M^{\infty}$ . . . . . . . . . . . . . . 631--656
Evelyne Hubert Essential Components of an Algebraic
Differential Equation . . . . . . . . . 657--680
Alexander Levin Computation of Hilbert Polynomials in
Two Variables . . . . . . . . . . . . . 681--710
Andrej Bauer and
Marko Petkov\vsek Multibasic and Mixed Hypergeometric
Gosper-Type Algorithms . . . . . . . . . 711--736
Anonymous Special Issue on Orthogonal Polynomials
and Computer Algebra Foreword of the
Guest Editors . . . . . . . . . . . . . 737--738
B. C. Carlson Toward Symbolic Integration of Elliptic
Integrals . . . . . . . . . . . . . . . 739--753
A. Ronveaux and
A. Zarzo and
I. Area and
E. Godoy Decomposition of Polynomials with
Respect to the Cyclic Group of Order $m$ 755--765
I. Area and
E. Godoy and
A. Ronveaux and
A. Zarzo Inversion Problems in the $q$-Hahn
Tableau . . . . . . . . . . . . . . . . 767--776
Harald Böing and
Wolfram Koepf Algorithms for $q$-Hypergeometric
Summation in Computer Algebra . . . . . 777--799
Mama Foupouagnigni and
M. Norbert Hounkonnou and
André Ronveaux The Fourth-order Difference Equation
Satisfied by the Associated Orthogonal
Polynomials of the
$\Delta$-Laguerre-Hahn Class . . . . . . 801--818
Charles F. Dunkl Computing with Differential-difference
Operators . . . . . . . . . . . . . . . 819--826
Alan L. Schwartz Partial Differential Equations and
Bivariate Orthogonal Polynomials . . . . 827--845
Anonymous Contents of Volume 28 . . . . . . . . . i--ii
Anonymous Index to Volume 28 . . . . . . . . . . . iii--viii
B. F. Caviness Editorial . . . . . . . . . . . . . . . 1--1
Hoon Hong Editorial . . . . . . . . . . . . . . . 3--4
Ronald Brown and
Anne Heyworth Using Rewriting Systems to Compute Left
Kan Extensions and Induced Actions of
Categories . . . . . . . . . . . . . . . 5--31
Sergey Bratus and
Igor Pak Fast Constructive Recognition of a Black
Box Group Isomorphic to \boldmath
$S$$_n$ or \boldmath $A$$_n$ using
Goldbach's Conjecture . . . . . . . . . 33--57
Sarah Rees and
Leonard H. Soicher An Algorithmic Approach to Fundamental
Groups and Covers of Combinatorial Cell
Complexes . . . . . . . . . . . . . . . 59--77
D. A. Wolfram A Formula for the General Solution of a
Constant-coefficient Difference Equation 79--82
Vincent Prosper SFA, a Package on Symmetric Functions
Considered as Operators over the Ring of
Polynomials for the Computer Algebra
System Maple . . . . . . . . . . . . . . 83--94
John Carminati and
Khai Vu Symbolic Computation and Differential
Equations: Lie Symmetries . . . . . . . 95--116
Anonymous Special Issue on Advances in First-order
Theorem Proving Foreword of the Guest
Editors . . . . . . . . . . . . . . . . 117--118
Chandrabose Aravindan and
Peter Baumgartner Theorem Proving Techniques for View
Deletion in Databases . . . . . . . . . 119--147
Matthias Baaz and
Alexander Leitsch Cut-elimination and
Redundancy-elimination by Resolution . . 149--177
Ricardo Caferra and
Nicolas Peltier Combining Enumeration and Deductive
Techniques in order to Increase the
Class of Constructible Infinite Models 177--211
Reinhard Pichler Speeding up Algorithms on Atomic
Representations of Herbrand Models via
New Redundancy Criteria . . . . . . . . 213--257
Andrea Formisano and
Eugenio G. Omodeo and
Marco Temperini Goals and Benchmarks for Automated Map
Reasoning . . . . . . . . . . . . . . . 259--297
Marc Fuchs Controlled Use of Clausal Lemmas in
Connection Tableau Calculi . . . . . . . 299--341
P. J. Martin and
A. Gavilanes and
J. Leach Tableau Methods for a Logic with Term
Declarations . . . . . . . . . . . . . . 343--372
Uwe Petermann Connection Calculus Theorem Proving with
Multiple Built-in Theories . . . . . . . 373--392
Guoting Chen and
Jean Della Dora An Algorithm for Computing a New Normal
Form for Dynamical Systems . . . . . . . 393--418
David Cox and
Ronald Goldman and
Ming Zhang On the Validity of Implicitization by
Moving Quadrics for Rational Surfaces
with No Base Points . . . . . . . . . . 419--440
W. Eberly and
M. Giesbrecht Efficient Decomposition of Associative
Algebras over Finite Fields . . . . . . 441--458
Graziano Gentili and
Michael A. O'Connor On Rational Geometry of Conic Sections 459--470
Adam Strzebo\'nski Solving Systems of Strict Polynomial
Inequalities . . . . . . . . . . . . . . 471--480
Eduardo Cattani and
Reinhard C. Laubenbacher Special Issue on Symbolic Computation in
Algebra, Analysis, and Geometry Foreword
of the Guest Editors . . . . . . . . . . 483--483
Laurent Busé and
Mohamed Elkadi and
Bernard Mourrain Generalized Resultants over Unirational
Algebraic Varieties . . . . . . . . . . 515--526
Marc Chardin Applications of Some Properties of the
Canonical Module in Computational
Projective Algebraic Geometry . . . . . 527--544
Wolfram Decker and
Frank-Olaf Schreyer Non-general Type Surfaces in $P^4$: Some
Remarks on Bounds and Constructions . . 545--582
David Eisenbud and
Mircea Musta\cta and
Mike Stillman Cohomology on Toric Varieties and Local
Cohomology with Monomial Supports . . . 583--600
Edward L. Green Multiplicative Bases, Gröbner Bases, and
Right Gröbner Bases . . . . . . . . . . . 601--623
Serkan Ho\csten and
Jay Shapiro Primary Decomposition of Lattice Basis
Ideals . . . . . . . . . . . . . . . . . 625--639
Evelyne Hubert Factorization-free Decomposition
Algorithms in Differential Algebra . . . 641--662
Henri Lombardi and
Marie-Françoise Roy and
Mohab Safey El Din New Structure Theorem for Subresultants 663--689
Ezra Miller and
Bernd Sturmfels and
Kohji Yanagawa Generic and Cogeneric Monomial Ideals 691--708
Mircea Musta\cta Local Cohomology at Monomial Ideals . . 709--720
Toshinori Oaku and
Nobuki Takayama and
Uli Walther A Localization Algorithm for $D$-modules 721--728
Gregory G. Smith Computing Global Extension Modules . . . 729--746
Harrison Tsai Weyl Closure of a Linear Differential
Operator . . . . . . . . . . . . . . . . 747--775
Jan Verschelde Toric Newton Method for Polynomial
Homotopies . . . . . . . . . . . . . . . 777--793
Uli Walther Algorithmic Computation of de Rham
Cohomology of Complements of Complex
Affine Varieties . . . . . . . . . . . . 795--839
Manuel Bronstein On Solutions of Linear Ordinary
Difference Equations in their
Coefficient Field . . . . . . . . . . . 841--877
Shuhong Gao and
Joachim Von zur gathen and
Daniel Panario and
Victor Shoup Algorithms for Exponentiation in Finite
Fields . . . . . . . . . . . . . . . . . 879--889
Erich Kaltofen Challenges of Symbolic Computation: My
Favorite Open Problems . . . . . . . . . 891--919
Ursula Martin and
Duncan Shand Invariants, Patterns and Weights for
Ordering Terms . . . . . . . . . . . . . 921--957
Stefan Maubach An Algorithm to Compute the Kernel of a
Derivation up to a Certain Degree . . . 959--970
Petru Pau and
Josef Schicho Quantifier Elimination for Trigonometric
Polynomials by Cylindrical Trigonometric
Decomposition . . . . . . . . . . . . . 971--983
Pierre Flener and
Kung-Kiu Lau and
Wolfgang Bibel Foreword to the Special Issue on Schemas 1--3
Penny Anderson and
David Basin Program Development Schemata as Derived
Rules . . . . . . . . . . . . . . . . . 5--36
Matthias Fuchs Proofs as Schemas and Their Heuristic
Use . . . . . . . . . . . . . . . . . . 37--61
S. M. Brien and
A. P. Martin A Calculus for Schemas in $Z$ . . . . . 63--91
Pierre Flener and
Kung-Kiu Lau and
Mario Ornaghi and
Julian Richardson An Abstract Formalization of Correct
Schemas for Program Synthesis . . . . . 93--127
Vincenzo Acciaro and
Claus Fieker Finding Normal Integral Bases of Cyclic
Number Fields of Prime Degree . . . . . 129--136
G. Albano and
F. Cioffi and
F. Orecchia and
I. Ramella Minimally Generating Ideals of Rational
Parametric Curves in Polynomial Time . . 137--149
Pedro Berrizbeitia and
T. G. Berry Generalized Strong Pseudoprime Tests and
Applications . . . . . . . . . . . . . . 151--160
M'hammed El Kahoui and
Andreas Weber Deciding Hopf Bifurcations by Quantifier
Elimination in a Software-component
Architecture . . . . . . . . . . . . . . 161--179
István Gaál Solving Index Form Equations in Fields
of Degree $9$ with Cubic Subfields . . . 181--193
Reinhard C. Laubenbacher and
Irena Swanson Permanental Ideals . . . . . . . . . . . 195--205
Thomas Sturm Linear Problems in Valued Fields . . . . 207--219
Dongming Wang Computing Triangular Systems and Regular
Systems . . . . . . . . . . . . . . . . 221--236
Vincenzo Acciaro and
Jürgen Klüners Computing Local Artin Maps, and
Solvability of Norm Equations . . . . . 239--252
Gert-Martin Greuel Computer Algebra and Algebraic Geometry
--- Achievements and Perspectives . . . 253--289
Marc Giusti and
Klemens Hägele and
Grégoire Lecerf and
Joël Marchand and
Bruno Salvy The Projective Noether Maple Package:
Computing the Dimension of a Projective
Variety . . . . . . . . . . . . . . . . 291--307
Ryutaroh Matsumoto and
Shinji Miura Finding a Basis of a Linear System with
Pairwise Distinct Discrete Valuations on
an Algebraic Curve . . . . . . . . . . . 309--323
Maurice Mignotte Bounds for the Roots of Lacunary
Polynomials . . . . . . . . . . . . . . 325--327
Wilberd Van Der Kallen Complexity of the Havas, Majewski,
Matthews $LLL$ Hermite Normal Form
Algorithm . . . . . . . . . . . . . . . 329--337
J. Abbott and
A. Bigatti and
M. Kreuzer and
L. Robbiano Computing Ideals of Points . . . . . . . 341--356
Alexander Levin Reduced Gröbner Bases, Free
Difference-Differential Modules and
Difference-Differential Dimension
Polynomials . . . . . . . . . . . . . . 357--382
Ignacio Ojeda Martínez de Castilla and
Ramón Peidra Sánchez Cellular Binomial Ideals. Primary
Decomposition of Binomial Ideals . . . . 383--400
Gábor Bodnár and
Josef Schicho Automated Resolution of Singularities
for Hypersurfaces . . . . . . . . . . . 401--428
M. A. Borges-Trenard and
M. Borges-Quintana and
T. Mora Computing Gröbner Bases by FGLM
Techniques in a Non-commutative Setting 429--449
Quoc-Nam Tran A Fast Algorithm for Gröbner Basis
Conversion and its Applications . . . . 451--467
Jörn Müller-Quade and
Rainer Steinwandt Gröbner Bases Applied to Finitely
Generated Field Extensions . . . . . . . 469--490
Cassiano Durand and
Christoph M. Hoffmann A Systematic Framework for Solving
Geometric Constraints Analytically . . . 493--519
Aloysius G. Helminck Computing Orbits of Minimal Parabolic
$k$-subgroups Acting on Symmetric
$k$-varieties . . . . . . . . . . . . . 521--553
Reinhard Laubenbacher and
Karen Schlauch An Algorithm for the Quillen-Suslin
Theorem for Quotients of Polynomial
Rings by Monomial Ideals . . . . . . . . 555--571
Dimitrios Poulakis and
Evaggelos Voskos On the Practical Solution of Genus Zero
Diophantine Equations . . . . . . . . . 573--582
Josef Schicho Proper Parametrization of Real Tubular
Surfaces . . . . . . . . . . . . . . . . 583--593
Wolmer V. Vasconcelos Divisorial Extensions and the
Computation of Integral Closures . . . . 595--604
André Weilert $(1+i)$-ary GCD Computation in $Z[i]$ as
an Analogue to the Binary GCD Algorithm 605--617
Thomas Wolf The Symbolic Integration of Exact PDEs 619--629
Anonymous Contents and Index of Volume 30 . . . . 1--7
B. H. Matzat and
J. McKay and
K. Yokoyama Special Issue on Algorithmic Methods in
Galois Theory: Foreword of the Guest
Editors . . . . . . . . . . . . . . . . 631--633
Philippe Aubry and
Annick Valibouze Using Galois Ideals for Computing
Relative Resolvents . . . . . . . . . . 635--651
Katharina Geissler and
Jürgen Klüners Galois Group Computation for Rational
Polynomials . . . . . . . . . . . . . . 653--674
Jürgen Klüners and
Gunter Malle Explicit Galois Realization of
Transitive Groups of Degree up to $15$ 675--716
Gunter Malle Multi-parameter Polynomials with Given
Galois Group . . . . . . . . . . . . . . 717--731
Jürgen Klüners A Polynomial with Galois Group ${\rm
SL}_2(11)$ . . . . . . . . . . . . . . . 733--737
Jean-Marc Couveignes Boundary of Hurwitz Spaces and Explicit
Patching . . . . . . . . . . . . . . . . 739--759
Michael Dettweiler and
Stefan Reiter An Algorithm of Katz and its Application
to the Inverse Galois Problem . . . . . 761--798
Luis Dieulefait and
Núria Vila Projective Linear Groups as Galois
Groups over $Q$ via Modular
Representations . . . . . . . . . . . . 799--810
Montserrat Vela Explicit Solutions of Galois Embedding
Problems by Means of Generalized
Clifford Algebras . . . . . . . . . . . 811--842
Gregor Kemper and
Elena Mattig Generic Polynomials with Few Parameters 843--857
Arne Ledet Generic and Explicit Realization of
Small $p$-groups . . . . . . . . . . . . 859--865
Arne Ledet Generic Extensions and Generic
Polynomials . . . . . . . . . . . . . . 867--872
Wieb Bosma Special Issue on Computational Algebra
and Number Theory: Proceedings of the
Second Magma Conference: Foreword of the
Guest Editor . . . . . . . . . . . . . . 1--1
Joachim von zur Gathen and
Daniel Panario Factoring Polynomials Over Finite
Fields: A Survey . . . . . . . . . . . . 3--17
Shuhong Gao On the Deterministic Complexity of
Factoring Polynomials . . . . . . . . . 19--36
J. D. Key Some Applications of Magma in Designs
and Codes: Oval Designs, Hermitian
Unitals and Generalized Reed-Muller
Codes . . . . . . . . . . . . . . . . . 37--53
G. L. Ebert Constructions in Finite Geometry Using
Computer Algebra Systems . . . . . . . . 55--70
J. E. Cremona Classical Invariants and $2$-descent on
Elliptic Curves . . . . . . . . . . . . 71--87
Joe Buhler and
Richard Crandall and
Reijo Ernvall and
Tauno Metsänkylä and
M. Amin Shokrollahi Irregular Primes and Cyclotomic
Invariants to $12$ Million . . . . . . . 89--96
Wieb Bosma and
Bart DE Smit Class Number Relations from a
Computational Point of View . . . . . . 97--112
Mario Daberkow On Computations in Kummer Extensions . . 113--131
Henri Cohen and
Francisco Diaz Y Diaz and
Michel Olivier Algorithmic Methods for Finitely
Generated Abelian Groups . . . . . . . . 133--147
John J. Cannon and
Bruce C. Cox and
Derek F. Holt Computing the Subgroups of a Permutation
Group . . . . . . . . . . . . . . . . . 149--161
Klaus Lux and
Markus Wiegelmann Determination of Socle Series using the
Condensation Method . . . . . . . . . . 163--178
Michael C. Slattery Computing Double Cosets in Soluble
Groups . . . . . . . . . . . . . . . . . 179--192
Simon Norton Computing in the Monster . . . . . . . . 193--201
Holger W. Gollan A New Existence Proof for $Ly$, the
Sporadic Simple Group of R. Lyons . . . 203--209
Robert L. Griess, Jr. and
A. J. E. Ryba Embeddings of ${\rm PSL}(2,41)$ and
${\rm PSL}(2,49)$ in ${\rm E}_8(C)$ . . 211--227
Jon F. Carlson Calculating Group Cohomology: Tests for
Completion . . . . . . . . . . . . . . . 229--242
Alain Sausse A New Approach to Primary Decomposition 243--257
Ulla Koppenhagen and
Ernst W. Mayr An Optimal Algorithm for Constructing
the Reduced Gröbner Basis of Binomial
Ideals, and Applications to Commutative
Semigroups . . . . . . . . . . . . . . . 259--276
Franz Baader and
Paliath Narendran Unification of Concept Terms in
Description Logics . . . . . . . . . . . 277--305
K. Kalorkoti Counting and Gröbner Bases . . . . . . . 307--313
Thomas Lickteig and
Marie-Françoise Roy Sylvester-Habicht Sequences and Fast
Cauchy Index Computation . . . . . . . . 315--341
F. Orecchia Implicitization of a General Union of
Parametric Varieties . . . . . . . . . . 343--356
Franck Aries and
Rachid Senoussi An Implicitization Algorithm for
Rational Surfaces with no Base Points 357--365
Christoph M. Hoffman and
Andrew Lomonosov and
Meera Sitharam Decomposition Plans for Geometric
Constraint Systems, Part I: Performance
Measures for CAD . . . . . . . . . . . . 367--408
Christoph M. Hoffman and
Andrew Lomonosov and
Meera Sitharam Decomposition Plans for Geometric
Constraint Problems, Part II: New
Algorithms . . . . . . . . . . . . . . . 409--427
R. B. Howlett and
L. J. Rylands and
D. E. Taylor Matrix Generators for Exceptional Groups
of Lie Type . . . . . . . . . . . . . . 429--445
Thom Mulders A Generalized Sylvester Identity and
Fraction-free Random Gaussian
Elimination . . . . . . . . . . . . . . 447--460
Raya Khanin and
Matthew Cartmell Parallelization of Perturbation
Analysis: Application to Large-scale
Engineering Problems . . . . . . . . . . 461--473
J.-P. Merlet A Parser for the Interval Evaluation of
Analytical Functions and its Application
to Engineering Problems . . . . . . . . 475--486
Abdelwaheb Ayari and
David Basin A Higher-order Interpretation of
Deductive Tableau . . . . . . . . . . . 487--520
Christopher W. Brown Simple CAD Construction and its
Applications . . . . . . . . . . . . . . 521--547
Sharon Brueggeman Septic Number Fields Which are Ramified
Only at One Small Prime . . . . . . . . 549--555
Serge Burckel Syntactical Methods for Braids of Three
Strands . . . . . . . . . . . . . . . . 557--564
Eimear Byrne and
Patrick Fitzpatrick Gröbner Bases over Galois Rings with an
Application to Decoding Alternant Codes 565--584
Carlos D'Andrea Resultants and Moving Surfaces . . . . . 585--602
T. Shaska Curves of Genus $2$ with $(N,N)$
Decomposable Jacobians . . . . . . . . . 603--617
Jianmin Zheng and
Thomas W. Sederberg A Direct Approach to Computing the
$\mu$-basis of Planar Rational Curves 619--629
Driss Bouziane and
Abdelilah Kandri Rody and
Hamid Maârouf Unmixed-dimensional Decomposition of a
Finitely Generated Perfect Differential
Ideal . . . . . . . . . . . . . . . . . 631--649
Eng-Wee Chionh Rectangular Corner Cutting and Dixon
$A$-resultants . . . . . . . . . . . . . 651--669
K. Kalorkoti Detecting Algebraic Curves in Bad
Position . . . . . . . . . . . . . . . . 671--690
Ziming Li and
Fritz Schwarz Rational Solutions of Riccati-like
Partial Differential Equations . . . . . 691--716
Joris van der Hoeven Fast Evaluation of Holonomic Functions
Near and in Regular Singularities . . . 717--743
David Bebbington and
Manfred Göbel KLEIN: a Mathematica Package for Radar
Polarimetry Based on Spinor and Tensor
Algebra . . . . . . . . . . . . . . . . 745--751
Anonymous Contents and Index to Volume 31 . . . . i--vii
Henk Barendregt and
Arjeh M. Cohen Electronic Communication of Mathematics
and the Interaction of Computer Algebra
Systems and Proof Assistants . . . . . . 3--22
Franz Binder and
Peter Mayr Algorithms for Finite Near-rings and
their $N$-groups . . . . . . . . . . . . 23--38
Gábor Bodnár and
Josef Schicho Two Computational Techniques for
Singularity Resolution . . . . . . . . . 39--54
Olga Caprotti and
Martijn Oostdijk Formal and Efficient Primality Proofs by
Use of Computer Algebra Oracles . . . . 55--70
Jean-Guillaume Dumas and
B. David Saunders and
Gilles Villard On Efficient Sparse Integer Matrix Smith
Normal Form Computations . . . . . . . . 71--99
Edward L. Green and
Lenwood S. Heath and
Craig A. Struble Constructing Homomorphism Spaces and
Endomorphism Rings . . . . . . . . . . . 101--117
Günter Landsmann and
Josef Schicho and
Franz Winkler The Parametrization of Canal Surfaces
and the Decomposition of Polynomials
into a Sum of Two Squares . . . . . . . 119--132
Izumi Miyamoto Computing Isomorphisms of Association
Schemes and its Application . . . . . . 133--141
Piotr Rudnicki and
Christoph Schwarzweller and
Andrzej Trybulec Commutative Algebra in the Mizar System 143--169
Anonymous Special Issue . . . . . . . . . . . . .
Leonard M. Adleman and
Ming-Deh Huang Counting Points on Curves and Abelian
Varieties Over Finite Fields . . . . . . 171--189
Gema M. Diaz-Toca and
Laureano Gonzalez-Vega Squarefree Decomposition of Univariate
Polynomials Depending on a Parameter.
Application to the Integration of
Parametric Rational Functions . . . . . 191--209
Emmanuel Hallouin Computing Local Integral Closures . . . 211--230
Gerardo Lafferriere and
George J. Pappas and
Sergio Yovine Symbolic Reachability Computation for
Families of Linear Vector Fields . . . . 231--253
Edward S. Letzter Constructing Irreducible Representations
of Finitely Presented Algebras . . . . . 255--262
Ryutaroh Matsumoto Computing the Radical of an Ideal in
Positive Characteristic . . . . . . . . 263--271
A. J. E. Ryba Condensation of Symmetrized Tensor
Powers . . . . . . . . . . . . . . . . . 273--289
Alfred Widiger Solving the Word Problem for Two Classes
of Non-associative Rings by Rewriting 291--301
Alessandro Armando and
Tudor Jebelean Special Issue on Calculemus-99:
Integrating Computation and Deduction
Foreword of the Guest Editors . . . . . 303--304
Alessandro Armando and
Alessandro Coglio and
Fausto Giunchiglia and
Silvio Ranise The Control Layer in Open Mechanized
Reasoning Systems: Annotations and
Tactics . . . . . . . . . . . . . . . . 305--332
Michael Beeson Automatic Derivation of the
Irrationality of $e$ . . . . . . . . . . 333--349
O. Caprotti and
A. M. Cohen On the Role of OpenMath in Interactive
Mathematical Documents . . . . . . . . . 351--364
Michael Kohlhase and
Andreas Franke MBase: Representing Knowledge and
Context for the Integration of
Mathematical Software Systems . . . . . 365--402
Sorin Stratulat A General Framework to Build Contextual
Cover Set Induction Provers . . . . . . 403--445
Anonymous Special Issue on Calculemus-99:
Integrating Computation and Deduction ??
Christopher W. Brown Improved Projection for Cylindrical
Algebraic Decomposition . . . . . . . . 447--465
George E. Collins Polynomial Minimum Root Separation . . . 467--473
W. A. de Graaf Computing with Quantized Enveloping
Algebras: PBW-Type Bases, Highest-Weight
Modules and $R$-Matrices . . . . . . . . 475--490
Peter Dräxler Normal Forms for Representations of
Representation-finite Algebras . . . . . 491--497
Burkhard Höfling Computing Projectors, Injectors,
Residuals and Radicals of Finite Soluble
Groups . . . . . . . . . . . . . . . . . 499--511
H. Michael Möller and
Ralf Tenberg Multivariate Polynomial System Solving
Using Intersections of Eigenspaces . . . 513--531
Sebastian Pauli Factoring Polynomials Over Local Fields 533--547
Mathias Schulze Algorithms for the Gauss-Manin
Connection . . . . . . . . . . . . . . . 549--564
Félix San-Juan and
Alberto Abad Algebraic and Symbolic Manipulation of
Poisson Series . . . . . . . . . . . . . 565--572
F. J. Castro-Jiménez and
J. Rafael Sendra Foreword by the Guest Editors . . . . . 573--574
Toshinori Oaku and
Nobuki Takayama Minimal Free Resolutions of Homogenized
$D$-modules . . . . . . . . . . . . . . 575--595
Harrison Tsai and
Uli Walther Computing Homomorphisms Between
Holonomic $D$-modules . . . . . . . . . 597--617
Laura Felicia Matusevich Rank Jumps in Codimension
$2A$-hypergeometric Systems . . . . . . 619--641
Rouchdi Bahloul Algorithm for Computing Bernstein-Sato
Ideals Associated with a Polynomial
Mapping . . . . . . . . . . . . . . . . 643--662
Anton Leykin Constructibility of the Set of
Polynomials with a Fixed Bernstein-Sato
Polynomial: an Algorithmic Approach . . 663--675
F. J. Castro-Jiménez and
J. M. Ucha-Enríquez Explicit Comparison Theorems for
$D$-modules . . . . . . . . . . . . . . 677--685
P. Jara and
J. Jódar $Uq(sl(2))$ Satisfies a Bernstein
Duality . . . . . . . . . . . . . . . . 687--698
Andre Hillebrand and
Wiland Schmale Towards an Effective Version of a
Theorem of Stafford . . . . . . . . . . 699--716
F. Aroca and
J. Cano Formal Solutions of Linear PDEs and
Convex Polyhedra . . . . . . . . . . . . 717--737
Anonymous Journal of Symbolic Computation, Volume
32 Contents and Author Index . . . . . . i--vii
Anonymous Special Issue on Effective Methods in
Rings of Differential Operators . . . . ??
Anonymous Volume $32$ Contents and Author Index ??
Christian Bauer and
Alexander Frink and
Richard Kreckel Introduction to the GiNaC Framework for
Symbolic Computation within the C++
Programming Language . . . . . . . . . . 1--12
Eng-Wee Chionh and
Ming Zhang and
Ronald N. Goldman Fast Computation of the Bezout and Dixon
Resultant Matrices . . . . . . . . . . . 13--29
Willem A. de Graaf and
Werner Nickel Constructing Faithful Representations of
Finitely-generated Torsion-free
Nilpotent Groups . . . . . . . . . . . . 31--41
Ralf Hemmecke Continuously Parameterized Symmetries
and Buchberger's Algorithm . . . . . . . 43--55
Frank Lübeck On the Computation of Elementary
Divisors of Integer Matrices . . . . . . 57--65
Patrik Nordbeck SAGBI Bases Under Composition . . . . . 67--76
Manfred Schmidt-Schauß and
Klaus U. Schulz Solvability of Context Equations with
Two Context Variables is Decidable . . . 77--122
Joris Van Der Hoeven FFT-like Multiplication of Linear
Differential Operators . . . . . . . . . 123--127
Bettina Eick and
Charles R. B. Wright Computing Subgroups by Exhibition in
Finite Solvable Groups . . . . . . . . . 129--143
S. A. Linton and
G. Pfeiffer and
E. F. Robertson and
N. Ru\vskuc Computing Transformation Semigroups . . 145--162
Jonas Månsson and
Patrik Nordbeck Regular Gröbner Bases . . . . . . . . . . 163--181
Antonio Montes A New Algorithm for Discussing Gröbner
Bases with Parameters . . . . . . . . . 183--208
David Andrew Smith Gröbner Bases in Orders of Algebraic
Number Fields . . . . . . . . . . . . . 209--220
Amelia Taylor The Inverse Gröbner Basis Problem in
Codimension Two . . . . . . . . . . . . 221--238
Shih Ping Tung Approximate Solutions of Polynomial
Equations . . . . . . . . . . . . . . . 239--254
Murray Bremner and
Irvin Hentzel Identities for the Associator in
Alternative Algebras . . . . . . . . . . 255--273
Karin Gatermann and
Birkett Huber A Family of Sparse Polynomial Systems
Arising in Chemical Reaction Systems . . 275--305
K. Kalorkoti Predicting Zero Coefficients in Formal
Power Series Computations . . . . . . . 307--320
P. P. Boyle and
W. Tian and
Fred Guan The Riccati Equation in Mathematical
Finance . . . . . . . . . . . . . . . . 343--355
N. G. Lloyd and
J. M. Pearson Symmetry in Planar Dynamical Systems . . 357--366
Thomas Wolf Size Reduction and Partial Decoupling of
Systems of Equations . . . . . . . . . . 367--383
Anonymous Applications . . . . . . . . . . . . . . ??
Scott McCallum and
George E. Collins Local Box Adjacency Algorithms for
Cylindrical Algebraic Decompositions . . 32--342
George E. Collins A Fast Euclidean Algorithm for Gaussian
Integers . . . . . . . . . . . . . . . . 385--392
Ioannis Z. Emiris and
Victor Y. Pan Symbolic and Numeric Methods for
Exploiting Structure in Constructing
Resultant Matrices . . . . . . . . . . . 393--413
Farshid Hajir and
Christian Maire Tamely Ramified Towers and Discriminant
Bounds for Number Fields----II . . . . . 415--423
F. Hess Computing Riemann--Roch Spaces in
Algebraic Function Fields and Related
Topics . . . . . . . . . . . . . . . . . 425--445
Hoon Hong and
Manfred Minimair Sparse Resultant of Composed Polynomials
I Mixed--Unmixed Case . . . . . . . . . 447--465
Manfred Minimair Sparse Resultant of Composed Polynomials
II Unmixed--Mixed Case . . . . . . . . . 467--478
Dimitrios Poulakis and
Evaggelos Voskos Solving Genus Zero Diophantine Equations
with at Most Two Infinite Valuations . . 479--491
Stefan Ratschan Quantified Constraints Under
Perturbation . . . . . . . . . . . . . . 493--505
Xuan Zhao and
Haibao Duan A Mathematica Program for the Degrees of
Certain Schubert Varieties . . . . . . . 507--517
Gilles Villard Preface . . . . . . . . . . . . . . . . 519--519
S. A. Abramov and
M. Petkov ek Rational Normal Forms and Minimal
Decompositions of Hypergeometric Terms 521--543
Jaime Gutierrez and
Rosario Rubio and
David Sevilla On Multivariate Rational Function
Decomposition . . . . . . . . . . . . . 545--562
Gene Cooperman and
Victor Grinberg Scalable Parallel Coset Enumeration:
Bulk Definition and the Memory Wall . . 563--585
Carlos D'Andrea and
Ioannis Z. Emiris Hybrid Sparse Resultant Matrices for
Bivariate Polynomials . . . . . . . . . 587--608
E. Fortuna and
P. Gianni and
B. Trager Derivations and Radicals of Polynomial
Ideals over Fields of Arbitrary
Characteristic . . . . . . . . . . . . . 609--625
Steven Fortune An Iterated Eigenvalue Algorithm for
Approximating Roots of Univariate
Polynomials . . . . . . . . . . . . . . 627--646
Mikhail V. Foursov and
Marc Moreno Maza On Computer-assisted Classification of
Coupled Integrable Equations . . . . . . 647--660
André Galligo and
David Rupprecht Irreducible Decomposition of Curves . . 661--677
Bernard Mourrain and
Olivier Ruatta Relations Between Roots and
Coefficients, Interpolation and
Application to System Solving . . . . . 679--699
Victor Y. Pan Univariate Polynomials: Nearly Optimal
Algorithms for Numerical Factorization
and Root-finding . . . . . . . . . . . . 701--733
Alexandre Sedoglavic A Probabilistic Algorithm to Test Local
Algebraic Observability in Polynomial
Time . . . . . . . . . . . . . . . . . . 735--755
Emmanuel Thomé Subquadratic Computation of Vector
Generating Polynomials and Improvement
of the Block Wiedemann Algorithm . . . . 757--775
Uwe Waldmann Cancellative Abelian Monoids and Related
Structures in Refutational Theorem
Proving (Part I) . . . . . . . . . . . . 777--829
Uwe Waldmann Cancellative Abelian Monoids and Related
Structures in Refutational Theorem
Proving (Part II) . . . . . . . . . . . 831--861
J. Rafael Sendra Normal Parametrizations of Algebraic
Plane Curves . . . . . . . . . . . . . . 863--885
Peter Berman Calculating the Galois Group of $Y' = AY
+ B, Y' = AY$ Completely Reducible . . . 887--898
Bettina Eick Orbit-stabilizer Problems and Computing
Normalizers for Polycyclic Groups . . . 1--19
Jürgen Giesl and
Thomas Arts and
Enno Ohlebusch Modular Termination Proofs for Rewriting
Using Dependency Pairs . . . . . . . . . 21--58
Gema M. Diaz-Toca and
Laureano Gonzalez-Vega Barnett's Theorems About the Greatest
Common Divisor of Several Univariate
Polynomials Through Bezout-like Matrices 59--81
Huah Chu and
Ming-chang Kang Quartic Fields and Radical Extensions 83--89
Anonymous Journal of Symbolic Computation, Volume
33 Contents and Author Index . . . . . . i--vii
S. Kaplan and
M. Teicher Identifying Half-Twists Using Randomized
Algorithm Methods . . . . . . . . . . . 91--103
Driss Bouziane and
Mhammed El Kahoui Computation of the Dual of a Plane
Projective Curve . . . . . . . . . . . . 105--117
Alicia Dickenstein and
Bernd Sturmfels Elimination Theory in Codimension $2$ 119--135
István Gaál On the Resolution of Resultant Type
Equations . . . . . . . . . . . . . . . 137--144
George E. Collins and
Jeremy R. Johnson and
Werner Krandick Interval Arithmetic in Cylindrical
Algebraic Decomposition . . . . . . . . 145--157
Mark Giesbrecht and
Arne Storjohann Computing Rational Forms of Integer
Matrices . . . . . . . . . . . . . . . . 157--172
Masanari Kida Potential Good Reduction of Elliptic
Curves . . . . . . . . . . . . . . . . . 173--180
Marcus Hausdorf and
Werner M. Seiler and
Rainer Steinwandt Involutive Bases in the Weyl Algebra . . 181--198
Bernd Martin Algorithmic Computation of Flattenings
and of Modular Deformations . . . . . . 199--212
Volker Gebhardt Efficient Collection in Infinite
Polycyclic Groups . . . . . . . . . . . 213--228
Gregor Kemper The Calculation of Radical Ideals in
Positive Characteristic . . . . . . . . 229--238
Steve Linton and
Roberto Sebastiani Editorial: The Integration of Automated
Reasoning and Computer Algebra Systems 239--239
Alessandro Armando and
Michaël Rusinowitch and
Sorin Stratulat Incorporating Decision Procedures in
Implicit Induction . . . . . . . . . . . 241--258
James H. Davenport Equality in Computer Algebra and Beyond 259--270
Herman Geuvers and
Randy Pollack and
Freek Wiedijk and
Jan Zwanenburg A Constructive Algebraic Hierarchy in
Coq . . . . . . . . . . . . . . . . . . 271--286
Andreas Meier and
Martin Pollet and
Volker Sorge Comparing Approaches to the Exploration
of the Domain of Residue Classes . . . . 287--306
R. James Shank and
David L. Wehlau Computing Modular Invariants of
$p$-groups . . . . . . . . . . . . . . . 307--327
Akalu Tefera MultInt, a MAPLE Package for Multiple
Integration by the WZ Method . . . . . . 329--353
Olivier Cormier and
Michael F. Singer and
Barry M. Trager and
Felix Ulmer Linear Differential Operators for
Polynomial Equations . . . . . . . . . . 355--398
Edward Mosteig and
Moss Sweedler Valuations and Filtrations . . . . . . . 399--435
Clemens Heuberger and
Attila Peth and
Robert F. Tichy Thomas' Family of Thue Equations Over
Imaginary Quadratic Fields . . . . . . . 437--449
Chris Monico Computing the Primary Decomposition of
Zero-dimensional Ideals . . . . . . . . 451--459
Bican Xia and
Lu Yang An Algorithm for Isolating the Real
Solutions of Semi-algebraic Systems . . 461--477
Joris van der Hoeven Relax, but Don't be Too Lazy . . . . . . 479--542
Philippe Aubry and
Fabrice Rouillier and
Mohab Safey El Din Real Solving for Positive Dimensional
Systems . . . . . . . . . . . . . . . . 543--560
Markus Püschel Decomposing Monomial Representations of
Solvable Groups . . . . . . . . . . . . 561--596
Werner M. Seiler Taylor and Lyubeznik Resolutions via
Gröbner Bases . . . . . . . . . . . . . . 597--608
Anonymous Contents and Index of Volume 34 . . . . i--v
Anonymous Publisher's Note . . . . . . . . . . . . 1--2
Paolo Aluffi Computing characteristic classes of
projective schemes . . . . . . . . . . . 3--19
Hans de Nivelle and
Maarten de Rijke Deciding the guarded fragments by
resolution . . . . . . . . . . . . . . . 21--58
Ronald Brown and
Christopher D. Wensley Computation and homotopical applications
of induced crossed modules . . . . . . . 59--72
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Miroslav N. Velev and
Randal E. Bryant Effective use of Boolean satisfiability
procedures in the formal verification of
superscalar and VLIW microprocessors . . 73--106
M. R. Bush and
M. Leeming and
R. F. C. Walters Computing left Kan extensions . . . . . 107--126
Michael Fleming and
Ryan Gunther and
Robert Rosebrugh A database of categories . . . . . . . . 127--135
Susan B. Niefield Implementing finite structures in
Mathematica via a skeletal topos of
finite sets . . . . . . . . . . . . . . 137--151
Jinwang Liu and
Zhuojun Liu and
Mingsheng Wang The term orderings which are compatible
with composition II . . . . . . . . . . 153--168
Serge Burckel A result on braids via the investigation
of a rewriting system . . . . . . . . . 169--175
Teo Mora and
Massimiliano Sala On the Gröbner bases of some symmetric
systems and their application to coding
theory . . . . . . . . . . . . . . . . . 177--194
Peter A. Brooksbank Constructive recognition of classical
groups in their natural representation 195--239
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
John J. Cannon and
Derek F. Holt Automorphism group computation and
isomorphism testing in finite groups . . 241--267
Rosemary Baines and
Peter Vámos An algorithm to compute the set of
characteristics of a system of
polynomial equations over the integers 269--279
Mhammed El Kahoui An elementary approach to subresultants
theory . . . . . . . . . . . . . . . . . 281--292
Bao-Yin Zhang A new elementary algorithm for proving
$q$-hypergeometric identities . . . . . 293--303
Wolfgang Schreiner and
Christian Mittermaier and
Karoly Bosa Distributed Maple: parallel computer
algebra in networked environments . . . 305--347
Axel Riese qMultiSum ----a package for proving
$q$-hypergeometric multiple summation
identities . . . . . . . . . . . . . . . 349--376
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
T. Mulders and
A. Storjohann On lattice reduction for polynomial
matrices . . . . . . . . . . . . . . . . 377--401
Elizabeth A. Arnold Modular algorithms for computing Gröbner
bases . . . . . . . . . . . . . . . . . 403--419
Colva M. Roney-Dougal and
William R. Unger The affine primitive permutation groups
of degree less than $1000$ . . . . . . . 421--439
Thomas Bayer An algorithm for computing invariants of
linear actions of algebraic groups up to
a given degree . . . . . . . . . . . . . 441--449
John B. Little and
David Ortiz and
Ricardo Ortiz-Rosado and
Rebecca Pablo and
Karen Ríos-Soto Some remarks on Fitzpatrick and Flynn's
Gröbner basis technique for Padé
approximation . . . . . . . . . . . . . 451--461
Anonymous Advert . . . . . . . . . . . . . . . . . CO3--CO3
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Wolfram Koepf and
Karin Gatermann Preface to Computer Algebra and Computer
Analysis . . . . . . . . . . . . . . . . 463--464
Amparo Gil and
Javier Segura A combined symbolic and numerical
algorithm for the computation of zeros
of orthogonal polynomials and special
functions . . . . . . . . . . . . . . . 465--485
François Lemaire An orderly linear PDE system with
analytic initial conditions with a
non-analytic solution . . . . . . . . . 487--498
Thomas Wolf The integration of systems of linear
PDEs using conservation laws of syzygies 499--526
Uli Walther Cohomology, stratifications and
parametric Gröbner bases in
characteristic zero . . . . . . . . . . 527--542
Karin Gatermann Applications of SAGBI-bases in dynamics 543--575
Abdul Salam Jarrah and
Reinhard Laubenbacher and
Valery Romanovski The Sibirsky component of the center
variety of polynomial differential
systems . . . . . . . . . . . . . . . . 577--589
Pei Yu and
Yuan Yuan A matching pursuit technique for
computing the simplest normal forms of
vector fields . . . . . . . . . . . . . 591--615
A. Jacquemard and
M. A. Teixeira Computer analysis of periodic orbits of
discontinuous vector fields . . . . . . 617--636
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Maurice Mignotte and
Doru tef nescu Linear recurrent sequences and
polynomial roots . . . . . . . . . . . . 637--649
Marc Rybowicz On the normalization of numbers and
functions defined by radicals . . . . . 651--672
Aurora Olivieri and
Ángel del Río An algorithm to compute the primitive
central idempotents and the Wedderburn
decomposition of a rational group
algebra . . . . . . . . . . . . . . . . 673--687
Alain Lascoux and
Piotr Pragacz Double Sylvester sums for subresultants
and multi-Schur functions . . . . . . . 689--710
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Peter Baumgartner and
Hantao Zhang Preface to First Order Theorem Proving 1--3
Nicolas Peltier Model building with ordered resolution:
extracting models from saturated clause
sets . . . . . . . . . . . . . . . . . . 5--48
Nicolas Peltier A calculus combining resolution and
enumeration for building finite models 49--77
Anatoli Degtyarev and
Robert Nieuwenhuis and
Andrei Voronkov Stratified resolution . . . . . . . . . 79--99
Alexandre Riazanov and
Andrei Voronkov Limited resource strategy in resolution
theorem proving . . . . . . . . . . . . 101--115
Bernhard Beckert Depth-first proof search without
backtracking for free-variable clausal
tableaux . . . . . . . . . . . . . . . . 117--138
Jens Otten and
Wolfgang Bibel \tt leanCoP: lean connection-based
theorem proving . . . . . . . . . . . . 139--161
Lilia Georgieva and
Ullrich Hustadt and
Renate A. Schmidt Hyperresolution for guarded formulae . . 163--192
Alessandro Armando and
Silvio Ranise Constraint contextual rewriting . . . . 193--216
J. Avenhaus and
Th. Hillenbrand and
B. Löchner On using ground joinable equations in
equational theorem proving . . . . . . . 217--233
Reinhard Pichler On the complexity of equational problems
in CNF . . . . . . . . . . . . . . . . . 235--269
Johan Gijsbertus Frederik Belinfante Computer proofs about finite and regular
sets: the unifying concept of
subvariance . . . . . . . . . . . . . . 271--285
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Marc Giusti and
Luis M. Pardo Preface . . . . . . . . . . . . . . . . 287--287
Arthur D. Chtcherba and
Deepak Kapur Exact resultants for corner-cut unmixed
multivariate polynomial systems using
the Dixon formulation . . . . . . . . . 289--315
Alicia Dickenstein and
Ioannis Z. Emiris Multihomogeneous resultant formulae by
means of complexes . . . . . . . . . . . 317--342
E. Fortuna and
P. Gianni and
P. Parenti and
C. Traverso Algorithms to compute the topology of
orientable real algebraic surfaces . . . 343--364
Erich Kaltofen and
Wen-shin Lee Early termination in sparse
interpolation algorithms . . . . . . . . 365--400
Mark Giesbrecht and
Erich Kaltofen and
Wen-shin Lee Algorithms for computing sparsest shifts
of polynomials in power, Chebyshev, and
Pochhammer bases . . . . . . . . . . . . 401--424
Amit Khetan The resultant of an unmixed bivariate
system . . . . . . . . . . . . . . . . . 425--442
Ziming Li and
Fritz Schwarz and
Serguei P. Tsarev Factoring systems of linear PDEs with
finite-dimensional solution spaces . . . 443--471
G. Matera and
A. Sedoglavic Fast computation of discrete invariants
associated to a differential rational
mapping . . . . . . . . . . . . . . . . 473--499
Peter J. Olver Moving frames . . . . . . . . . . . . . 501--512
Renaud Rioboo Towards faster real algebraic numbers 513--533
Josef Schicho Simplification of surface
parametrizations----a lattice polygon
approach . . . . . . . . . . . . . . . . 535--554
Éric Schost Complexity results for triangular sets 555--594
Michael Stillman Computing in algebraic geometry and
commutative algebra using Macaulay 2 . . 595--611
Arne Storjohann High-order lifting and integrality
certification . . . . . . . . . . . . . 613--648
Akira Suzuki and
Yosuke Sato An alternative approach to comprehensive
Gröbner bases . . . . . . . . . . . . . . 649--667
Volker Weispfenning Canonical comprehensive Gröbner bases . . 669--683
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Jan Draisma Constructing Lie algebras of first order
differential operators . . . . . . . . . 685--698
Falai Chen and
Wenping Wang Revisiting the $\mu$-basis of a rational
ruled surface . . . . . . . . . . . . . 699--716
Hongbo Li and
Yihong Wu Automated short proof generation for
projective geometric theorems with
Cayley and bracket algebras: I.
Incidence geometry . . . . . . . . . . . 717--762
Hongbo Li and
Yihong Wu Automated short proof generation for
projective geometric theorems with
Cayley and bracket algebras: II. Conic
geometry . . . . . . . . . . . . . . . . 763--809
Xiao-Shan Gao Implicitization of differential rational
parametric equations . . . . . . . . . . 811--824
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Manfred Minimair Dense resultant of composed polynomials:
Mixed--mixed case . . . . . . . . . . . 825--834
Joost Berson and
Arno van den Essen An algorithm to find a coordinate's mate 835--843
Jesús Gago-Vargas Bases for projective modules in $A_n(k)$ 845--853
Felix Ulmer Liouvillian solutions of third order
differential equations . . . . . . . . . 855--889
Viorica Sofronie-Stokkermans Resolution-based decision procedures for
the universal theory of some classes of
distributive lattices with operators . . 891--924
Sonia Pérez-Díaz and
J. Rafael Sendra Computing all parametric solutions for
blending parametric surfaces . . . . . . 925--964
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Anonymous Editorial Board . . . . . . . . . . . . 1--1
Guillem Godoy and
Robert Nieuwenhuis Superposition with completely built-in
Abelian groups . . . . . . . . . . . . . 1--33
W. Eberly and
M. Giesbrecht Efficient decomposition of separable
algebras . . . . . . . . . . . . . . . . 35--81
Zeng Guangxing and
Zeng Xiaoning An effective decision method for
semidefinite polynomials . . . . . . . . 83--99
Mao-Ching Foo and
Eng-Wee Chionh Corner edge cutting and Dixon
$\mathcal{A}$-resultant quotients . . . 101--119
Anonymous Contents . . . . . . . . . . . . . . . . 121--125
Anonymous Index . . . . . . . . . . . . . . . . . 127--132
Jeremy R. Johnson and
José M. F. Moura and
Markus Püschel and
Daniel Rockmore Special issue on computer algebra and
signal processing: forward by the guest
editors . . . . . . . . . . . . . . . . 133--135
M. Clausen and
M. Müller Generating fast Fourier transforms of
solvable groups . . . . . . . . . . . . 137--156
Sebastian Egner and
Markus Püschel Symmetry-based matrix factorization . . 157--186
Richard Foote and
Gagan Mirchandani and
Daniel Rockmore Two-dimensional wreath product
group-based image processing . . . . . . 187--207
Hyungju Park Symbolic computation and signal
processing . . . . . . . . . . . . . . . 209--226
Jérôme Lebrun and
Ivan Selesnick Gröbner bases and wavelet design . . . . 227--259
Jeremy R. Johnson and
Anthony F. Breitzman Automatic derivation and implementation
of fast convolution algorithms . . . . . 261--293
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
E. Ballico and
F. Orecchia Computing minimal generators of the
ideal of a general projective curve . . 295--304
Serge Burckel Elementary decompositions of arbitrary
maps over finite sets . . . . . . . . . 305--310
I. Th. Famelis and
S. N. Papakostas and
Ch. Tsitouras Symbolic derivation of Runge--Kutta
order conditions . . . . . . . . . . . . 311--327
\cStefan Andrei and
Wei-Ngan Chin Solving a class of higher-order
equations over a group structure . . . . 329--341
Friedrich Otto and
Olga Sokratova Reduction relations for monoid semirings 343--376
Min-Ho Ahn and
Gwang-Il Kim Characterization of Pythagorean curves
and Pythagoreanization using a rational
transform . . . . . . . . . . . . . . . 377--389
G. Hanrot and
P. Zimmermann A long note on Mulders' short product 391--401
Juan Migliore and
Chris Peterson A symbolic test for ( i, j )-uniformity
in reduced zero-dimensional schemes . . 403--413
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Andrew V. Sills RRtools --- a Maple package for aiding
the discovery and proof of finite
Rogers--Ramanujan type identities . . . 415--448
Hoon Hong Note on Jacobi's method for
approximating dominant roots . . . . . . 449--453
Alberto Oliart and
Wayne Snyder Fast algorithms for uniform
semi-unification . . . . . . . . . . . . 455--484
T. Mulders and
A. Storjohann Certified dense linear system solving 485--510
Hervé Perdry Strongly Noetherian rings and
constructive ideal theory . . . . . . . 511--535
Hongbo Shi Computation of the finitistic dimension
of monomial algebras . . . . . . . . . . 537--546
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Nicolas Rennert A parallel multi-modular algorithm for
computing Lagrange resolvents . . . . . 547--556
David Rupprecht Semi-numerical absolute factorization of
polynomials with integer coefficients 557--574
Edgar Martínez-Moro Regular representations of
finite-dimensional separable semisimple
algebras and Gröbner bases . . . . . . . 575--587
John Cannon and
Derek F. Holt Computing maximal subgroups of finite
groups . . . . . . . . . . . . . . . . . 589--609
Kouichi Hirata and
Keizo Yamada and
Masateru Harao Tractable and intractable second-order
matching problems . . . . . . . . . . . 611--628
J. M. Ucha and
F. J. Castro-Jiménez On the computation of Bernstein--Sato
ideals . . . . . . . . . . . . . . . . . 629--639
Karim Belabas A relative van Hoeij algorithm over
number fields . . . . . . . . . . . . . 641--668
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
D. Baldwin and
Ü. Gökta\vs and
W. Hereman and
L. Hong and
R. S. Martino and
J. C. Miller Symbolic computation of exact solutions
expressible in hyperbolic and elliptic
functions for nonlinear PDEs . . . . . . 669--705
Marcelo Fiore and
Tom Leinster An objective representation of the
Gaussian integers . . . . . . . . . . . 707--716
Juan Elias On the computation of the Ratliff--Rush
closure . . . . . . . . . . . . . . . . 717--725
Dan Bernstein The computational complexity of rules
for the character table of $S_n$ . . . . 727--748
Ana Marco and
José-Javier Martínez Parallel computation of determinants of
matrices with polynomial entries . . . . 749--760
Nick T. Koussoulas and
Photis Skiadas Symbolic computation for mobile robot
path planning . . . . . . . . . . . . . 761--775
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Arthur D. Chtcherba and
Deepak Kapur Constructing Sylvester-type resultant
matrices using the Dixon formulation . . 777--814
Yong-Bin Li Applications of the theory of weakly
nondegenerate conditions to zero
decomposition for polynomial systems . . 815--832
Claus Fieker Minimizing representations over number
fields . . . . . . . . . . . . . . . . . 833--842
Cristina Blanco and
Gabriela Jeronimo and
Pablo Solernó Computing generators of the ideal of a
smooth affine algebraic variety . . . . 843--872
Claude Marché and
Xavier Urbain Modular and incremental proofs of
AC-termination . . . . . . . . . . . . . 873--897
Dongming Wang A simple method for implicitizing
rational curves and surfaces . . . . . . 899--914
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
A. D. Chtcherba and
D. Kapur Resultants for unmixed bivariate
polynomial systems produced using the
Dixon formulation . . . . . . . . . . . 915--958
J. A. De Loera and
D. Haws and
R. Hemmecke and
P. Huggins and
B. Sturmfels and
R. Yoshida Short rational functions for toric
algebra and applications . . . . . . . . 959--973
Anne Fredet Linear differential equations in
exponential extensions . . . . . . . . . 975--1002
Lenwood S. Heath and
Nicholas A. Loehr New algorithms for generating Conway
polynomials over finite fields . . . . . 1003--1024
María-Jesús Pisabarro Computing lattice ideals of unions of
monomial curves . . . . . . . . . . . . 1025--1042
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Thomas Cluzeau and
Mark van Hoeij A modular algorithm for computing the
exponential solutions of a linear
differential operator . . . . . . . . . 1043--1076
Graham Ellis Computing group resolutions . . . . . . 1077--1118
Haibao Duan and
Xu-an Zhao and
Xuezhi Zhao The Cartan matrix and enumerative
calculus . . . . . . . . . . . . . . . . 1119--1144
Clemens Heuberger and
Alain Togbé and
Volker Ziegler Automatic solution of families of Thue
equations and an example of degree $8$ 1145--1163
S. A. Abramov and
M. Petkov\vsek Erratum to ``Rational normal forms and
minimal decompositions of hypergeometric
terms'' [J. Symbolic Comput. 33 (2002)
521--543] . . . . . . . . . . . . . . . 1165--1165
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Arjeh M. Cohen and
Xiao-Shan Gao and
Nobuki Takayama Editorial . . . . . . . . . . . . . . . 1167--1168
M. Caboara and
M. Kreuzer and
L. Robbiano Efficiently computing minimal sets of
critical pairs . . . . . . . . . . . . . 1169--1190
Anne Frühbis-Krüger Partial standard bases as a tool for
studying families of singularities . . . 1191--1205
Mathias Schulze A normal form algorithm for the
Brieskorn lattice . . . . . . . . . . . 1207--1225
Masayuki Noro and
Kazuhiro Yokoyama Implementation of prime decomposition of
polynomial ideals over small finite
fields . . . . . . . . . . . . . . . . . 1227--1246
Michael Joswig and
Günter M. Ziegler Convex hulls, oracles, and homology . . 1247--1259
Komei Fukuda From the zonotope construction to the
Minkowski addition of convex polytopes 1261--1272
Jesús A. De Loera and
Raymond Hemmecke and
Jeremiah Tauzer and
Ruriko Yoshida Effective lattice point counting in
rational convex polytopes . . . . . . . 1273--1302
S. A. Abramov and
J. J. Carette and
K. O. Geddes and
H. Q. Le Telescoping in the context of symbolic
summation in Maple . . . . . . . . . . . 1303--1326
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Lê Tuân Hoa and
Eero Hyry Castelnuovo--Mumford regularity of
initial ideals . . . . . . . . . . . . . 1327--1341
Thom Mulders Certified sparse linear system solving 1343--1373
Marco Bozzano and
Giorgio Delzanno Automatic verification of secrecy
properties for linear logic
specifications of cryptographic
protocols . . . . . . . . . . . . . . . 1375--1415
Arnaud Bodin Computation of Milnor numbers and
critical values at infinity . . . . . . 1417--1427
Xavier-François Roblot Polynomial factorization algorithms over
number fields . . . . . . . . . . . . . 1429--1443
John J. Cannon and
Bettina Eick and
Charles R. Leedham-Green Special polycyclic generating sequences
for finite soluble groups . . . . . . . 1445--1460
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Shuhong Gao and
Erich Kaltofen and
Alan G. B. Lauder Deterministic distinct-degree
factorization of polynomials over finite
fields . . . . . . . . . . . . . . . . . 1461--1470
Peter Kirschenhofer and
Jörg M. Thuswaldner Elements of small norm in Shanks' cubic
extensions of imaginary quadratic fields 1471--1486
Rikard Bògvad and
Thomas Meyer On algorithmically checking whether a
Hilbert series comes from a complete
intersection . . . . . . . . . . . . . . 1487--1506
George E. Collins Single-factor coefficient bounds . . . . 1507--1521
Nicoleta B\^\il\ua and
Jitse Niesen On a new procedure for finding
nonclassical symmetries . . . . . . . . 1523--1533
Anton Leykin Algorithmic proofs of two theorems of
Stafford . . . . . . . . . . . . . . . . 1535--1550
E. Fortuna and
P. Gianni and
D. Luminati Algorithmical determination of the
topology of a real algebraic surface . . 1551--1567
Anonymous Contents of Volumes 37 and 38 . . . . . ??
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Anonymous Index to Volumes 37 and 38 . . . . . . . ??
Alexander Hulpke Constructing transitive permutation
groups . . . . . . . . . . . . . . . . . 1--30
J. Abbott and
M. Kreuzer and
L. Robbiano Computing zero-dimensional schemes . . . 31--49
Hans-Christian Graf v. Bothmer and
Cord Erdenberger and
Katharina Ludwig A new family of rational surfaces in
$P^4$ . . . . . . . . . . . . . . . . . 51--60
M'hammed El Kahoui Birational properties of the gap
subresultant varieties . . . . . . . . . 61--71
William A. Adkins and
J. William Hoffman and
Hao Hao Wang Equations of parametric surfaces with
base points via syzygies . . . . . . . . 73--101
Mathias Schulze Good bases for tame polynomials . . . . 103--126
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Ruth L. Auerbach The Gröbner fan and Gröbner walk for
modules . . . . . . . . . . . . . . . . 127--153
William Y. C. Chen and
Qing-Hu Hou and
Yan-Ping Mu Applicability of the $q$-analogue of
Zeilberger's algorithm . . . . . . . . . 155--170
Markus Rosenkranz A new symbolic method for solving linear
two-point boundary value problems on the
level of operators . . . . . . . . . . . 171--199
Mohamud Mohammed and
Doron Zeilberger Sharp upper bounds for the orders of the
recurrences output by the Zeilberger and
$q$-Zeilberger algorithms . . . . . . . 201--207
Maria Paola Bonacina Towards a unified model of search in
theorem-proving: subgoal-reduction
strategies . . . . . . . . . . . . . . . 209--255
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Arjeh M. Cohen and
Gert-Martin Greuel and
Marie-Françoise Roy Preface . . . . . . . . . . . . . . . . 257--258
Carlos D'Andrea and
Gabriela Jeronimo Subresultants and generic monomial bases 259--277
Jan Draisma Representation theory on the open Bruhat
cell . . . . . . . . . . . . . . . . . . 279--303
E. Fortuna and
P. Gianni and
B. Trager Irreducible decomposition of polynomial
ideals . . . . . . . . . . . . . . . . . 305--316
Laurent Busé and
André Galligo Semi-implicit representations of
surfaces in ${\mathbb{P}^3}$, resultants
and applications . . . . . . . . . . . . 317--329
Luis David Garcia and
Michael Stillman and
Bernd Sturmfels Algebraic geometry of Bayesian networks 331--355
Harm Derksen and
Emmanuel Jeandel and
Pascal Koiran Quantum automata and algebraic groups 357--371
David Helm and
Ezra Miller Algorithms for graded injective
resolutions and local cohomology over
semigroup rings . . . . . . . . . . . . 373--395
B. Mourrain Bezoutian and quotient ring structure 397--415
Michel Granger and
Toshinori Oaku and
Nobuki Takayama Tangent cone algorithm for homogenized
differential operators . . . . . . . . . 417--431
Joris van der Hoeven Effective analytic functions . . . . . . 433--449
Marius van der Put Galois theory and algorithms for linear
differential equations . . . . . . . . . 451--463
Orlando Villamayor U. On constructive desingularization . . . 465--491
Uli Walther Algorithmic stratification of
$\mathbb{R}
\mathcal{H}\mathrm{om}_{\mathcal{D}}(\mathcal{M},\mathcal{N})$ for regular algebraic $\mathcal{D}$-modules on $\mathbb{C}^n$ 493--499
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Olga Caprotti and
Volker Sorge Integration of automated reasoning and
computer algebra systems . . . . . . . . 501--502
Alessandro Armando and
Clemens Ballarin A reconstruction and extension of
Maple's assume facility via constraint
contextual rewriting . . . . . . . . . . 503--521
Michael Beeson and
Freek Wiedijk The meaning of infinity in calculus and
computer algebra systems . . . . . . . . 523--538
Hanne Gottliebsen and
Tom Kelsey and
Ursula Martin Hidden verification for computational
mathematics . . . . . . . . . . . . . . 539--567
David Delahaye and
Micaela Mayero Dealing with algebraic expressions over
a field in Coq using Maple . . . . . . . 569--592
Simon Colton Automated conjecture making in number
theory using HR, Otter and Maple . . . . 593--615
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Michael E. Pohst Factoring polynomials over global fields
I . . . . . . . . . . . . . . . . . . . 617--630
Xu-an Zhao and
Hongzhu Gao and
Xiaole Su Homotopy classification of maps between
simply connected four manifolds . . . . 631--642
Ivan Bjerre Damgård and
Gudmund Skovbjerg Frandsen Efficient algorithms for the gcd and
cubic residuosity in the ring of
Eisenstein integers . . . . . . . . . . 643--652
Christopher J. Hillar Cyclic resultants . . . . . . . . . . . 653--669
Vahid Dabbaghian-Abdoly An algorithm for constructing
representations of finite groups . . . . 671--688
Falai Chen and
David Cox and
Yang Liu The $\mu$-basis and implicitization of a
rational parametric surface . . . . . . 689--706
Henri Lombardi and
Ihsen Yengui Suslin's algorithms for reduction of
unimodular rows . . . . . . . . . . . . 707--717
Juan Gerardo Alcázar and
J. Rafael Sendra Computation of the topology of real
algebraic space curves . . . . . . . . . 719--744
Anonymous Editorial Board . . . . . . . . . . . . CO2--CO2
Bernhard Gramlich and
Salvador Lucas Reduction strategies in rewriting and
programming . . . . . . . . . . . . . . 745--747
Pierre Réty and
Julie Vuotto Tree automata for rewrite strategies . . 749--794
Elvira Albert and
Michael Hanus and
Frank Huch and
Javier Oliver and
Germán Vidal Operational semantics for declarative
multi-paradigm languages . . . . . . . . 795--829
Eelco Visser A survey of strategies in rule-based
program transformation systems . . . . . 831--873
Sergio Antoy Evaluation strategies for functional
logic programming . . . . . . . . . . . 875--903
Manfred Schmidt-Schauß and
Klaus U. Schulz Decidability of bounded higher-order
unification . . . . . . . . . . . . . . 905--954
William Y. C. Chen and
Husam L. Saad On the Gosper--Petkov\vsek
representation of rational functions . . 955--963
Elizabeth Gasparim and
Irena Swanson Computing instanton numbers of curve
singularities . . . . . . . . . . . . . 965--978
Sebastian Gann and
Herwig Hauser Perfect bases for differential equations 979--997
Josep \`Alvarez Montaner Operations with regular holonomic
$\mathcal{D}$-modules with support a
normal crossing . . . . . . . . . . . . 999--1012
John J. Cannon and
Derek F. Holt and
Michael Slattery and
Allan K. Steel Computing subgroups of bounded index in
a finite group . . . . . . . . . . . . . 1013--1022