Table of contents for issues of Journal of Symbolic Computation

Last update: Thu Sep 18 05:52:40 MDT 2014                Valid HTML 3.2!

Volume 1, Number 1, March, 1985
Volume 1, Number 2, June, 1985
Volume 1, Number 3, September, 1985
Volume 1, Number 4, December, 1985
Volume 2, Number 1, March, 1986
Volume 2, Number 2, June, 1986
Volume 2, Number 3, September, 1986
Volume 2, Number 4, December, 1986
Volume 3, Number 1, 1986
Volume 3, Number 1--2, February / April, 1987
Volume 3, Number 3, June, 1987
Volume 4, Number 1, 1987
Volume 4, Number 2, October, 1987
Volume 4, Number 3, December, 1987
Volume 5, Number 1--2, February / April, 1988
Volume 5, Number 3, June, 1988
Volume 6, Number 1, August, 1988
Volume 6, Number 2--3, October / December, 1988
Volume 7, Number 1, January, 1989
Volume 7, Number 2, February, 1989
Volume 7, Number 3--4, March / April, 1989
Volume 7, Number 5, May, 1989
Volume 7, Number 6, June, 1989
Volume 8, Number 1--2, July / August, 1989
Volume 8, Number 3, September, 1989
Volume 8, Number 4, October, 1989
Volume 8, Number 5, November, 1989
Volume 8, Number 6, December, 1989
Volume 9, Number 1, January, 1990
Volume 9, Number 2, February, 1990
Volume 9, Number 3, March, 1990
Volume 9, Number 4, April, 1990
Volume 9, Number 5--6, May / June, 1990
Volume 10, Number 1, July, 1990
Volume 10, Number 2, August, 1990
Volume 10, Number 3--4, September / October, 1990
Volume 10, Number 5, November, 1990
Volume 10, Number 6, December, 1990
Volume 11, Number 1--2, January / February, 1991
Volume 11, Number 3, March, 1991
Volume 11, Number 4, April, 1991
Volume 11, Number 5--6, May / June, 1991
Volume 12, Number 1, July, 1991
Volume 12, Number 2, August, 1991
Volume 12, Number 3, September, 1991
Volume 12, Number 4--5, October / November, 1991
Volume 12, Number 6, December, 1991
Volume 13, Number 1, January, 1992
Volume 13, Number 2, February, 1992
Volume 13, Number 3, March, 1992
Volume 13, Number 4, April, 1992
Volume 13, Number 5, May, 1992
Volume 13, Number 6, June, 1992
Volume 14, Number 1, July, 1992
Volume 14, Number 2--3, August / September, 1992
Volume 14, Number 4, October, 1992
Volume 14, Number 5, November, 1992
Volume 14, Number 6, December, 1992
Volume 15, Number 1, January, 1993
Volume 15, Number 2, February, 1993
Volume 15, Number 3, March, 1993
Volume 15, Number 4, April, 1993
Volume 15, Number 5--6, May / June, 1993
Volume 16, Number 1, July, 1993
Volume 16, Number 2, August, 1993
Volume 16, Number 3, September, 1993
Volume 16, Number 4, October, 1993
Volume 16, Number 5, November, 1993
Volume 16, Number 6, December, 1993
Volume 17, Number 1, January, 1994
Volume 17, Number 2, February, 1994
Volume 17, Number 3, March, 1994
Volume 17, Number 4, April, 1994
Volume 17, Number 5, May, 1994
Volume 17, Number 6, June, 1994
Volume 18, Number 1, July, 1994
Volume 18, Number 2, August, 1994
Volume 18, Number 3, September, 1994
Volume 18, Number 4, October, 1994
Volume 18, Number 5, November, 1994
Volume 18, Number 6, December, 1994
Volume 19, Number 1/2/3, jan # , # feb # , # mar, 1995
Volume 19, Number 4, April, 1995
Volume 19, Number 5, April, 1995
Volume 19, Number 6, June, 1995
Volume 20, Number 1, July, 1995
Volume 20, Number 2, August, 1995
Volume 20, Number 3, September, 1995
Volume 20, Number 4, October, 1995
Volume 20, Number 5--6, November / December, 1995
Volume 21, Number 1, January, 1996
Volume 21, Number 2, February, 1996
Volume 21, Number 3, March, 1996
Volume 21, Number 4/5/6, apr # , # may # \& # jun, 1996
Volume 22, Number 1, July, 1996
Volume 22, Number 2, August, 1996
Volume 22, Number 3, September, 1996
Volume 22, Number 4, October, 1996
Volume 22, Number 5--6, November / December, 1996
Volume 23, Number 1, January, 1997
Volume 23, Number 2--3, February / March, 1997
Volume 23, Number 4, April, 1997
Volume 23, Number 5--6, May / June, 1997
Volume 24, Number 1, July, 1997
Volume 24, Number 2, August, 1997
Volume 24, Number 3--4, September / October, 1997
Volume 24, Number 5, November, 1997
Volume 24, Number 6, December, 1997
Volume 25, Number 1, January, 1998
Volume 25, Number 2, February, 1998
Volume 25, Number 3, March, 1998
Volume 25, Number 4, April, 1998
Volume 25, Number 5, May, 1998
Volume 25, Number 6, June, 1998
Volume 26, Number 1, 1998
Volume 26, Number 2, 1998
Volume 26, Number 3, 1998
Volume 26, Number 4, October, 1998
Volume 26, Number 5, November, 1998
Volume 26, Number 6, December, 1998
Volume 27, Number 1, January, 1999
Volume 27, Number 2, February, 1999
Volume 27, Number 3, March, 1999
Volume 27, Number 4, April, 1999
Volume 27, Number 5, May, 1999
Volume 27, Number 6, June, 1999
Volume 28, Number 1--2, jul # / # aug, 1999
Volume 28, Number 3, September, 1999
Volume 28, Number 4--5, oct # / # nov, 1999
Volume 28, Number 6, December, 1999
Volume 29, Number 1, February, 2000
Volume 29, Number 2, February, 2000
Volume 29, Number 3, March, 2000
Volume 29, Number 4--5, May, 2000
Volume 29, Number 6, June, 2000
Volume 30, Number 1, July, 2000
Volume 30, Number 2, August, 2000
Volume 30, Number 3, September 1, 2000
Volume 30, Number 4, October, 2000
Volume 30, Number 5, October 1, 2000
Volume 30, Number 6, December 1, 2000
Volume 31, Number 1--2, jan # / # feb, 2001
Volume 31, Number 3, March 1, 2001
Volume 31, Number 4, April 1, 2001
Volume 31, Number 5, May 1, 2001
Volume 31, Number 6, June 1, 2001
Volume 32, Number 1--2, jul # / # aug, 2001
Volume 32, Number 3, September 1, 2001
Volume 32, Number 4, September 1, 2001
Volume 32, Number 5, November 1, 2001
Volume 32, Number 6, December 1, 2001
Volume 33, Number 1, January 1, 2002
Volume 33, Number 2, February 1, 2002
Volume 33, Number 3, March 1, 2002
Volume 33, Number 4, April, 2002
Volume 33, Number 5, May, 2002
Volume 33, Number 6, June, 2002
Volume 34, Number 1, July, 2002
Volume 34, Number 2, August, 2002
Volume 34, Number 3, September, 2002
Volume 34, Number 4, October, 2002
Volume 34, Number 5, November, 2002
Volume 34, Number 6, December, 2002
Volume 35, Number 1, January, 2003
Volume 35, Number 2, February, 2003
Volume 35, Number 3, March, 2003
Volume 35, Number 4, April, 2003
Volume 35, Number 5, May, 2003
Volume 35, Number 6, June, 2003
Volume 36, Number 1--2, July / August, 2003
Volume 36, Number 3--4, September / October, 2003
Volume 36, Number 5, November, 2003
Volume 36, Number 6, December, 2003
Volume 37, Number 1, January, 2004
Volume 37, Number 2, February, 2004
Volume 37, Number 3, March, 2004
Volume 37, Number 4, April, 2004
Volume 37, Number 5, May, 2004
Volume 37, Number 6, June, 2004
Volume 38, Number 1, July, 2004
Volume 38, Number 2, August, 2004
Volume 38, Number 3, September, 2004
Volume 38, Number 4, October, 2004
Volume 38, Number 5, November, 2004
Volume 38, Number 6, December, 2004
Volume 39, Number 1, January, 2005
Volume 39, Number 2, February, 2005
Volume 39, Number 3--4, March / April, 2005
Volume 39, Number 5, May, 2005
Volume 39, Number 6, June, 2005
Volume 40, Number 1, July, 2005
Volume 40, Number 2, August, 2005
Volume 40, Number 3, September, 2005
Volume 40, Number 4--5, October / November, 2005
Volume 40, Number 6, December, 2005
Volume 41, Number 1, January, 2006
Volume 41, Number 2, February, 2006
Volume 41, Number 3--4, March / April, 2006
Volume 41, Number 5, May, 2006
Volume 41, Number 6, June, 2006
Volume 41, Number 7, July, 2006
Volume 41, Number 8, August, 2006
Volume 41, Number 9, September, 2006
Volume 41, Number 10, October, 2006
Volume 41, Number 11, November, 2006
Volume 41, Number 12, December, 2006
Volume 42, Number 1--2, January / February, 2007
Volume 42, Number 3, March, 2007
Volume 42, Number 4, April, 2007
Volume 42, Number 5, May, 2007
Volume 42, Number 6, June, 2007
Volume 42, Number 7, July, 2007
Volume 42, Number 8, August, 2007
Volume 42, Number 9, September, 2007
Volume 42, Number 10, October, 2007
Volume 42, Number 11--12, November / December, 2007
Volume 43, Number 1, January, 2008
Volume 43, Number 2, February, 2008
Volume 43, Number 3, March, 2008
Volume 43, Number 4, April, 2008
Volume 43, Number 5, May, 2008
Volume 43, Number 6--7, June / July, 2008
Volume 43, Number 8, August, 2008
Volume 43, Number 9, September, 2008
Volume 43, Number 10, October, 2008
Volume 43, Number 11, November, 2008
Volume 43, Number 12, December, 2008
Volume 44, Number 1, January, 2009
Volume 44, Number 2, February, 2009
Volume 44, Number 3, March, 2009
Volume 44, Number 4, April, 2009
Volume 44, Number 5, May, 2009
Volume 44, Number 6, June, 2009
Volume 44, Number 7, July, 2009
Volume 44, Number 8, August, 2009
Volume 44, Number 9, September, 2009
Volume 44, Number 10, October, 2009
Volume 44, Number 11, November, 2009
Volume 44, Number 12, December, 2009
Volume 45, Number 1, January, 2010
Volume 45, Number 2, February, 2010
Volume 45, Number 3, March, 2010
Volume 45, Number 4, April, 2010
Volume 45, Number 5, May, 2010
Volume 45, Number 6, June, 2010
Volume 45, Number 7, July, 2010
Volume 45, Number 8, August, 2010
Volume 45, Number 9, September, 2010
Volume 45, Number 10, October, 2010
Volume 45, Number 11, November, 2010
Volume 45, Number 12, December, 2010
Volume 46, Number 1, January, 2011
Volume 46, Number 2, February, 2011
Volume 46, Number 3, March, 2011
Volume 46, Number 4, April, 2011
Volume 46, Number 5, May, 2011
Volume 46, Number 6, June, 2011
Volume 46, Number 7, July, 2011
Volume 46, Number 8, August, 2011
Volume 46, Number 9, September, 2011
Volume 46, Number 10, October, 2011
Volume 46, Number 11, November, 2011
Volume 46, Number 12, December, 2011
Volume 47, Number 1, January, 2012
Volume 47, Number 2, February, 2012
Volume 47, Number 3, March, 2012
Volume 47, Number 4, April, 2012
Volume 47, Number 5, May, 2012
Volume 47, Number 6, June, 2012
Volume 47, Number 7, July, 2012
Volume 47, Number 8, August, 2012
Volume 47, Number 9, September, 2012
Volume 47, Number 10, October, 2012
Volume 47, Number 11, November, 2012
Volume 47, Number 12, December, 2012
Volume 48, Number ??, January, 2013
Volume 49, Number ??, February, 2013
Volume 50, Number ??, March, 2013
Volume 51, Number ??, April, 2013
Volume 52, Number ??, May, 2013
Volume 53, Number ??, June, 2013
Volume 54, Number ??, July, 2013
Volume 55, Number ??, August, 2013
Volume 56, Number ??, September, 2013
Volume 57, Number ??, October, 2013
Volume 58, Number ??, November, 2013
Volume 59, Number ??, December, 2013
Volume 60, Number ??, January, 2014
Volume 61--62, Number ??, 2013
Volume 63, Number ??, May, 2014
Volume 64, Number ??, August, 2014
Volume 65, Number ??, November, 2014
Volume 66, Number ??, January / February, 2015
Volume 67, Number ??, March / April, 2015


Journal of Symbolic Computation
Volume 1, Number 1, March, 1985

                        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

Journal of Symbolic Computation
Volume 1, Number 2, June, 1985

                 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

Journal of Symbolic Computation
Volume 1, Number 3, September, 1985

                       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

Journal of Symbolic Computation
Volume 1, Number 4, December, 1985

               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


Journal of Symbolic Computation
Volume 2, Number 1, March, 1986

              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

Journal of Symbolic Computation
Volume 2, Number 2, June, 1986

           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

Journal of Symbolic Computation
Volume 2, Number 3, September, 1986

                 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

Journal of Symbolic Computation
Volume 2, Number 4, December, 1986

                 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


Journal of Symbolic Computation
Volume 3, Number 1, 1986

                 T. Coquand and   
                     G. P. Huet   A Selected Bibliography on Constructive
                                  Mathematics, Intuitionistic Type Theory
                                  and Higher Order Deduction . . . . . . . ??

Journal of Symbolic Computation
Volume 3, Number 1--2, February / April, 1987

               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

Journal of Symbolic Computation
Volume 3, Number 3, June, 1987

          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


Journal of Symbolic Computation
Volume 4, Number 1, 1987

                  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

Journal of Symbolic Computation
Volume 4, Number 2, October, 1987

         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

Journal of Symbolic Computation
Volume 4, Number 3, December, 1987

                   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


Journal of Symbolic Computation
Volume 5, Number 1--2, February / April, 1988

            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

Journal of Symbolic Computation
Volume 5, Number 3, June, 1988

                 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


Journal of Symbolic Computation
Volume 6, Number 1, August, 1988

               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

Journal of Symbolic Computation
Volume 6, Number 2--3, October / December, 1988

                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


Journal of Symbolic Computation
Volume 7, Number 1, January, 1989

           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

Journal of Symbolic Computation
Volume 7, Number 2, February, 1989

                   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

Journal of Symbolic Computation
Volume 7, Number 3--4, March / April, 1989

          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

Journal of Symbolic Computation
Volume 7, Number 5, May, 1989

               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

Journal of Symbolic Computation
Volume 7, Number 6, June, 1989

               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


Journal of Symbolic Computation
Volume 8, Number 1--2, July / August, 1989

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

Journal of Symbolic Computation
Volume 8, Number 3, September, 1989

             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

Journal of Symbolic Computation
Volume 8, Number 4, October, 1989

            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

Journal of Symbolic Computation
Volume 8, Number 5, November, 1989

              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

Journal of Symbolic Computation
Volume 8, Number 6, December, 1989

        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


Journal of Symbolic Computation
Volume 9, Number 1, January, 1990

             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

Journal of Symbolic Computation
Volume 9, Number 2, February, 1990

                  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

Journal of Symbolic Computation
Volume 9, Number 3, March, 1990

              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

Journal of Symbolic Computation
Volume 9, Number 4, April, 1990

             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

Journal of Symbolic Computation
Volume 9, Number 5--6, May / June, 1990

                   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


Journal of Symbolic Computation
Volume 10, Number 1, July, 1990

     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

Journal of Symbolic Computation
Volume 10, Number 2, August, 1990

              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

Journal of Symbolic Computation
Volume 10, Number 3--4, September / October, 1990

                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

Journal of Symbolic Computation
Volume 10, Number 5, November, 1990

                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

Journal of Symbolic Computation
Volume 10, Number 6, December, 1990

                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


Journal of Symbolic Computation
Volume 11, Number 1--2, January / February, 1991

                  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

Journal of Symbolic Computation
Volume 11, Number 3, March, 1991

               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

Journal of Symbolic Computation
Volume 11, Number 4, April, 1991

                 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

Journal of Symbolic Computation
Volume 11, Number 5--6, May / June, 1991

                  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


Journal of Symbolic Computation
Volume 12, Number 1, July, 1991

                 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

Journal of Symbolic Computation
Volume 12, Number 2, August, 1991

              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

Journal of Symbolic Computation
Volume 12, Number 3, September, 1991

                 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

Journal of Symbolic Computation
Volume 12, Number 4--5, October / November, 1991

           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

Journal of Symbolic Computation
Volume 12, Number 6, December, 1991

                 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


Journal of Symbolic Computation
Volume 13, Number 1, January, 1992

       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

Journal of Symbolic Computation
Volume 13, Number 2, February, 1992

                      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

Journal of Symbolic Computation
Volume 13, Number 3, March, 1992

                      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

Journal of Symbolic Computation
Volume 13, Number 4, April, 1992

                 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

Journal of Symbolic Computation
Volume 13, Number 5, May, 1992

               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

Journal of Symbolic Computation
Volume 13, Number 6, June, 1992

                  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


Journal of Symbolic Computation
Volume 14, Number 1, July, 1992

            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

Journal of Symbolic Computation
Volume 14, Number 2--3, August / September, 1992

                  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

Journal of Symbolic Computation
Volume 14, Number 4, October, 1992

         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

Journal of Symbolic Computation
Volume 14, Number 5, November, 1992

                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

Journal of Symbolic Computation
Volume 14, Number 6, December, 1992

                 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


Journal of Symbolic Computation
Volume 15, Number 1, January, 1993

              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

Journal of Symbolic Computation
Volume 15, Number 2, February, 1993

             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

Journal of Symbolic Computation
Volume 15, Number 3, March, 1993

                  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

Journal of Symbolic Computation
Volume 15, Number 4, April, 1993

                       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

Journal of Symbolic Computation
Volume 15, Number 5--6, May / June, 1993

                   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


Journal of Symbolic Computation
Volume 16, Number 1, July, 1993

             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

Journal of Symbolic Computation
Volume 16, Number 2, August, 1993

                 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

Journal of Symbolic Computation
Volume 16, Number 3, September, 1993

                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

Journal of Symbolic Computation
Volume 16, Number 4, October, 1993

      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

Journal of Symbolic Computation
Volume 16, Number 5, November, 1993

        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

Journal of Symbolic Computation
Volume 16, Number 6, December, 1993

                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


Journal of Symbolic Computation
Volume 17, Number 1, January, 1994

                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

Journal of Symbolic Computation
Volume 17, Number 2, February, 1994

                  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

Journal of Symbolic Computation
Volume 17, Number 3, March, 1994

                   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

Journal of Symbolic Computation
Volume 17, Number 4, April, 1994

                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

Journal of Symbolic Computation
Volume 17, Number 5, May, 1994

                   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

Journal of Symbolic Computation
Volume 17, Number 6, June, 1994

            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


Journal of Symbolic Computation
Volume 18, Number 1, July, 1994

            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

Journal of Symbolic Computation
Volume 18, Number 2, August, 1994

            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

Journal of Symbolic Computation
Volume 18, Number 3, September, 1994

                  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

Journal of Symbolic Computation
Volume 18, Number 4, October, 1994

                  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

Journal of Symbolic Computation
Volume 18, Number 5, November, 1994

                 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

Journal of Symbolic Computation
Volume 18, Number 6, December, 1994

                 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


Journal of Symbolic Computation
Volume 19, Number 1/2/3, jan # , # feb # , # mar, 1995

                      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

Journal of Symbolic Computation
Volume 19, Number 4, April, 1995

             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

Journal of Symbolic Computation
Volume 19, Number 5, April, 1995

                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

Journal of Symbolic Computation
Volume 19, Number 6, June, 1995

          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


Journal of Symbolic Computation
Volume 20, Number 1, July, 1995

                 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

Journal of Symbolic Computation
Volume 20, Number 2, August, 1995

          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

Journal of Symbolic Computation
Volume 20, Number 3, September, 1995

                    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

Journal of Symbolic Computation
Volume 20, Number 4, October, 1995

                   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

Journal of Symbolic Computation
Volume 20, Number 5--6, November / December, 1995

                   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


Journal of Symbolic Computation
Volume 21, Number 1, January, 1996

               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

Journal of Symbolic Computation
Volume 21, Number 2, February, 1996

            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

Journal of Symbolic Computation
Volume 21, Number 3, March, 1996

           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

Journal of Symbolic Computation
Volume 21, Number 4/5/6, apr # , # may # \& # jun, 1996

                        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


Journal of Symbolic Computation
Volume 22, Number 1, July, 1996

           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

Journal of Symbolic Computation
Volume 22, Number 2, August, 1996

                       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

Journal of Symbolic Computation
Volume 22, Number 3, September, 1996

               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

Journal of Symbolic Computation
Volume 22, Number 4, October, 1996

                 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

Journal of Symbolic Computation
Volume 22, Number 5--6, November / December, 1996

                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


Journal of Symbolic Computation
Volume 23, Number 1, January, 1997

         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

Journal of Symbolic Computation
Volume 23, Number 2--3, February / March, 1997

             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

Journal of Symbolic Computation
Volume 23, Number 4, April, 1997

             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

Journal of Symbolic Computation
Volume 23, Number 5--6, May / June, 1997

                    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


Journal of Symbolic Computation
Volume 24, Number 1, July, 1997

                 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

Journal of Symbolic Computation
Volume 24, Number 2, August, 1997

                  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

Journal of Symbolic Computation
Volume 24, Number 3--4, September / October, 1997

               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--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

Journal of Symbolic Computation
Volume 24, Number 5, November, 1997

                 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

Journal of Symbolic Computation
Volume 24, Number 6, December, 1997

                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


Journal of Symbolic Computation
Volume 25, Number 1, January, 1998

          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

Journal of Symbolic Computation
Volume 25, Number 2, February, 1998

             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

Journal of Symbolic Computation
Volume 25, Number 3, March, 1998

                     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

Journal of Symbolic Computation
Volume 25, Number 4, April, 1998

                      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

Journal of Symbolic Computation
Volume 25, Number 5, May, 1998

                      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

Journal of Symbolic Computation
Volume 25, Number 6, June, 1998

                   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


Journal of Symbolic Computation
Volume 26, Number 1, 1998

                  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

Journal of Symbolic Computation
Volume 26, Number 2, 1998

            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

Journal of Symbolic Computation
Volume 26, Number 3, 1998

             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

Journal of Symbolic Computation
Volume 26, Number 4, October, 1998

                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

Journal of Symbolic Computation
Volume 26, Number 5, November, 1998

                  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

Journal of Symbolic Computation
Volume 26, Number 6, December, 1998

                 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


Journal of Symbolic Computation
Volume 27, Number 1, January, 1999

                 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

Journal of Symbolic Computation
Volume 27, Number 2, February, 1999

            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

Journal of Symbolic Computation
Volume 27, Number 3, March, 1999

             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

Journal of Symbolic Computation
Volume 27, Number 4, April, 1999

              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

Journal of Symbolic Computation
Volume 27, Number 5, May, 1999

                 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

Journal of Symbolic Computation
Volume 27, Number 6, June, 1999

                    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


Journal of Symbolic Computation
Volume 28, Number 1--2, jul # / # aug, 1999

          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

Journal of Symbolic Computation
Volume 28, Number 3, September, 1999

           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

Journal of Symbolic Computation
Volume 28, Number 4--5, oct # / # nov, 1999

                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

Journal of Symbolic Computation
Volume 28, Number 6, December, 1999

                      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


Journal of Symbolic Computation
Volume 29, Number 1, February, 2000

                 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

Journal of Symbolic Computation
Volume 29, Number 2, February, 2000

                      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

Journal of Symbolic Computation
Volume 29, Number 3, March, 2000

               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

Journal of Symbolic Computation
Volume 29, Number 4--5, May, 2000

            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

Journal of Symbolic Computation
Volume 29, Number 6, June, 2000

               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


Journal of Symbolic Computation
Volume 30, Number 1, July, 2000

              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

Journal of Symbolic Computation
Volume 30, Number 2, August, 2000

           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

Journal of Symbolic Computation
Volume 30, Number 3, September 1, 2000

           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

Journal of Symbolic Computation
Volume 30, Number 4, October, 2000

                  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

Journal of Symbolic Computation
Volume 30, Number 5, October 1, 2000

            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

Journal of Symbolic Computation
Volume 30, Number 6, December 1, 2000

                      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


Journal of Symbolic Computation
Volume 31, Number 1--2, jan # / # feb, 2001

                     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

Journal of Symbolic Computation
Volume 31, Number 3, March 1, 2001

               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

Journal of Symbolic Computation
Volume 31, Number 4, April 1, 2001

               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

Journal of Symbolic Computation
Volume 31, Number 5, May 1, 2001

           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

Journal of Symbolic Computation
Volume 31, Number 6, June 1, 2001

             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


Journal of Symbolic Computation
Volume 32, Number 1--2, jul # / # aug, 2001

            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  . . . . . . . . . . . . . 

Journal of Symbolic Computation
Volume 32, Number 3, September 1, 2001

         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

Journal of Symbolic Computation
Volume 32, Number 4, September 1, 2001

         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    ??

Journal of Symbolic Computation
Volume 32, Number 5, November 1, 2001

           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

Journal of Symbolic Computation
Volume 32, Number 6, December 1, 2001

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    ??


Journal of Symbolic Computation
Volume 33, Number 1, January 1, 2002

            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

Journal of Symbolic Computation
Volume 33, Number 2, February 1, 2002

               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

Journal of Symbolic Computation
Volume 33, Number 3, March 1, 2002

             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

Journal of Symbolic Computation
Volume 33, Number 4, April, 2002

              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

Journal of Symbolic Computation
Volume 33, Number 5, May, 2002

                 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

Journal of Symbolic Computation
Volume 33, Number 6, June, 2002

                   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


Journal of Symbolic Computation
Volume 34, Number 1, July, 2002

                   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

Journal of Symbolic Computation
Volume 34, Number 2, August, 2002

                  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

Journal of Symbolic Computation
Volume 34, Number 3, September, 2002

            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

Journal of Symbolic Computation
Volume 34, Number 4, October, 2002

               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

Journal of Symbolic Computation
Volume 34, Number 5, November, 2002

             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

Journal of Symbolic Computation
Volume 34, Number 6, December, 2002

           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


Journal of Symbolic Computation
Volume 35, Number 1, January, 2003

                      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

Journal of Symbolic Computation
Volume 35, Number 2, February, 2003

          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

Journal of Symbolic Computation
Volume 35, Number 3, March, 2003

             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

Journal of Symbolic Computation
Volume 35, Number 4, April, 2003

                 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

Journal of Symbolic Computation
Volume 35, Number 5, May, 2003

              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

Journal of Symbolic Computation
Volume 35, Number 6, June, 2003

           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


Journal of Symbolic Computation
Volume 36, Number 1--2, July / August, 2003

          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

Journal of Symbolic Computation
Volume 36, Number 3--4, September / October, 2003

                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

Journal of Symbolic Computation
Volume 36, Number 5, November, 2003

                    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

Journal of Symbolic Computation
Volume 36, Number 6, December, 2003

               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


Journal of Symbolic Computation
Volume 37, Number 1, January, 2004

                      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

Journal of Symbolic Computation
Volume 37, Number 2, February, 2004

          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

Journal of Symbolic Computation
Volume 37, Number 3, March, 2004

                 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

Journal of Symbolic Computation
Volume 37, Number 4, April, 2004

                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

Journal of Symbolic Computation
Volume 37, Number 5, May, 2004

                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

Journal of Symbolic Computation
Volume 37, Number 6, June, 2004

                 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


Journal of Symbolic Computation
Volume 38, Number 1, July, 2004

        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

Journal of Symbolic Computation
Volume 38, Number 2, August, 2004

            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

Journal of Symbolic Computation
Volume 38, Number 3, September, 2004

             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. \bf 33
                                  (2002) 521--543] . . . . . . . . . . . . 1165--1165
                      Anonymous   Editorial Board  . . . . . . . . . . . . CO2--CO2

Journal of Symbolic Computation
Volume 38, Number 4, October, 2004

             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

Journal of Symbolic Computation
Volume 38, Number 5, November, 2004

    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

Journal of Symbolic Computation
Volume 38, Number 6, December, 2004

                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 . . . . . . . ??


Journal of Symbolic Computation
Volume 39, Number 1, January, 2005

               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

Journal of Symbolic Computation
Volume 39, Number 2, February, 2005

               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

Journal of Symbolic Computation
Volume 39, Number 3--4, March / April, 2005

             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

Journal of Symbolic Computation
Volume 39, Number 5, May, 2005

              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

Journal of Symbolic Computation
Volume 39, Number 6, June, 2005

               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


Journal of Symbolic Computation
Volume 40, Number 1, July, 2005

          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

Journal of Symbolic Computation
Volume 40, Number 2, August, 2005

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

Journal of Symbolic Computation
Volume 40, Number 3, September, 2005

                 Aldo Conca and   
                 Jessica Sidman   Generic initial ideals of points and
                                  curves . . . . . . . . . . . . . . . . . 1023--1038
Manuel García Román and   
Socorro García Román   Gröbner bases and syzygies on bimodules
                                  over PBW algebras  . . . . . . . . . . . 1039--1052
                    Allan Steel   Conquering inseparability: Primary
                                  decomposition and multivariate
                                  factorization over algebraic function
                                  fields of positive characteristic  . . . 1053--1075
             J. Gago-Vargas and   
     M. I. Hartillo-Hermoso and   
     J. M. Ucha-Enríquez   Comparison of theoretical complexities
                                  of two methods for computing
                                  annihilating ideals of polynomials . . . 1076--1086
           Anna Torstensson and   
          Victor Ufnarovski and   
            Hans Öfverbeck   Using resultants for SAGBI basis
                                  verification in the univariate
                                  polynomial ring  . . . . . . . . . . . . 1087--1105
             J. D. Phillips and   
     Petr Vojt\vechovský   Linear groupoids and the associated
                                  wreath products  . . . . . . . . . . . . 1106--1125
          Christopher J. Hillar   Erratum to ``Cyclic resultants'' [J.
                                  Symbolic Comput. \bf 39 (6) (2005)
                                  653--669]  . . . . . . . . . . . . . . . 1126--1127

Journal of Symbolic Computation
Volume 40, Number 4--5, October / November, 2005

         Ilias S. Kotsireas and   
      Alkiviadis G. Akritas and   
        Stanly L. Steinberg and   
              Michael J. Wester   Foreword to the special issue on
                                  applications of computer algebra . . . . 1129--1130
               Joachim Apel and   
                  Ralf Hemmecke   Detecting unnecessary reductions in an
                                  involutive basis computation . . . . . . 1131--1149
        Laurent Busé and   
                   Marc Chardin   Implicitizing rational hypersurfaces
                                  using approximation complexes  . . . . . 1150--1168
                 E. Fortuna and   
                  P. Gianni and   
                     P. Parenti   Some constructions for real algebraic
                                  curves . . . . . . . . . . . . . . . . . 1169--1179
            Karin Gatermann and   
                  Serkan Hosten   Computational algebra for bifurcation
                                  theory . . . . . . . . . . . . . . . . . 1180--1207
        Rocio Gonzalez-Diaz and   
                     Pedro Real   Simplification techniques for maps in
                                  simplicial topology  . . . . . . . . . . 1208--1224
                Nik Lygeros and   
     Paul-Val\`ere Marchand and   
                    Marc Massot   Enumeration and $3$D representation of
                                  the stereo-isomers of alkane molecules   1225--1241
                Richard Moeckel   Sturm's algorithm and isolating blocks   1242--1255
Jesús F. Palacián and   
               Patricia Yanguas   Asymptotic invariant tori of perturbed
                                  two-body problems  . . . . . . . . . . . 1256--1268

Journal of Symbolic Computation
Volume 40, Number 6, December, 2005

         Björn Assmann and   
                   Bettina Eick   Computing polycyclic presentations for
                                  polycyclic rational matrix groups  . . . 1269--1284
              Lawrence H. Smith   On ordering free groups  . . . . . . . . 1285--1290
              Josef Schicho and   
         Ibolya Szilágyi   Numerical stability of surface
                                  implicitization  . . . . . . . . . . . . 1291--1301
                       Liqun Qi   Eigenvalues of a real supersymmetric
                                  tensor . . . . . . . . . . . . . . . . . 1302--1324
José Méndez Omaña and   
               Michael E. Pohst   Factoring polynomials over global fields
                                  II . . . . . . . . . . . . . . . . . . . 1325--1339
          Mustapha Er-Riani and   
         Olivier Sero-Guillaume   Shapes of liquid drops obtained using
                                  symbolic computation . . . . . . . . . . 1340--1360
            Karin Gatermann and   
            Markus Eiswirth and   
                    Anke Sensse   Toric ideals and graph theory to analyze
                                  Hopf bifurcations in mass action systems 1361--1382
               K. Subramani and   
                    D. Desovski   Out of order quantifier elimination for
                                  Standard Quantified Linear Programs  . . 1383--1396
                      Anonymous   Index  . . . . . . . . . . . . . . . . . vi--x


Journal of Symbolic Computation
Volume 41, Number 1, January, 2006

                Alin Bostan and   
          Philippe Flajolet and   
                Bruno Salvy and   
             Éric Schost   Fast computation of special resultants   1--29
     Ibolya Szilágyi and   
          Bert Jüttler and   
                  Josef Schicho   Local parametrization of cubic surfaces  30--48
            Werner Krandick and   
                  Kurt Mehlhorn   New bounds for the Descartes method  . . 49--66
               G. Belitskii and   
                   R. Lipyanski   The unification type of the Pythagorean
                                  equation in varieties of nilpotent rings 67--79
              John W. Jones and   
               David P. Roberts   A database of local fields . . . . . . . 80--97
                Micah J. Leamer   Gröbner finite path algebras  . . . . . . 98--111
    Giuseppa Carrá Ferro   Ideals, bifiltered modules and bivariate
                                  Hilbert polynomials  . . . . . . . . . . 112--121
                 Min-Ho Ahn and   
                   Gwang-Il Kim   Retraction notice to ``Characterization
                                  of Pythagorean curves and
                                  Pythagoreanization using a rational
                                  transform'' [J. Symbolic Comput. \bf 37
                                  (3) (2004) 377--389] . . . . . . . . . . 122--122

Journal of Symbolic Computation
Volume 41, Number 2, February, 2006

            Serkan Ho\csten and   
               Christopher Meek   Preface  . . . . . . . . . . . . . . . . 123--124
Ingileif B. Hallgrímsdóttir and   
                Bernd Sturmfels   Resultants in genetic linkage analysis   125--137
        Elizabeth S. Allman and   
                 John A. Rhodes   Phylogenetic invariants for stationary
                                  base composition . . . . . . . . . . . . 138--150
                    Eric H. Kuo   Viterbi sequences and polytopes  . . . . 151--163
                  Fabio Rapallo   Markov bases and structural zeros  . . . 164--172
   Jesús A. De Loera and   
                     Shmuel Onn   Markov bases of three-way tables are
                                  arbitrarily complicated  . . . . . . . . 173--181
             Persi Diaconis and   
              Nicholas Eriksson   Markov bases for noncommutative Fourier
                                  analysis of ranked data  . . . . . . . . 182--195
    Aleksandra B. Slavkovic and   
                 Seth Sullivant   The space of compatible full
                                  conditionals is a unimodular toric
                                  variety  . . . . . . . . . . . . . . . . 196--209
           Giovanni Pistone and   
                  Henry P. Wynn   Cumulant varieties . . . . . . . . . . . 210--221
          Nicholas Eriksson and   
        Stephen E. Fienberg and   
         Alessandro Rinaldo and   
                 Seth Sullivant   Polyhedral conditions for the
                                  nonexistence of the MLE for hierarchical
                                  log-linear models  . . . . . . . . . . . 222--233
          Max-Louis G. Buot and   
         Donald St. P. Richards   Counting and locating the solutions of
                                  polynomial systems of maximum likelihood
                                  equations, I . . . . . . . . . . . . . . 234--244
                  Mathias Drton   Computing all roots of the likelihood
                                  equations of seemingly unrelated
                                  regressions  . . . . . . . . . . . . . . 245--254

Journal of Symbolic Computation
Volume 41, Number 3--4, March / April, 2006

                  Hoon Hong and   
               Deepak Kapur and   
                Peter Paule and   
              Franz Winkler and   
           Faculty of RISC-Linz   Bruno Buchberger --- A life devoted to
                                  symbolic computation . . . . . . . . . . 255--258
                   Deepak Kapur   Preface on the contributed papers  . . . 259--260
          Werner Heiß and   
              Ulrich Oberst and   
                    Franz Pauer   On inverse systems and squarefree
                                  decomposition of zero-dimensional
                                  polynomial ideals  . . . . . . . . . . . 261--284
            Volker Weispfenning   Comprehensive Gröbner bases and regular
                                  rings  . . . . . . . . . . . . . . . . . 285--296
               Lothar Gerritzen   Tree polynomials and non-associative
                                  Gröbner bases . . . . . . . . . . . . . . 297--316
F. J. Castro-Jiménez and   
     J. M. Ucha-Enríquez   Gröbner bases and logarithmic ${\cal
                                  D}$-modules  . . . . . . . . . . . . . . 317--335
         Giandomenico Boffi and   
                    Fabio Rossi   Lexicographic Gröbner bases for
                                  transportation problems of format $r
                                  \times 3 \times 3$ . . . . . . . . . . . 336--356
               Leonid Bokut and   
                  Andrei Vesnin   Gröbner--Shirshov bases for some braid
                                  groups . . . . . . . . . . . . . . . . . 357--371
                Thomas Beth and   
Jörn Müller-Quade and   
              Rainer Steinwandt   Computing restrictions of ideals in
                                  finitely generated k . . . . . . . . . . 372--380
              Matthias Baaz and   
              Alexander Leitsch   Towards a clausal analysis of
                                  cut-elimination  . . . . . . . . . . . . 381--410
                  Koji Nakagawa   Logicographic symbols  . . . . . . . . . 411--434
           Wolfgang Windsteiger   An automated prover for
                                  Zermelo--Fraenkel set theory in Theorema 435--470
               Bruno Buchberger   Comments on the translation of my PhD
                                  thesis . . . . . . . . . . . . . . . . . 471--474
               Bruno Buchberger   Bruno Buchberger's PhD thesis 1965: An
                                  algorithm for finding the basis elements
                                  of the residue class ring of a zero
                                  dimensional polynomial ideal . . . . . . 475--511

Journal of Symbolic Computation
Volume 41, Number 5, May, 2006

        Bernhard Beckermann and   
               Howard Cheng and   
                  George Labahn   Fraction-free row reduction of matrices
                                  of Ore polynomials . . . . . . . . . . . 513--543
                  Martin Bright   Brauer groups of diagonal quartic
                                  surfaces . . . . . . . . . . . . . . . . 544--558
                 Vincent Vatter   Finitely labeled generating trees and
                                  restricted permutations  . . . . . . . . 559--572
               Ronald Brown and   
                 Neil Ghani and   
              Anne Heyworth and   
         Christopher D. Wensley   String rewriting for double coset
                                  systems  . . . . . . . . . . . . . . . . 573--590
               Manfred Minimair   Resultants of partially composed
                                  polynomials  . . . . . . . . . . . . . . 591--602
             S. C. Coutinho and   
   L. Menasché Schechter   Algebraic solutions of holomorphic
                                  foliations: An algorithmic approach  . . 603--618
    Giuseppa Carrá Ferro   Erratum to ``Ideals, bifiltered modules
                                  and bivariate Hilbert polynomials'' [J.
                                  Symbolic Comput. \bf 41 (2006) 112--121] 619--619

Journal of Symbolic Computation
Volume 41, Number 6, June, 2006

                   Zhendong Wan   An algorithm to solve integer linear
                                  systems exactly using numerical methods  621--632
           Martin Bendersky and   
           Richard C. Churchill   Normal forms in a cyclically graded Lie
                                  algebra  . . . . . . . . . . . . . . . . 633--662
    Bálint Felszeghy and   
  Balázs Ráth and   
            Lajos Rónyai   The lex game and some applications . . . 663--681
          Guillaume Ch\`eze and   
           André Galligo   From an approximate to an exact absolute
                                  polynomial factorization . . . . . . . . 682--696
              Masaaki Kanno and   
               Malcolm C. Smith   Validated numerical computation of the
                                  ${\cal L}_\infty$-norm for linear
                                  dynamical systems  . . . . . . . . . . . 697--707
        Bernhard Beckermann and   
              George Labahn and   
                 Gilles Villard   Normal forms for general polynomial
                                  matrices . . . . . . . . . . . . . . . . 708--737

Journal of Symbolic Computation
Volume 41, Number 7, July, 2006

                Ruyong Feng and   
                  Xiao-Shan Gao   A polynomial time algorithm for finding
                                  rational general solutions of first
                                  order autonomous ODEs  . . . . . . . . . 739--762
           Domenico Cantone and   
          Gianluca Cincotti and   
                 Giovanni Gallo   Decision algorithms for fragments of
                                  real analysis. I. Continuous functions
                                  with strict convexity and concavity
                                  predicates . . . . . . . . . . . . . . . 763--789
          A. Bérczes and   
                 A. Peth\Ho and   
                     V. Ziegler   Parameterized norm form equations with
                                  arithmetic progressions  . . . . . . . . 790--810
          Richard Henderson and   
                Todd Macedo and   
                     Sam Nelson   Symbolic computation with finite
                                  quandles . . . . . . . . . . . . . . . . 811--817
            A. D. Myasnikov and   
                 R. M. Haralick   A hybrid search algorithm for the
                                  Whitehead minimization problem . . . . . 818--834
           Vesselin Drensky and   
               Roberto La Scala   Gröbner bases of ideals invariant under
                                  endomorphisms  . . . . . . . . . . . . . 835--846

Journal of Symbolic Computation
Volume 41, Number 8, August, 2006

                    W. R. Unger   Computing the character table of a
                                  finite group . . . . . . . . . . . . . . 847--862
                 Guangxing Zeng   Determination of the tangents for a real
                                  plane algebraic curve  . . . . . . . . . 863--886
                   Saeed Rajaee   Non-associative Gröbner bases . . . . . . 887--904
               Takashi Wada and   
                Hidefumi Ohsugi   Gröbner bases of Hilbert ideals of
                                  alternating groups . . . . . . . . . . . 905--908
                 Jamil Baddoura   Integration in finite terms with
                                  elementary functions and dilogarithms    909--942

Journal of Symbolic Computation
Volume 41, Number 9, September, 2006

     Isaac A. García and   
          Jaume Giné and   
                     Maite Grau   A necessary condition in the monodromy
                                  problem for analytic differential
                                  equations on the plane . . . . . . . . . 943--958
           Joris van der Hoeven   Counterexamples to witness conjectures   959--963
                  Annegret Weng   Computing generators of the tame kernel
                                  of a global function field . . . . . . . 964--979
              Clemens Heuberger   All solutions to Thomas' family of Thue
                                  equations over imaginary quadratic
                                  number fields  . . . . . . . . . . . . . 980--998
     Freyja Hreinsdóttir   An improved term ordering for the ideal
                                  of commuting matrices  . . . . . . . . . 999--1003
       Joris van der Hoeven and   
                  John Shackell   Complexity bounds for zero-test
                                  algorithms . . . . . . . . . . . . . . . 1004--1020
          Adam W. Strzebo\'nski   Cylindrical Algebraic Decomposition
                                  using validated numerics . . . . . . . . 1021--1038
                  Manuel Kauers   SumCracker: A package for manipulating
                                  symbolic sums and related objects  . . . 1039--1057

Journal of Symbolic Computation
Volume 41, Number 10, October, 2006

                  A. Romero and   
                   J. Rubio and   
                  F. Sergeraert   Computing spectral sequences . . . . . . 1059--1079
          Arnold Schönhage   Polynomial root separation examples  . . 1080--1090
                Oleg Golubitsky   Gröbner fan and universal characteristic
                                  sets of prime differential ideals  . . . 1091--1104
             Isabel Bermejo and   
           Philippe Gimenez and   
                 Marcel Morales   Castelnuovo--Mumford regularity of
                                  projective monomial varieties of
                                  codimension two  . . . . . . . . . . . . 1105--1124
                   Saugata Basu   Computing the first few Betti numbers of
                                  semi-algebraic sets in single
                                  exponential time . . . . . . . . . . . . 1125--1154

Journal of Symbolic Computation
Volume 41, Number 11, November, 2006

           Andreas Dolzmann and   
                   Thomas Sturm   Editorial  . . . . . . . . . . . . . . . 1155--1156
       Christopher W. Brown and   
         M'hammed El Kahoui and   
            Dominik Novotni and   
                  Andreas Weber   Algorithmic methods for investigating
                                  equilibria in epidemic modeling  . . . . 1157--1173
              Gema M. Diaz-Toca   Galois theory, splitting fields and
                                  computer algebra . . . . . . . . . . . . 1174--1186
           Mario Fioravanti and   
     Laureano Gonzalez-Vega and   
                   Ioana Necula   Computing the intersection of two ruled
                                  surfaces by using a new algebraic
                                  approach . . . . . . . . . . . . . . . . 1187--1205
Armin Größlinger and   
              Martin Griebl and   
             Christian Lengauer   Quantifier elimination in automatic loop
                                  parallelization  . . . . . . . . . . . . 1206--1221
            Jaime Gutierrez and   
                  David Sevilla   Computation of unirational fields  . . . 1222--1244
        Montserrat Manubens and   
                 Antonio Montes   Improving the DISPGB algorithm using the
                                  discriminant ideal . . . . . . . . . . . 1245--1263
                 Birgit Reinert   Gröbner bases in function rings --- A
                                  guide for introducing reduction
                                  relations to algebraic structures  . . . 1264--1294

Journal of Symbolic Computation
Volume 41, Number 12, December, 2006

              William N. Traves   Differential operators on orbifolds  . . 1295--1308
                       Liqun Qi   Rank and eigenvalues of a supersymmetric
                                  tensor, the multivariate homogeneous
                                  polynomial and the algebraic
                                  hypersurface it defines  . . . . . . . . 1309--1327
   Josep \`Alvarez Montaner and   
                   Anton Leykin   Computing the support of local
                                  cohomology modules . . . . . . . . . . . 1328--1344
               Andrea Previtali   Irreducible constituents of monomial
                                  representations  . . . . . . . . . . . . 1345--1359
              Thorsten Theobald   On the frontiers of polynomial
                                  computations in tropical geometry  . . . 1360--1375
                      Anonymous   Index to Volume 41 . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 42, Number 1--2, January / February, 2007

         Alicia Dickenstein and   
            Patrizia Gianni and   
             Tomás Recio   Foreword from the Editors  . . . . . . . 1--3
      Carlos Beltrán and   
              Luis Miguel Pardo   On the probability distribution of
                                  singular varieties of given corank . . . 4--29
             Ivo Bleylevens and   
               Ralf Peeters and   
                 Bernard Hanzon   Efficiency improvement in an $n$D
                                  systems approach to polynomial
                                  optimization . . . . . . . . . . . . . . 30--53
                  T. Bogart and   
               A. N. Jensen and   
                  D. Speyer and   
               B. Sturmfels and   
                   R. R. Thomas   Computing tropical varieties . . . . . . 54--73
            Massimo Caboara and   
                Sara Faridi and   
                 Peter Selinger   Simplicial cycles and the computation of
                                  simplicial trees . . . . . . . . . . . . 74--88
           Antonio Campillo and   
         Gert-Martin Greuel and   
               Christoph Lossen   Equisingular calculations for plane
                                  curve singularities  . . . . . . . . . . 89--114
             Raymond Curran and   
                Eduardo Cattani   Restriction of A . . . . . . . . . . . . 115--135
                 A. Galligo and   
                    M. Stillman   On the geometry of parametrized bicubic
                                  surfaces . . . . . . . . . . . . . . . . 136--158
                Giulio Genovese   Improving the algorithms of Berlekamp
                                  and Niederreiter for factoring
                                  polynomials over finite fields . . . . . 159--177
                   A. Hefez and   
                M. E. Hernandes   Standard bases for local rings of
                                  branches and their modules of
                                  differentials  . . . . . . . . . . . . . 178--191
    Xavier Hernández and   
             Josep M. Miret and   
Sebasti\`a Xambó-Descamps   Computing the characteristic numbers of
                                  the variety of nodal plane cubics in
                                  $\mathbb{P}^3$ . . . . . . . . . . . . . 192--202
             Evelyne Hubert and   
                 Irina A. Kogan   Rational invariants of a group action.
                                  Construction and rewriting . . . . . . . 203--217
          Gabriela Jeronimo and   
                     Juan Sabia   Computing multihomogeneous resultants
                                  using straight-line programs . . . . . . 218--235
           Joris van der Hoeven   Around the numeric--symbolic computation
                                  of differential Galois groups  . . . . . 236--264

Journal of Symbolic Computation
Volume 42, Number 3, March, 2007

             Michael P. Barnett   Mathscape and molecular integrals  . . . 265--289
            Carlos D'Andrea and   
                  Hoon Hong and   
               Teresa Krick and   
                   Agnes Szanto   An elementary proof of Sylvester's
                                  double sums for subresultants  . . . . . 290--297
                  K. Fukuda and   
               A. N. Jensen and   
               N. Lauritzen and   
                      R. Thomas   The generic Gröbner walk  . . . . . . . . 298--312
             Eivind Eriksen and   
  Trond Stòlen Gustavsen   Computing obstructions for existence of
                                  connections on modules . . . . . . . . . 313--323
           Andreas Dolzmann and   
            Volker Weispfenning   Multiple object semilinear motion
                                  planning . . . . . . . . . . . . . . . . 324--337
       Juan Gerardo Alcazar and   
             Juan Rafael Sendra   Local shape of offsets to algebraic
                                  curves . . . . . . . . . . . . . . . . . 338--351
                   Temur Kutsia   Solving equations with sequence
                                  variables and sequence~functions . . . . 352--388

Journal of Symbolic Computation
Volume 42, Number 4, April, 2007

           Joris van der Hoeven   Efficient accelero-summation of
                                  holonomic functions  . . . . . . . . . . 389--428
                Hitoshi Koshita   An example of relations on the
                                  Ext-quiver for the Suzuki group Sz(8) in
                                  characteristic $2$ . . . . . . . . . . . 429--442
E. Rodríguez-Carbonell and   
                       D. Kapur   Generating all polynomial invariants in
                                  simple loops . . . . . . . . . . . . . . 443--476
         Grégoire Lecerf   Improved dense multivariate polynomial
                                  factorization algorithms . . . . . . . . 477--494

Journal of Symbolic Computation
Volume 42, Number 5, May, 2007

                  Quoc-Nam Tran   Special issue on Applications of
                                  Computer Algebra . . . . . . . . . . . . 495--496
         Jennifer R. Daniel and   
           Aloysius G. Helminck   Computing the fine structure of real
                                  reductive symmetric spaces . . . . . . . 497--510
             Helena Verrill and   
                   David Joyner   Computing with toric varieties . . . . . 511--532
                  Quoc-Nam Tran   A new class of term orders for
                                  elimination  . . . . . . . . . . . . . . 533--548
               Alain Bretto and   
              Alain Faisant and   
                  Luc Gillibert   $G$-graphs: A new representation of
                                  groups . . . . . . . . . . . . . . . . . 549--560
             Alexander B. Levin   Gröbner bases with respect to several
                                  orderings and multivariable dimension
                                  polynomials  . . . . . . . . . . . . . . 561--578

Journal of Symbolic Computation
Volume 42, Number 6, June, 2007

   Jana Pílniková   Trivializing a central simple algebra of
                                  degree 4 over the rational numbers . . . 579--586
             Ioana Dumitriu and   
               Alan Edelman and   
                    Gene Shuman   MOPS: Multivariate orthogonal
                                  polynomials (symbolically) . . . . . . . 587--620
            Marcin Dumnicki and   
                Witold Jarnicki   New effective bounds on the dimension of
                                  a linear system in $\mathbb{P}^2$  . . . 621--635
              Daniel Lazard and   
              Fabrice Rouillier   Solving parametric polynomial systems    636--667
            Michael C. Slattery   Generation of groups of square-free
                                  order  . . . . . . . . . . . . . . . . . 668--677
       Juan Gerardo Alcazar and   
              Josef Schicho and   
             Juan Rafael Sendra   A delineability-based method for
                                  computing critical sets of algebraic
                                  surfaces . . . . . . . . . . . . . . . . 678--691

Journal of Symbolic Computation
Volume 42, Number 7, July, 2007

           Marc Moreno Maza and   
                  Greg Reid and   
                Robin Scott and   
                     Wenyuan Wu   On approximate triangular decompositions
                                  in dimension zero  . . . . . . . . . . . 693--716
                  Hoon Hong and   
                     John Perry   Are Buchberger's criteria necessary for
                                  the chain condition? . . . . . . . . . . 717--732
               Howard Cheng and   
                  George Labahn   Output-sensitive modular algorithms for
                                  polynomial matrix normal forms . . . . . 733--750
               Chi-Ming Lam and   
         Vladimir Shpilrain and   
                     Jie-Tai Yu   Recognizing and parametrizing curves
                                  isomorphic to a line . . . . . . . . . . 751--756
               Manuel Bronstein   Structure theorems for parallel
                                  integration  . . . . . . . . . . . . . . 757--769

Journal of Symbolic Computation
Volume 42, Number 8, August, 2007

           Joris van der Hoeven   Generalized power series solutions to
                                  linear partial differential equations    771--791
           Joris van der Hoeven   New algorithms for relaxed
                                  multiplication . . . . . . . . . . . . . 792--802
                 Michael Wibmer   Gröbner bases for families of affine or
                                  projective schemes . . . . . . . . . . . 803--834
 Sonia Pérez-Díaz   Computation of the singularities of
                                  parametric plane curves  . . . . . . . . 835--857

Journal of Symbolic Computation
Volume 42, Number 9, September, 2007

              Peter Schauenburg   A Gröbner-based treatment of elimination
                                  theory for affine varieties  . . . . . . 859--870
       Gábor P. Nagy and   
     Petr Vojt\vechovský   The Moufang loops of order $64$ and $81$ 871--883
       Philippe Saux Picart and   
                   Cyril Brunie   Symmetric subresultants and applications 884--919
              C. J. Sangwin and   
                     P. Ramsden   Linear syntax for communicating
                                  elementary mathematics . . . . . . . . . 920--934

Journal of Symbolic Computation
Volume 42, Number 10, October, 2007

               Leonid Bedratyuk   On complete system of invariants for the
                                  binary form of degree 7  . . . . . . . . 935--947
                  Manuel Kauers   Summation algorithms for Stirling number
                                  identities . . . . . . . . . . . . . . . 948--970
             Isabel Bermejo and   
Ignacio García-Marco and   
Juan José Salazar-González   An algorithm for checking whether the
                                  toric ideal of an affine monomial curve
                                  is a complete intersection . . . . . . . 971--991
               Conrad Creel and   
                     Sam Nelson   Symbolic computation with finite
                                  biquandles . . . . . . . . . . . . . . . 992--1000

Journal of Symbolic Computation
Volume 42, Number 11--12, November / December, 2007

            Viktor Levandovskyy   Foreword from the Editor . . . . . . . . 1001--1002
                    Franz Pauer   Gröbner bases with coefficients in rings  1003--1011
            Edward L. Green and   
          Òyvind Solberg   An algorithmic approach to resolutions   1012--1033
            Gareth A. Evans and   
         Christopher D. Wensley   Complete involutive rewriting systems    1034--1051
   José Manuel Casas and   
            Manuel A. Insua and   
                   Manuel Ladra   Poincaré--Birkhoff--Witt theorem for
                                  Leibniz $n$  . . . . . . . . . . . . . . 1052--1065
              Peter Cameron and   
                  Natalia Iyudu   Graphs of relations and Hilbert series   1066--1078
     Tatiana Gateva-Ivanova and   
                    Shahn Majid   Set-theoretic solutions of the
                                  Yang--Baxter equation, graphs and
                                  computations . . . . . . . . . . . . . . 1079--1112
              Alban Quadrat and   
                 Daniel Robertz   Computation of bases of free modules
                                  over the Weyl algebras . . . . . . . . . 1113--1141
        R. M. Falcón and   
       J. Martín-Morales   Gröbner bases and the number of Latin
                                  squares related to autotopisms of order
                                  $\leq 7$ . . . . . . . . . . . . . . . . 1142--1154


Journal of Symbolic Computation
Volume 43, Number 1, January, 2008

       Bjarke Hammersholt Roune   Solving thousand-digit Frobenius
                                  problems using Gröbner bases  . . . . . . 1--7
              A. S. Detinko and   
                 D. L. Flannery   Algorithms for computing with nilpotent
                                  matrix groups over infinite domains  . . 8--26
                Oleg Golubitsky   Universal characteristic decomposition
                                  of radical differential ideals . . . . . 27--45
                   Agnes Szanto   Solving over-determined systems by the
                                  subresultant method (with an appendix by
                                  Marc Chardin)  . . . . . . . . . . . . . 46--74

Journal of Symbolic Computation
Volume 43, Number 2, February, 2008

           Sven Verdoolaege and   
                    Kevin Woods   Counting with rational generating
                                  functions  . . . . . . . . . . . . . . . 75--91
                 Falai Chen and   
               Wenping Wang and   
                       Yang Liu   Computing singular points of plane
                                  rational curves  . . . . . . . . . . . . 92--117
Sonia Pérez-Díaz and   
               J. Rafael Sendra   A univariate resultant-based
                                  implicitization algorithm for surfaces   118--139
          Przemys\law Koprowski   Algorithms for quadratic forms . . . . . 140--152

Journal of Symbolic Computation
Volume 43, Number 3, March, 2008

        Katsiaryna Krupchyk and   
                  Jukka Tuomela   Completion of overdetermined parabolic
                                  PDEs . . . . . . . . . . . . . . . . . . 153--167
             Laurent Dupont and   
              Daniel Lazard and   
             Sylvain Lazard and   
              Sylvain Petitjean   Near-optimal parameterization of the
                                  intersection of quadrics: I. The generic
                                  algorithm  . . . . . . . . . . . . . . . 168--191
             Laurent Dupont and   
              Daniel Lazard and   
             Sylvain Lazard and   
              Sylvain Petitjean   Near-optimal parameterization of the
                                  intersection of quadrics: II. A
                                  classification of pencils  . . . . . . . 192--215
             Laurent Dupont and   
              Daniel Lazard and   
             Sylvain Lazard and   
              Sylvain Petitjean   Near-optimal parameterization of the
                                  intersection of quadrics: III.
                                  Parameterizing singular intersections    216--232
                  Hoon Hong and   
                     John Perry   Corrigendum to ``Are Buchberger's
                                  criteria necessary for the chain
                                  condition?'' [J. Symbolic Comput. \bf 42
                                  (2007) 717--732] . . . . . . . . . . . . 233--233

Journal of Symbolic Computation
Volume 43, Number 4, April, 2008

             M'hammed El Kahoui   Topology of real algebraic space curves  235--258
               Mohamed Ayad and   
              Peter Fleischmann   On the decomposition of rational
                                  functions  . . . . . . . . . . . . . . . 259--274
               Jooyoun Hong and   
                 Aron Simis and   
          Wolmer V. Vasconcelos   On the homology of two-dimensional
                                  elimination  . . . . . . . . . . . . . . 275--292
                E. V. Flynn and   
                    C. Grattoni   Descent via isogeny on elliptic curves
                                  with large rational torsion subgroups    293--303
   Stéphane R. Louboutin   Localization of the complex zeros of
                                  parametrized families of polynomials . . 304--309

Journal of Symbolic Computation
Volume 43, Number 5, May, 2008

            Fatima K. Abu Salem   An efficient sparse adaptation of the
                                  polytope method over $\mathbb{F}_p$ and
                                  a record-high binary bivariate
                                  factorisation  . . . . . . . . . . . . . 311--341
               Satoshi Aoki and   
              Akimichi Takemura   The largest group of invariance for
                                  Markov bases and toric ideals  . . . . . 342--358
             Erich Kaltofen and   
                John P. May and   
             Zhengfeng Yang and   
                     Lihong Zhi   Approximate factorization of
                                  multivariate polynomials using singular
                                  value decomposition  . . . . . . . . . . 359--376
              S. A. Abramov and   
                 M. Petkov\vsek   Dimensions of solution spaces of
                                  $H$-systems  . . . . . . . . . . . . . . 377--394

Journal of Symbolic Computation
Volume 43, Number 6--7, June / July, 2008

                   Hyungju Park   Computer algebra in pure and applied
                                  mathematics: A foreword  . . . . . . . . 395--396
                    L. A. Bokut   Gröbner--Shirshov basis for the braid
                                  group in the Artin--Garside generators   397--405
               Pavel Kolesnikov   Universally defined representations of
                                  Lie conformal superalgebras  . . . . . . 406--421
                     Jeaman Ahn   The degree-complexity of the defining
                                  ideal of a smooth integral curve . . . . 422--441
                  Dong Hoon Lee   Algebraic degree of the inverse of
                                  linearized polynomials . . . . . . . . . 442--451
               Eunjeong Lee and   
             Hyang-Sook Lee and   
                    Yoonjin Lee   Eta pairing computation on general
                                  divisors over hyperelliptic curves $y^2
                                  = x^p - x + d$ . . . . . . . . . . . . . 452--474
                 Eng-Wee Chionh   $0/0$ Simplifies implicitization . . . . 475--489
               Satoshi Aoki and   
          Akimichi Takemura and   
                 Ruriko Yoshida   Indispensable monomials of toric ideals
                                  and Markov bases . . . . . . . . . . . . 490--507
          Hiroki Hashiguchi and   
               Toshiya Iwashita   Calculation of a formal moment
                                  generating function by using a
                                  differential operator  . . . . . . . . . 508--514

Journal of Symbolic Computation
Volume 43, Number 8, August, 2008

          Markus Rosenkranz and   
             Georg Regensburger   Solving and factoring boundary problems
                                  for linear ordinary differential
                                  equations in differential algebras . . . 515--544
                    Stefan Kohl   Algorithms for a class of infinite
                                  permutation groups . . . . . . . . . . . 545--581
            Oleg Golubitsky and   
         Marina Kondratieva and   
           Marc Moreno Maza and   
             Alexey Ovchinnikov   A bound for the Rosenfeld--Gröbner
                                  algorithm  . . . . . . . . . . . . . . . 582--610

Journal of Symbolic Computation
Volume 43, Number 9, September, 2008

              Carsten Schneider   A refined difference field theory for
                                  symbolic summation . . . . . . . . . . . 611--644
                Kwankyu Lee and   
          Michael E. O'Sullivan   List decoding of Reed--Solomon codes
                                  from a Gröbner basis perspective  . . . . 645--658
           Juan Gerardo Alcazar   Good global behavior of offsets to plane
                                  algebraic~curves . . . . . . . . . . . . 659--680

Journal of Symbolic Computation
Volume 43, Number 10, October, 2008

                     Mihai Cipu   Gröbner bases and Diophantine analysis    681--687
                 Edward Mosteig   Value monoids of zero-dimensional
                                  valuations of rank $1$ . . . . . . . . . 688--725
                  Meng Zhou and   
                  Franz Winkler   Computing difference-differential
                                  dimension polynomials by relative Gröbner
                                  bases in difference-differential modules 726--745
                Ruyong Feng and   
              Xiao-Shan Gao and   
                   Zhenyu Huang   Rational solutions of ordinary
                                  difference equations . . . . . . . . . . 746--763

Journal of Symbolic Computation
Volume 43, Number 11, November, 2008

                 Thomas Markwig   Standard bases in $K[[t_1, \ldots,
                                  t_m]][x_1, \ldots, x_n]^s$ . . . . . . . 765--786
              Manuel Kauers and   
            Burkhard Zimmermann   Computing the algebraic relations of
                                  C-finite sequences and multisequences    787--803
 Pilar Pisón-Casares and   
       Alberto Vigneron-Tenorio   On Lawrence semigroups . . . . . . . . . 804--810
                 Koji Ouchi and   
                    John Keyser   Rational Univariate Reduction via toric
                                  resultants . . . . . . . . . . . . . . . 811--844

Journal of Symbolic Computation
Volume 43, Number 12, December, 2008

           Juan Gerardo Alcazar   Good local behavior of offsets to
                                  rational regular algebraic surfaces  . . 845--857
                   Temur Kutsia   Flat matching  . . . . . . . . . . . . . 858--873
                    Yan-Ping Mu   Parameter augmentation and the q . . . . 874--882
                John Abbott and   
            Claudia Fassino and   
           Maria-Laura Torrente   Stable border bases for ideals of points 883--894
              Qiang-Hui Guo and   
                Qing-Hu Hou and   
                    Lisa H. Sun   Proving hypergeometric identities by
                                  numerical verifications  . . . . . . . . 895--907
                  Joseph Khoury   A Gröbner basis approach to solve a
                                  Conjecture of Nowicki  . . . . . . . . . 908--922


Journal of Symbolic Computation
Volume 44, Number 1, January, 2009

         Willem A. de Graaf and   
Jana Pílniková and   
                  Josef Schicho   Parametrizing Del Pezzo surfaces of
                                  degree $8$ using Lie algebras  . . . . . 1--14
            Alexander Fronk and   
                  Britta Kehden   State space analysis of Petri nets with
                                  relation-algebraic methods . . . . . . . 15--47
              S. A. Abramov and   
                 M. A. Barkatou   D'Alembertian series solutions at
                                  ordinary points of LODE with polynomial
                                  coefficients . . . . . . . . . . . . . . 48--59
              Claus-Peter Wirth   Shallow confluence of conditional term
                                  rewriting systems  . . . . . . . . . . . 60--98
                  Kuniaki Tsuji   An improved EZ-GCD algorithm for
                                  multivariate polynomials . . . . . . . . 99--110

Journal of Symbolic Computation
Volume 44, Number 2, February, 2009

                  Marc Dohm and   
                 Severinas Zube   The implicit equation of a canal surface 111--130
                    Tobias Beck   Formal desingularization of surfaces:
                                  The Jung method revisited  . . . . . . . 131--160
            Rida T. Farouki and   
         Carlotta Giannelli and   
             Alessandra Sestini   Helical polynomial curves and double
                                  Pythagorean hodographs I. Quaternion and
                                  Hopf map representations . . . . . . . . 161--179
              Martin Aigner and   
          Bert Jüttler and   
     Laureano Gonzalez-Vega and   
                  Josef Schicho   Parameterizing surfaces with certain
                                  special support functions, including
                                  offsets of quadrics and rationally
                                  supported surfaces . . . . . . . . . . . 180--191
            Carlos Andradas and   
                Tomas Recio and   
           J. Rafael Sendra and   
             Luis Felipe Tabera   On the simplification of the
                                  coefficients of a parametrization  . . . 192--210
               Leonid Bedratyuk   A complete minimal system of covariants
                                  for the binary form of degree 7  . . . . 211--220

Journal of Symbolic Computation
Volume 44, Number 3, March, 2009

     Jean-Charles Faug\`ere and   
              Fabrice Rouillier   Foreword . . . . . . . . . . . . . . . . 221--221
                  Daniel Lazard   Thirty years of Polynomial System
                                  Solving, and now?  . . . . . . . . . . . 222--231
        Laurent Busé and   
             Mohamed Elkadi and   
           André Galligo   A computational study of ruled surfaces  232--241
              Xiao-Shan Gao and   
                   Yong Luo and   
                  Chunming Yuan   A characteristic set method for ordinary
                                  difference polynomial systems  . . . . . 242--260
               Sylvain Neut and   
             Michel Petitot and   
                    Raouf Dridi   \'Elie Cartan's geometrical vision or
                                  how to avoid expression swell  . . . . . 261--270
         Ilias S. Kotsireas and   
           Christos Koukouvinos   Hadamard matrices of Williamson type: A
                                  challenge for Computer Algebra . . . . . 271--279
                  Greg Reid and   
                     Lihong Zhi   Solving polynomial systems via
                                  symbolic-numeric reduction to geometric
                                  involutive form  . . . . . . . . . . . . 280--291
                B. Mourrain and   
                   J. P. Pavone   Subdivision methods for solving
                                  polynomial equations . . . . . . . . . . 292--306

Journal of Symbolic Computation
Volume 44, Number 4, April, 2009

            Rida T. Farouki and   
         Carlotta Giannelli and   
             Alessandra Sestini   Helical polynomial curves and double
                                  Pythagorean hodographs II. Enumeration
                                  of low-degree curves . . . . . . . . . . 307--332
            Oleg Golubitsky and   
         Marina Kondratieva and   
             Alexey Ovchinnikov   Algebraic transformation of differential
                                  characteristic decompositions from one
                                  ranking to another . . . . . . . . . . . 333--357
       Bjarke Hammersholt Roune   The Slice Algorithm for irreducible
                                  decomposition of monomial ideals . . . . 358--381
                 Evelyne Hubert   Differential invariants of a Lie group
                                  action: Syzygies on a generating set . . 382--416
             Josep M. Miret and   
    Xavier Hernández and   
Sebasti\`a Xambó-Descamps   Corrigendum to: ``Computing the
                                  characteristic numbers of the variety of
                                  nodal plane cubics in $\mathbb{P}^3$''
                                  [J. Symbolic Comput. 42 (1--2) (2007)
                                  192--202]  . . . . . . . . . . . . . . . 417--418

Journal of Symbolic Computation
Volume 44, Number 5, May, 2009

Francisco J. Castro-Jimenez and   
         Laureano Gonzalez-Vega   Foreword from the editors  . . . . . . . 419--420
               An Khuong Nguyen   On d . . . . . . . . . . . . . . . . . . 421--434
            Shinichi Tajima and   
                 Yayoi Nakamura   Annihilating ideals for an algebraic
                                  local cohomology class . . . . . . . . . 435--448
              Hiromasa Nakayama   Algorithm computing the local $b$
                                  function by an approximate division
                                  algorithm in $\hat{D}$ . . . . . . . . . 449--462
        Montserrat Manubens and   
                 Antonio Montes   Minimal canonical comprehensive Gröbner
                                  systems  . . . . . . . . . . . . . . . . 463--478
                      Marc Dohm   Implicitization of rational ruled
                                  surfaces with $\mu$-bases  . . . . . . . 479--489
                   R. Rubio and   
           J. M. Serradilla and   
             M. P. Vélez   Detecting real singularities of a space
                                  curve from a real rational
                                  parametrization  . . . . . . . . . . . . 490--498
                    Diego Ruano   On the structure of generalized toric
                                  codes  . . . . . . . . . . . . . . . . . 499--506
           Gabriela Olteanu and   
    Ángel del Río   An algorithm to compute the Wedderburn
                                  decomposition of semisimple group
                                  algebras implemented in the GAP package
                                  \tt wedderga . . . . . . . . . . . . . . 507--516
            Manuel A. Insua and   
                   Manuel Ladra   Gröbner bases in universal enveloping
                                  algebras of Leibniz algebras . . . . . . 517--526
              L. M. Camacho and   
         J. R. Gómez and   
      A. J. González and   
                   B. A. Omirov   Naturally graded quasi-filiform Leibniz
                                  algebras . . . . . . . . . . . . . . . . 527--539
            Mohamed Barakat and   
                 Daniel Robertz   conley: Computing connection matrices in
                                  Maple  . . . . . . . . . . . . . . . . . 540--557
                 V. Alvarez and   
              J. A. Armario and   
                 M. D. Frau and   
                        P. Real   The homological reduction method for
                                  computing cocyclic Hadamard matrices . . 558--570
          J. Santiago Jorge and   
           Victor M. Gulias and   
                 Jose L. Freire   Certifying properties of an efficient
                                  functional program for computing Gröbner
                                  bases  . . . . . . . . . . . . . . . . . 571--582
            Emmanuel Briand and   
                 Mercedes Rosas   Milne's volume function and vector
                                  symmetric polynomials  . . . . . . . . . 583--590

Journal of Symbolic Computation
Volume 44, Number 6, June, 2009

           Andrew J. Hanson and   
                    Ji-Ping Sha   A tessellation for Fermat surfaces in
                                  $\mathbb{C} {P}^3$ . . . . . . . . . . . 591--605
              Scott R. Pope and   
                   Agnes Szanto   Nearest multivariate system with given
                                  root multiplicities  . . . . . . . . . . 606--625
               Abramo Hefez and   
    Marcelo Escudeiro Hernandes   Analytic classification of plane
                                  branches up to multiplicity 4  . . . . . 626--634
             F. San Segundo and   
                   J. R. Sendra   Partial degree formulae for plane offset
                                  curves . . . . . . . . . . . . . . . . . 635--654
                 Roy Joshua and   
                 Shaun Van Ault   Implementation of Stanley's algorithm
                                  for projective group imbeddings  . . . . 655--672
              J. E. Cremona and   
                   T. A. Fisher   On the equivalence of binary quartics    673--682
                       J. Busch   Lower bounds for decision problems in
                                  imaginary, norm-Euclidean quadratic
                                  integer rings  . . . . . . . . . . . . . 683--699

Journal of Symbolic Computation
Volume 44, Number 7, July, 2009

            Carlos D'Andrea and   
               Bernard Mourrain   Special issue on symbolic and algebraic
                                  computation  . . . . . . . . . . . . . . 701--702
              Hirokazu Anai and   
                Shinji Hara and   
              Masaaki Kanno and   
              Kazuhiro Yokoyama   Parametric polynomial spectral
                                  factorization using the sum of roots and
                                  its application to a control design
                                  problem  . . . . . . . . . . . . . . . . 703--725
              Eda Cesaratto and   
      Julien Clément and   
         Beno\^\it Daireaux and   
             Lo\"\ick Lhote and   
Véronique Maume-Deschamps and   
         Brigitte Vallée   Regularity of the Euclid Algorithm;
                                  application to the analysis of fast GCD
                                  algorithms . . . . . . . . . . . . . . . 726--767
              Jin-San Cheng and   
              Xiao-Shan Gao and   
                  Chee-Keng Yap   Complete numerical isolation of real
                                  roots in zero-dimensional triangular
                                  systems  . . . . . . . . . . . . . . . . 768--785
            Serena Cical\`o and   
             Willem A. de Graaf   Non-associative Gröbner bases,
                                  finitely-presented Lie rings and the
                                  Engel condition, II  . . . . . . . . . . 786--800
       Christian Costermans and   
                Hoang Ngoc Minh   Noncommutative algebra, multiple
                                  harmonic sums and applications in
                                  discrete probability . . . . . . . . . . 801--817
      Dimitrios I. Diochnos and   
          Ioannis Z. Emiris and   
            Elias P. Tsigaridas   On the asymptotic and practical
                                  complexity of solving bivariate systems
                                  over the reals . . . . . . . . . . . . . 818--835
                Raouf Dridi and   
                 Michel Petitot   New classification techniques for
                                  ordinary differential equations  . . . . 836--851
Jean-François Jaulent and   
            Sebastian Pauli and   
           Michael E. Pohst and   
        Florence Soriano-Gafiuk   Computation of $2$-groups of narrow
                                  logarithmic divisor classes of number
                                  fields . . . . . . . . . . . . . . . . . 852--863
          Jean-Pierre Jouanolou   An explicit duality for
                                  quasi-homogeneous ideals . . . . . . . . 864--871
              Daniel Kunkle and   
                 Gene Cooperman   Harnessing parallel disks to solve
                                  Rubik's cube . . . . . . . . . . . . . . 872--890
                     Xin Li and   
           Marc Moreno Maza and   
             Éric Schost   Fast arithmetic for triangular sets:
                                  From theory to practice  . . . . . . . . 891--907
               Hiroshi Sekigawa   On real factors of real interval
                                  polynomials  . . . . . . . . . . . . . . 908--922
                 Wenyuan Wu and   
                  Greg Reid and   
                   Silvana Ilie   Implicit Riquier Bases for PDAE and
                                  their semi-discretizations . . . . . . . 923--941

Journal of Symbolic Computation
Volume 44, Number 8, August, 2009

            Mark Giesbrecht and   
              George Labahn and   
                   Wen-shin Lee   Symbolic--numeric sparse interpolation
                                  of multivariate polynomials  . . . . . . 943--959
         William Y. C. Chen and   
               Ernest X. W. Xia   The $q$-WZ method for infinite series    960--971
        Arthur D. Chtcherba and   
               Deepak Kapur and   
               Manfred Minimair   Cayley--Dixon projection operator for
                                  multi-univariate composed polynomials    972--999
           Joris van der Hoeven   On asymptotic extrapolation  . . . . . . 1000--1016
         Moulay A. Barkatou and   
           Eckhard Pflügel   On the Moser- and super-reduction
                                  algorithms of systems of linear
                                  differential equations and their
                                  complexity . . . . . . . . . . . . . . . 1017--1036
              A. S. Detinko and   
                 D. L. Flannery   On deciding finiteness of matrix groups  1037--1043
               R. T. Curtis and   
                B. T. Fairbairn   Symmetric representation of the elements
                                  of the Conway group $_.0$  . . . . . . . 1044--1067
           James McLaughlin and   
            Andrew V. Sills and   
                   Peter Zimmer   Rogers--Ramanujan computer searches  . . 1068--1078
                    Filip Cools   On the relation between weighted trees
                                  and tropical Grassmannians . . . . . . . 1079--1086

Journal of Symbolic Computation
Volume 44, Number 9, September, 2009

       André Galligo and   
          Luis Miguel Pardo and   
                  Josef Schicho   Effective methods in algebraic geometry  1087--1088
         Clémence Durvye   Evaluation techniques for
                                  zero-dimensional primary decomposition   1089--1113
       Peter Bürgisser and   
            Peter Scheiblechner   On the complexity of counting components
                                  of algebraic varieties . . . . . . . . . 1114--1136
                  X. S. Gao and   
          J. Van der Hoeven and   
                 C. M. Yuan and   
                    G. L. Zhang   Characteristic set method for
                                  differential--difference polynomial
                                  systems  . . . . . . . . . . . . . . . . 1137--1163
            Carlos D'Andrea and   
                  Hoon Hong and   
               Teresa Krick and   
                   Agnes Szanto   Sylvester's double sums: The general
                                  case . . . . . . . . . . . . . . . . . . 1164--1175
              Daniel Lazard and   
                 Scott McCallum   Iterated discriminants . . . . . . . . . 1176--1193
                  M. Elkadi and   
                 A. Galligo and   
                     M. Weimann   Towards toric absolute factorization . . 1194--1211
                  Gregor Kemper   Separating invariants  . . . . . . . . . 1212--1222
             Willem A. de Graaf   Constructing algebraic groups from their
                                  Lie algebras . . . . . . . . . . . . . . 1223--1233
                 E. Fortuna and   
                  P. Gianni and   
                      B. Trager   Generators of the ideal of an algebraic
                                  space curve  . . . . . . . . . . . . . . 1234--1254
              Hendrik Hubrechts   Quasi-quadratic elliptic curve point
                                  counting using rigid cohomology  . . . . 1255--1267
               Bernd Martin and   
         Hendrik Süß   Milnor algebras could be isomorphic to
                                  modular algebras . . . . . . . . . . . . 1268--1279
  Martín Avendaño   The number of roots of a lacunary
                                  bivariate polynomial on a line . . . . . 1280--1284
                Mari Castle and   
            Victoria Powers and   
                  Bruce Reznick   A quantitative Pólya's Theorem with zeros 1285--1290
             Lionel Alberti and   
           Bernard Mourrain and   
     Jean-Pierre Técourt   Isotopic triangulation of a real
                                  algebraic surface  . . . . . . . . . . . 1291--1310
Eduardo Sáenz-de-Cabezón and   
                  Henry P. Wynn   Betti numbers and minimal free
                                  resolutions for multi-state system
                                  reliability bounds . . . . . . . . . . . 1311--1325
       Michael Brickenstein and   
               Alexander Dreyer   PolyBoRi: framework for Gröbner-basis
                                  computations with Boolean polynomials    1326--1345
 Clément M. Gosselin and   
                Brian Moore and   
                  Josef Schicho   Dynamic balancing of planar mechanisms
                                  using toric geometry . . . . . . . . . . 1346--1358

Journal of Symbolic Computation
Volume 44, Number 10, October, 2009

                 Daniel Robertz   Noether normalization guided by monomial
                                  cone decompositions  . . . . . . . . . . 1359--1373
           Roberto La Scala and   
            Viktor Levandovskyy   Letterplace ideals and non-commutative
                                  Gröbner bases . . . . . . . . . . . . . . 1374--1393
               Mingbo Zhang and   
                  Xiao-Shan Gao   Decomposition of ordinary difference
                                  polynomials  . . . . . . . . . . . . . . 1394--1409
                 Shih Ping Tung   Algorithms for near solutions to
                                  polynomial equations . . . . . . . . . . 1410--1424
             Josep M. Miret and   
            Jordi Pujol\`as and   
               Kumar Saurav and   
Sebasti\`a Xambó-Descamps   Computing some fundamental numbers of
                                  the variety of nodal cubics in
                                  $\mathbb{P}^3$ . . . . . . . . . . . . . 1425--1447
                Marcin Dumnicki   An algorithm to bound the regularity and
                                  nonemptiness of linear systems in
                                  $\mathbb{P}^n$ . . . . . . . . . . . . . 1448--1462
           Raymond Hemmecke and   
                Peter N. Malkin   Computing generating sets of lattice
                                  ideals and Markov bases of lattices  . . 1463--1476
                 Dave Bayer and   
                  Amelia Taylor   Reverse search for monomial ideals . . . 1477--1486
              Songxin Liang and   
               David J. Jeffrey   Automatic computation of the complete
                                  root classification for a parametric
                                  polynomial . . . . . . . . . . . . . . . 1487--1501
                   David Harvey   Faster polynomial multiplication via
                                  multipoint Kronecker substitution  . . . 1502--1510
                T. Wietecha and   
                    K. Sokalski   Plus--minus algorithm --- A method for
                                  derivation of the Bäcklund
                                  transformations  . . . . . . . . . . . . 1511--1528
                  Adam Clay and   
              Lawrence H. Smith   Corrigendum to: ``On ordering free
                                  groups'' [J. Symbolic Comput. 40 (2005)
                                  1285--1290]  . . . . . . . . . . . . . . 1529--1532

Journal of Symbolic Computation
Volume 44, Number 11, November, 2009

          Robert M. Corless and   
          Reiner Lauterbach and   
       Hans-Michael Möller   Preface  . . . . . . . . . . . . . . . . 1533--1535
          Robert M. Corless and   
            Karin Gatermann and   
             Ilias S. Kotsireas   Using symmetries in the eigenvalue
                                  method for polynomial systems  . . . . . 1536--1550
           Gheorghe Craciun and   
         Alicia Dickenstein and   
                  Anne Shiu and   
                Bernd Sturmfels   Toric dynamical systems  . . . . . . . . 1551--1565
               Daniel Heldt and   
             Martin Kreuzer and   
          Sebastian Pokutta and   
                Hennie Poulisse   Approximate computation of
                                  zero-dimensional polynomial ideals . . . 1566--1591
               Xavier Dahan and   
         Éric Schost and   
                         Jie Wu   Evaluation properties of invariant
                                  polynomials  . . . . . . . . . . . . . . 1592--1604

Journal of Symbolic Computation
Volume 44, Number 12, December, 2009

               Daniel Augot and   
     Jean-Charles Faug\`ere and   
                 Ludovic Perret   Foreword . . . . . . . . . . . . . . . . 1605--1607
               Daniel Augot and   
              Magali Bardet and   
         Jean-Charles Faug\`ere   On the decoding of binary cyclic codes
                                  with the Newton identities . . . . . . . 1608--1625
          Stanislav Bulygin and   
                 Ruud Pellikaan   Bounded distance decoding of linear
                                  error-correcting codes with Gröbner bases 1626--1643
           Delphine Boucher and   
                    Felix Ulmer   Coding with skew polynomial rings  . . . 1644--1656
         M. Prem Laxman Das and   
             Kripasindhu Sikdar   List decoding codes on
                                  Garcia--Stictenoth tower using Gröbner
                                  basis  . . . . . . . . . . . . . . . . . 1657--1661
                Kwankyu Lee and   
          Michael E. O'Sullivan   List decoding of Hermitian codes using
                                  Gröbner bases . . . . . . . . . . . . . . 1662--1675
     Jean-Charles Faug\`ere and   
                 Ludovic Perret   An efficient algorithm for decomposing
                                  multivariate polynomials and its
                                  applications to cryptography . . . . . . 1676--1689
                Pierrick Gaudry   Index calculus for abelian varieties of
                                  small dimension and the elliptic curve
                                  discrete logarithm problem . . . . . . . 1690--1702
         Côme Berbain and   
              Henri Gilbert and   
                Jacques Patarin   QUAD: A multivariate stream cipher with
                                  provable security  . . . . . . . . . . . 1703--1723


Journal of Symbolic Computation
Volume 45, Number 1, January, 2010

               Martin Peternell   Rational two-parameter families of
                                  spheres and rational offset surfaces . . 1--18
                Claudia Fassino   Almost vanishing polynomials for sets of
                                  limited precision points . . . . . . . . 19--37
            Alberto Damiano and   
           Graziano Gentili and   
                Daniele Struppa   Computations in the ring of quaternionic
                                  polynomials  . . . . . . . . . . . . . . 38--45
            Rouchdi Bahloul and   
                 Toshinori Oaku   Local Bernstein--Sato ideals: Algorithm
                                  and examples . . . . . . . . . . . . . . 46--59
                 Bahman Engheta   A bound on the projective dimension of
                                  three cubics . . . . . . . . . . . . . . 60--73
               Temur Kutsia and   
                 Jordi Levy and   
                 Mateu Villaret   On the relation between Context and
                                  Sequence Unification . . . . . . . . . . 74--95
     Inmaculada Medina-Bulo and   
    Francisco Palomo-Lozano and   
    José-Luis Ruiz-Reina   A verified Common Lisp . . . . . . . . . 96--123
    François Boulier and   
    François Lemaire and   
               Marc Moreno Maza   Computing differential characteristic
                                  sets by change of ordering . . . . . . . 124--149

Journal of Symbolic Computation
Volume 45, Number 2, February, 2010

            Silvio Ghilardi and   
Viorica Sofronie-Stokkermans and   
             Ulrike Sattler and   
                  Ashish Tiwari   Special issue on automated deduction:
                                  Decidability, complexity, tractability   151--152
               Aharon Abadi and   
       Alexander Rabinovich and   
                    Mooly Sagiv   Decidable fragments of many-sorted logic 153--172
      Adri\`a Gascón and   
              Guillem Godoy and   
Manfred Schmidt-Schauß and   
                  Ashish Tiwari   Context unification with one context
                                  variable . . . . . . . . . . . . . . . . 173--193
               Carsten Lutz and   
                   Frank Wolter   Deciding inseparability and conservative
                                  extensions in the description logic
                                  $\cal E L$ . . . . . . . . . . . . . . . 194--228
       Maria Paola Bonacina and   
                 Mnacho Echenim   Theory decision by decomposition . . . . 229--260
             Duc-Khanh Tran and   
      Christophe Ringeissen and   
              Silvio Ranise and   
       Hél\`ene Kirchner   Combination of convex theories:
                                  Modularity, deduction completeness, and
                                  explanation  . . . . . . . . . . . . . . 261--286

Journal of Symbolic Computation
Volume 45, Number 3, March, 2010

                Ruyong Feng and   
          Michael F. Singer and   
                         Min Wu   Liouvillian solutions of linear
                                  difference--differential equations . . . 287--305
                Ruyong Feng and   
          Michael F. Singer and   
                         Min Wu   An algorithm to compute Liouvillian
                                  solutions of prime order linear
                                  difference--differential equations . . . 306--323
             Sonia L. Rueda and   
               J. Rafael Sendra   Linear complete differential resultants
                                  and the implicitization of linear DPPEs  324--341
                 Allan K. Steel   Computing with algebraically closed
                                  fields . . . . . . . . . . . . . . . . . 342--372
           J. Araújo and   
           P. V. Bünau and   
             J. D. Mitchell and   
             M. Neunhöffer   Computing automorphisms of semigroups    373--392

Journal of Symbolic Computation
Volume 45, Number 4, April, 2010

                 Tetsuo Ida and   
             Hidekazu Takahashi   Origami fold as algebraic graph
                                  rewriting  . . . . . . . . . . . . . . . 393--413
               Xiaohong Jia and   
                Haohao Wang and   
                    Ron Goldman   Set-theoretic generators of rational
                                  space curves . . . . . . . . . . . . . . 414--433
          Gabriela Jeronimo and   
                Daniel Perrucci   On the minimum of a positive polynomial
                                  over the standard simplex  . . . . . . . 434--442
   François Apéry   Subresultants of two Hermite--Laurent
                                  series . . . . . . . . . . . . . . . . . 443--461
            Kenta Nishiyama and   
                  Masayuki Noro   Stratification associated with local b   462--480
             Meera Sitharam and   
           Jörg Peters and   
                      Yong Zhou   Optimized parametrization of systems of
                                  incidences between rigid bodies  . . . . 481--498

Journal of Symbolic Computation
Volume 45, Number 5, May, 2010

                   Temur Kutsia   Symbolic computation in software
                                  science: Foreword from the Editor  . . . 499--500
                   Sergio Antoy   Programming with narrowing: A tutorial   501--522
            Horatiu Cirstea and   
            Claude Kirchner and   
                Radu Kopetz and   
          Pierre-Etienne Moreau   Anti-patterns for rule-based languages   523--550
            Masaki Nakamura and   
             Kazuhiro Ogata and   
              Kokichi Futatsugi   Reducibility of operation symbols in
                                  term rewriting systems and its
                                  application to behavioral specifications 551--573
               Thomas Genet and   
                      Vlad Rusu   Equational approximations for tree
                                  automata completion  . . . . . . . . . . 574--597
              Masahiko Sato and   
                  Randy Pollack   External and internal syntax of the
                                  $\lambda$ calculus . . . . . . . . . . . 598--616

Journal of Symbolic Computation
Volume 45, Number 6, June, 2010

             Prashant Batra and   
                  Vikram Sharma   Bounds on absolute positiveness of
                                  multivariate polynomials . . . . . . . . 617--628
            Volker Gebhardt and   
   Juan González-Meneses   Solving the conjugacy problem in Garside
                                  groups by cyclic sliding . . . . . . . . 629--656
                Jan Vr\vsek and   
      Miroslav Lávi\vcka   On convolutions of algebraic curves  . . 657--676
              Kurt Mehlhorn and   
                    Saurabh Ray   Faster algorithms for computing Hong's
                                  bound on absolute positiveness . . . . . 677--683
              S. A. Abramov and   
                 M. Petkov\vsek   Polynomial ring automorphisms, rational
                                  $(w, \sigma)$-canonical forms, and the
                                  assignment problem . . . . . . . . . . . 684--708
         Andries E. Brouwer and   
              Mihaela Popoviciu   The invariants of the binary nonic . . . 709--720

Journal of Symbolic Computation
Volume 45, Number 7, July, 2010

           Antonio Campillo and   
        Patrick Fitzpatrick and   
 Edgar Martínez-Moro and   
                 Ruud Pellikaan   Special issue algebraic coding theory
                                  and applications . . . . . . . . . . . . 721--722
               Nigel Boston and   
                   Gary McGuire   The weight distributions of cyclic codes
                                  with two zeros and zeta functions  . . . 723--733
          Nathan Owen Ilten and   
         Hendrik Süß   Algebraic geometry codes from polyhedral
                                  divisors . . . . . . . . . . . . . . . . 734--756
                 Drue Coles and   
                  Emma Previato   Decoding by rank-2 bundles over plane
                                  quartics . . . . . . . . . . . . . . . . 757--772
               Peter Beelen and   
               Kristian Brander   Key equations for list decoding of
                                  Reed--Solomon codes and how to solve
                                  them . . . . . . . . . . . . . . . . . . 773--786
                Sunghyu Han and   
                   Jon-Lark Kim   Formally self-dual additive codes over
                                  $\mathbb{F}_4$ . . . . . . . . . . . . . 787--799
                    W. Fish and   
                  J. D. Key and   
                    E. Mwambene   Binary codes from the line graph of the
                                  $n$-cube . . . . . . . . . . . . . . . . 800--812
         C. Martínez and   
                 R. Beivide and   
                C. Camarero and   
                E. Stafford and   
                E. M. Gabidulin   Quotients of Gaussian graphs and their
                                  application to perfect codes . . . . . . 813--824

Journal of Symbolic Computation
Volume 45, Number 8, August, 2010

         Preda Mih\uailescu and   
               Victor Vuletescu   Elliptic Gauss sums and applications to
                                  point counting . . . . . . . . . . . . . 825--836
         Andries E. Brouwer and   
              Mihaela Popoviciu   The invariants of the binary decimic . . 837--843
            Rida T. Farouki and   
                 Takis Sakkalis   Rational rotation-minimizing frames on
                                  polynomial space curves of arbitrary
                                  degree . . . . . . . . . . . . . . . . . 844--856
           Joris van der Hoeven   Newton's method and FFT trading  . . . . 857--878
     Joachim von zur Gathen and   
           Maurice Mignotte and   
            Igor E. Shparlinski   Approximate polynomial GCD: Small degree
                                  and small height perturbations . . . . . 879--886

Journal of Symbolic Computation
Volume 45, Number 9, September, 2010

         Gert-Martin Greuel and   
          Santiago Laplagne and   
                 Frank Seelisch   Normalization of rings . . . . . . . . . 887--901
                 Liang Chen and   
                Michael Monagan   Algorithms for solving linear systems
                                  over cyclotomic fields . . . . . . . . . 902--917
                      Huishi Li   Looking for Gröbner basis theory for
                                  (almost) skew 2-nomial algebras  . . . . 918--942
                   Bettina Eick   Some new simple Lie algebras in
                                  characteristic $2$ . . . . . . . . . . . 943--951

Journal of Symbolic Computation
Volume 45, Number 10, October, 2010

Eduardo Sáenz-de-Cabezón   Computing the support of monomial
                                  iterated mapping cones . . . . . . . . . 953--964
        \cStefan O. Toha\vneanu   On the De Boer--Pellikaan method for
                                  computing minimum distance . . . . . . . 965--974
           M. Emilia Alonso and   
                 Henri Lombardi   Local Bézout Theorem  . . . . . . . . . . 975--985
               Joël Merker   Application of computational invariant
                                  theory to Kobayashi hyperbolicity and to
                                  Green--Griffiths algebraic degeneracy    986--1074
            Marc Mezzarobba and   
                    Bruno Salvy   Effective bounds for $P$-recursive
                                  sequences  . . . . . . . . . . . . . . . 1075--1096

Journal of Symbolic Computation
Volume 45, Number 11, November, 2010

               Martin Giese and   
             Andrew Ireland and   
            Laura Kovács   Introduction . . . . . . . . . . . . . . 1097--1100
               Stefan Kauer and   
      Jürgen F. H. Winkler   Mechanical inference of invariants for
                                  FOR-loops  . . . . . . . . . . . . . . . 1101--1113
                   Ali Mili and   
                Shir Aharon and   
         Chaitanya Nadkarni and   
         Lamia Labed Jilani and   
              Asma Louhichi and   
                    Olfa Mraihi   Reflexive transitive invariant
                                  relations: A basis for computing loop
                                  functions  . . . . . . . . . . . . . . . 1114--1143
             Igor V. Konnov and   
           Vladimir A. Zakharov   An invariant-based approach to the
                                  verification of asynchronous
                                  parameterized networks . . . . . . . . . 1144--1162
              Chenguang Luo and   
             Florin Craciun and   
              Shengchao Qin and   
                 Guanhua He and   
                  Wei-Ngan Chin   Verifying pointer safety for programs
                                  with unknown calls . . . . . . . . . . . 1163--1183
                Yannick Moy and   
           Claude Marché   Modular inference of subprogram
                                  contracts for safety checking  . . . . . 1184--1211
         Andrey Rybalchenko and   
   Viorica Sofronie-Stokkermans   Constraint solving for interpolation . . 1212--1233
                  Bican Xia and   
                   Zhihai Zhang   Termination of linear programs with
                                  nonlinear constraints  . . . . . . . . . 1234--1249

Journal of Symbolic Computation
Volume 45, Number 12, December, 2010

            Carlos D'Andrea and   
                Marc Giusti and   
              Luis M. Pardo and   
                    Ragni Piene   Effective methods in algebraic geometry
                                  2009: Barcelona. Guest editors' foreword 1251--1253
                  Hirotachi Abo   On non-defectivity of certain
                                  Segre--Veronese varieties  . . . . . . . 1254--1269
               Saugata Basu and   
     Marie-Françoise Roy   Bounding the radii of balls meeting
                                  every connected component of
                                  semi-algebraic sets  . . . . . . . . . . 1270--1279
           Cristina Bertone and   
          Guillaume Ch\`eze and   
           André Galligo   Modular Las Vegas algorithms for
                                  polynomial absolute factorization  . . . 1280--1295
María Angélica Cueto and   
           Enrique A. Tobis and   
                   Josephine Yu   An implicitization challenge for binary
                                  factor analysis  . . . . . . . . . . . . 1296--1315
            G. M. Diaz-Toca and   
                    H. Lombardi   Dynamic Galois Theory  . . . . . . . . . 1316--1329
               Amir Hashemi and   
      Gwénolé Ars   Extended $F_5$ criteria  . . . . . . . . 1330--1340
             P.-V. Koseleff and   
                  D. Pecker and   
                   F. Rouillier   The first rational Chebyshev knots . . . 1341--1358
                J. M. Landsberg   P versus NP and geometry . . . . . . . . 1359--1377
            Thierry Coquand and   
             Henri Lombardi and   
           Claude Quitté   Curves and coherent Prüfer rings  . . . . 1378--1390
             Antonio Montes and   
                 Michael Wibmer   Gröbner bases for polynomial systems with
                                  parameters . . . . . . . . . . . . . . . 1391--1425
 L. X. Châu Ngô and   
                  Franz Winkler   Rational general solutions of first
                                  order non-autonomous parametrizable ODEs 1426--1441
             Christian Eder and   
                     John Perry   F5C: A variant of Faug\`ere's F5
                                  algorithm with reduced Gröbner bases  . . 1442--1458
            Peter Scheiblechner   On a generalization of Stickelberger's
                                  Theorem  . . . . . . . . . . . . . . . . 1459--1470


Journal of Symbolic Computation
Volume 46, Number 1, January, 2011

              Jon Wilkening and   
                         Jia Yu   A local construction of the Smith normal
                                  form of a matrix polynomial  . . . . . . 1--22
            Sandra Di Rocco and   
               David Eklund and   
             Chris Peterson and   
              Andrew J. Sommese   Chern numbers of smooth varieties via
                                  homotopy continuation and intersection
                                  theory . . . . . . . . . . . . . . . . . 23--33
        Alessandra Bernardi and   
      Alessandro Gimigliano and   
                   Monica Id\`a   Computing symmetric rank for symmetric
                                  tensors  . . . . . . . . . . . . . . . . 34--53
         Paraskevas Alvanos and   
             Dimitrios Poulakis   Solving genus zero Diophantine equations
                                  over number fields . . . . . . . . . . . 54--69
              Kurt Mehlhorn and   
              Michael Sagraloff   A deterministic algorithm for isolating
                                  real roots of a real polynomial  . . . . 70--90
             Sonia L. Rueda and   
               J. Rafael Sendra   Corrigendum to ``Linear complete
                                  differential resultants and the
                                  implicitization of linear DPPEs'' [J.
                                  Symbolic Comput. \bf 45 (3) March (2010)
                                  324--341]  . . . . . . . . . . . . . . . 91--92
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 2, February, 2011

               Demis Ballis and   
                   Temur Kutsia   Foreword . . . . . . . . . . . . . . . . 93--94
            Gregory Malecha and   
             Greg Morrisett and   
                  Ryan Wisnesky   Trace-based verification of imperative
                                  programs with I/O  . . . . . . . . . . . 95--118
             Federico Banti and   
           Rosario Pugliese and   
               Francesco Tiezzi   An accessible verification environment
                                  for UML models of services . . . . . . . 119--149
                  Zef Hemel and   
       Danny M. Groenewegen and   
         Lennart C. L. Kats and   
                   Eelco Visser   Static consistency checking of Web
                                  applications with WebDSL . . . . . . . . 150--182
   Christian Schönberg and   
                Franz Weitl and   
               Burkhard Freitag   Verifying the consistency of Web-based
                                  technical documentations . . . . . . . . 183--206
              Marino Linaje and   
        Adolfo Lozano-Tello and   
   Miguel A. Perez-Toledano and   
       Juan Carlos Preciado and   
Roberto Rodriguez-Echeverria and   
      Fernando Sanchez-Figueroa   Providing RIA user interfaces with
                                  accessibility properties . . . . . . . . 207--217
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 3, March, 2011

           Jochen Pfalzgraf and   
              Hartmut Ehrig and   
               Ulrike Golas and   
                  Thomas Soboll   Foreword . . . . . . . . . . . . . . . . 219--221
               Paolo Baldan and   
             Filippo Bonchi and   
           Andrea Corradini and   
             Tobias Heindel and   
             Barbara König   A lattice-theoretical perspective on
                                  adhesive categories  . . . . . . . . . . 222--245
            Benjamin Braatz and   
               Ulrike Golas and   
                  Thomas Soboll   How to delete categorically --- Two
                                  pushout complement constructions . . . . 246--271
       Jean-Guillaume Dumas and   
            Dominique Duval and   
            Jean-Claude Reynaud   Cartesian effect categories are
                                  Freyd-categories . . . . . . . . . . . . 272--293
                Fernando Orejas   Symbolic graphs for attributed graph
                                  constraints  . . . . . . . . . . . . . . 294--315
           Christoph Schulz and   
          Michael Löwe and   
              Harald König   A categorical framework for the
                                  transformation of object-oriented
                                  systems: Models and data . . . . . . . . 316--337
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 4, April, 2011

           Joris van der Hoeven   Meta-expansion of transseries  . . . . . 339--359
               Graham Ellis and   
                     Paul Smith   Computing group cohomology rings from
                                  the Lyndon--Hochschild--Serre spectral
                                  sequence . . . . . . . . . . . . . . . . 360--370
            Scott H. Murray and   
          Colva M. Roney-Dougal   Constructive homomorphisms for classical
                                  groups . . . . . . . . . . . . . . . . . 371--384
 Marie-Françoise Roy and   
                Aviva Szpirglas   Sylvester double sums and subresultants  385--395
               Annick Valibouze   Gröbner basis of the alternating
                                  galoisian ideal  . . . . . . . . . . . . 396--405
     Jean-Charles Faug\`ere and   
         Mohab Safey El Din and   
       Pierre-Jean Spaenlehauer   Gröbner bases of bihomogeneous ideals
                                  generated by polynomials of bidegree
                                  $(1,1)$: Algorithms and complexity . . . 406--437
             Willem A. de Graaf   Computing representatives of nilpotent
                                  orbits of $\theta$-groups  . . . . . . . 438--458
     Jean-Charles Faug\`ere and   
                       Ye Liang   Artificial discontinuities of
                                  single-parametric Gröbner bases . . . . . 459--466
             Michael Hemmer and   
             Laurent Dupont and   
          Sylvain Petitjean and   
             Elmar Schömer   A complete, exact and efficient
                                  implementation for computing the
                                  edge-adjacency graph of an arrangement
                                  of quadrics  . . . . . . . . . . . . . . 467--494
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 5, May, 2011

           Elizabeth Arnold and   
            Ilias Kotsireas and   
              Markus Rosenkranz   Bruno Buchberger and the world of Gröbner
                                  bases  . . . . . . . . . . . . . . . . . 495--497
              A. M. Bigatti and   
                 M. Caboara and   
                    L. Robbiano   Computing inhomogeneous Gröbner bases . . 498--510
       Víctor Blanco and   
                   Justo Puerto   Some algebraic methods for solving
                                  multiobjective polynomial integer
                                  programs . . . . . . . . . . . . . . . . 511--533
            Massimo Caboara and   
            Fabrizio Caruso and   
                 Carlo Traverso   Lattice Polly Cracker cryptosystems  . . 534--549
  Anne Frühbis-Krüger   A modified coefficient ideal for use
                                  with the strict transform  . . . . . . . 550--560
         Gert-Martin Greuel and   
             Frank Seelisch and   
                 Oliver Wienand   The Gröbner basis of the ideal of
                                  vanishing polynomials  . . . . . . . . . 561--570
                 Tetsuo Ida and   
                 Asem Kasem and   
            Fadoua Ghourabi and   
             Hidekazu Takahashi   Morley's theorem revisited: Origami
                                  construction and automated proof . . . . 571--583
                   K. Kalorkoti   Model checking in the modal
                                  $\mu$-calculus and generic solutions . . 584--594
        Viktor Levandovskyy and   
            Kristina Schindelar   Computing diagonal form and Jacobson
                                  normal form of a matrix using Gröbner
                                  bases  . . . . . . . . . . . . . . . . . 595--608
            Agustin Marcelo and   
                 Peter Schenzel   Non-Cohen--Macaulay unique factorization
                                  domains in small dimensions  . . . . . . 609--621
                Yosuke Sato and   
              Shutaro Inoue and   
               Akira Suzuki and   
        Katsusuke Nabeshima and   
                       Ko Sakai   Boolean Gröbner bases . . . . . . . . . . 622--632
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 6, June, 2011

         Moulay A. Barkatou and   
             Thomas Cluzeau and   
                Carole El Bacha   Simple forms of higher-order linear
                                  differential systems and their
                                  applications in computing regular
                                  solutions  . . . . . . . . . . . . . . . 633--658
             Nicoleta B\^\il\va   On a new method for finding generalized
                                  equivalence transformations for
                                  differential equations involving
                                  arbitrary functions  . . . . . . . . . . 659--671
             Nazeran Idrees and   
            Gerhard Pfister and   
                 Stefan Steidel   Parallelization of Modular Algorithms    672--684
                   J. Heras and   
                 V. Pascual and   
                   J. Rubio and   
                  F. Sergeraert   fKenzo: a user interface for
                                  computations in Algebraic Topology . . . 685--698
      Kh. Hessami Pilehrood and   
           T. Hessami Pilehrood   A $q$-analogue of the
                                  Bailey--Borwein--Bradley identity  . . . 699--711
            Daniel Plaumann and   
            Bernd Sturmfels and   
                Cynthia Vinzant   Quartic curves and their bitangents  . . 712--733
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 7, July, 2011

         Mark W. Giesbrecht and   
                Stephen M. Watt   In honour of Keith Geddes on his 60th
                                  birthday . . . . . . . . . . . . . . . . 735--740
               D. H. Bailey and   
                  J. M. Borwein   High-precision numerical integration:
                                  Progress and challenges  . . . . . . . . 741--754
              Danko Adrovic and   
                 Jan Verschelde   Tropical algebraic geometry in Maple: a
                                  preprocessing algorithm for finding
                                  common factors for multivariate
                                  polynomials with approximate
                                  coefficients . . . . . . . . . . . . . . 755--772
                 Gilles Villard   Kaltofen's division-free determinant
                                  algorithm differentiated for matrix
                                  adjoint computation  . . . . . . . . . . 773--790
                Daniel S. Roche   Chunky and equal-spaced polynomial
                                  multiplication . . . . . . . . . . . . . 791--806
            Michael Monagan and   
                   Roman Pearce   Sparse polynomial division using a heap  807--822
       Jean-Guillaume Dumas and   
             Laurent Fousse and   
                    Bruno Salvy   Simultaneous modular reduction and
                                  Kronecker substitution for small finite
                                  fields . . . . . . . . . . . . . . . . . 823--840
                     Xin Li and   
           Marc Moreno Maza and   
             Raqeeb Rasheed and   
             Éric Schost   The \tt modpn library: Bringing fast
                                  polynomial arithmetic into Maple . . . . 841--858
            David R. Stoutemyer   Ten commandments for good default
                                  expression simplification  . . . . . . . 859--887
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 8, August, 2011

           Waldemar Hebisch and   
                   Martin Rubey   Extended rate, more GFUN . . . . . . . . 889--903
                  Ting Zhao and   
              Dongming Wang and   
                      Hoon Hong   Solution formulas for cubic equations
                                  without or with constraints  . . . . . . 904--918
          Ioannis Z. Emiris and   
               Christos Konaxis   Single-lifting Macaulay-type formulae of
                                  generalized unmixed sparse resultants    919--942
            Wouter Castryck and   
           Frederik Vercauteren   Toric forms of elliptic curves and their
                                  arithmetic . . . . . . . . . . . . . . . 943--966
             Luis Felipe Tabera   Optimal affine reparametrization of
                                  rational curves  . . . . . . . . . . . . 967--976
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 9, September, 2011

                 Sonia L. Rueda   A perturbed differential resultant based
                                  implicitization algorithm for linear
                                  DPPEs  . . . . . . . . . . . . . . . . . 977--996
             Mahjoub Langar and   
              Mohamed Mejri and   
                      Kamel Adi   Formal enforcement of security policies
                                  on concurrent systems  . . . . . . . . . 997--1016
               Alberto Arri and   
                     John Perry   The F5 criterion revised . . . . . . . . 1017--1029
           J. Rafael Sendra and   
                  David Sevilla   Radical parametrizations of algebraic
                                  curves by adjoint curves . . . . . . . . 1030--1038
                Mari Castle and   
            Victoria Powers and   
                  Bruce Reznick   Pólya's Theorem with zeros  . . . . . . . 1039--1048
                 J. F. Pommaret   Macaulay inverse systems revisited . . . 1049--1069
           Francesca Cioffi and   
             Margherita Roggero   Flat families by strongly stable ideals
                                  and a generalization of Gröbner bases . . 1070--1084
                Bruno Salvy and   
              Bob Sedgewick and   
              Michele Soria and   
       Wojciech Szpankowski and   
                Brigitte Vallee   Obituary. Philippe Flajolet  . . . . . . 1085--1086
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 10, October, 2011

           Stefano Maggiolo and   
                  Nicola Pagani   Generating stable modular graphs . . . . 1087--1097
               Sebastian Jambor   Computing minimal associated primes in
                                  polynomial rings over the integers . . . 1098--1104
                Jesse Beder and   
           Jason McCullough and   
Luis Núñez-Betancourt and   
        Alexandra Seceleanu and   
                 Bart Snapp and   
                  Branden Stone   Ideals with larger projective dimension
                                  and regularity . . . . . . . . . . . . . 1105--1113
               L. D'Alfonso and   
                G. Jeronimo and   
                F. Ollivier and   
              A. Sedoglavic and   
              P. Solernó   A geometric index reduction method for
                                  implicit systems of differential
                                  algebraic equations  . . . . . . . . . . 1114--1138
                Guillaume Moroz   Properness defects of projection and
                                  minimal discriminant variety . . . . . . 1139--1157
               Taro Kawazoe and   
                  Masayuki Noro   Algorithms for computing a primary ideal
                                  decomposition without producing
                                  intermediate redundant components  . . . 1158--1172
 L. X. Châu Ngô and   
                  Franz Winkler   Rational general solutions of planar
                                  rational systems of autonomous ODEs  . . 1173--1186
     Mahdi Dehghani Darmian and   
               Amir Hashemi and   
                 Antonio Montes   Erratum to ``A new algorithm for
                                  discussing Gröbner bases with
                                  parameters'' [J. Symbolic Comput. \bf 33
                                  (1--2) (2002) 183--208]  . . . . . . . . 1187--1188
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 11, November, 2011

        Viktor Levandovskyy and   
                   Eva Zerz and   
            Kristina Schindelar   Exact linear modeling using Ore algebras 1189--1204
              S. A. Abramov and   
             M. A. Barkatou and   
               M. van Hoeij and   
                   M. Petkovsek   Subanalytic solutions of linear
                                  difference equations and
                                  multidimensional hypergeometric
                                  sequences  . . . . . . . . . . . . . . . 1205--1228
        Rocío Blanco and   
               Santiago Encinas   Embedded desingularization of toric
                                  varieties  . . . . . . . . . . . . . . . 1229--1241
            Mark Giesbrecht and   
                Daniel S. Roche   Detecting lacunary perfect powers and
                                  computing their roots  . . . . . . . . . 1242--1259
   Jesús A. De Loera and   
                    Jon Lee and   
            Peter N. Malkin and   
                Susan Margulies   Computing infeasibility certificates for
                                  combinatorial problems through Hilbert's
                                  Nullstellensatz  . . . . . . . . . . . . 1260--1283
             Adam Strzebo\'nski   Cylindrical decomposition for systems
                                  transcendental in the first variable . . 1284--1290
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 46, Number 12, December, 2011

    François Lemaire and   
           Marc Moreno Maza and   
                    Wei Pan and   
                     Yuzhen Xie   When does $\langle T \rangle$ equal
                                  ${\rm sat}(T)$?  . . . . . . . . . . . . 1291--1305
                Kosaku Nagasaka   Approximate polynomial GCD over integers 1306--1317
               Hiroshi Sekigawa   Computing the nearest polynomial with a
                                  zero in a given domain by using
                                  piecewise rational functions . . . . . . 1318--1335
                    Martin Raum   How to implement a modular form  . . . . 1336--1354
              Douglas Poole and   
                  Willy Hereman   Symbolic computation of conservation
                                  laws for nonlinear partial differential
                                  equations in multiple space dimensions   1355--1377
                Alin Bostan and   
   Muhammad F. I. Chowdhury and   
       Joris van der Hoeven and   
             Éric Schost   Homotopy techniques for multiplication
                                  modulo triangular sets . . . . . . . . . 1378--1402
               Alain Bretto and   
                  Alain Faisant   Cayley graphs and $G$-graphs: Some
                                  applications . . . . . . . . . . . . . . 1403--1412
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 47, Number 1, January, 2012

          Erich L. Kaltofen and   
                     Bin Li and   
             Zhengfeng Yang and   
                     Lihong Zhi   Exact certification in global polynomial
                                  optimization via sums-of-squares of
                                  rational functions with rational
                                  coefficients . . . . . . . . . . . . . . 1--15
             Scott McCallum and   
            Volker Weispfenning   Deciding polynomial-transcendental
                                  problems . . . . . . . . . . . . . . . . 16--31
             Adrien Poteaux and   
                  Marc Rybowicz   Good reduction of Puiseux series and
                                  applications . . . . . . . . . . . . . . 32--63
Henrik Bäärnhielm and   
            C. R. Leedham-Green   The Product Replacement Prospector . . . 64--75
              George Bluman and   
                    Raouf Dridi   New solutions for ordinary differential
                                  equations  . . . . . . . . . . . . . . . 76--88
            Michael C. Harrison   An extension of Kedlaya's algorithm for
                                  hyperelliptic curves . . . . . . . . . . 89--101
  Itnuit Janovitz-Freireich and   
           Bernard Mourrain and   
        Lajos Rónyai and   
Ágnes Szántó   On the computation of matrices of traces
                                  and radicals of ideals . . . . . . . . . 102--122
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 2, February, 2012

                     Joel Moses   Macsyma: a personal history  . . . . . . 123--130
               Michael Burr and   
              Sung Woo Choi and   
              Ben Galehouse and   
                    Chee K. Yap   Complete subdivision algorithms, II:
                                  Isotopic meshing of singular algebraic
                                  curves . . . . . . . . . . . . . . . . . 131--152
            Michael A. Burr and   
                  Felix Krahmer   SqFreeEVAL: an (almost) optimal
                                  real-root isolation algorithm  . . . . . 153--166
                    Jiawang Nie   Discriminants and nonnegative
                                  polynomials  . . . . . . . . . . . . . . 167--191
   Ainhoa Aparicio-Monforte and   
            Jacques-Arthur Weil   A reduced form for linear differential
                                  systems and its application to
                                  integrability of Hamiltonian systems . . 192--213
            Rida T. Farouki and   
                 Takis Sakkalis   A complete classification of quintic
                                  space curves with rational
                                  rotation-minimizing frames . . . . . . . 214--226
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??
                      Anonymous   Publisher's note . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 3, March, 2012

                  Xiaoli Wu and   
                     Lihong Zhi   Determining singular solutions of
                                  polynomial systems via symbolic-numeric
                                  reduction to geometric involutive forms  227--238
             Michael Kerber and   
              Michael Sagraloff   A worst-case bound for topology
                                  computation of algebraic curves  . . . . 239--258
                 Vincent Vatter   Finding regular insertion encodings for
                                  permutation classes  . . . . . . . . . . 259--265
       Jean-Marc Couveignes and   
          Jean-Gabriel Kammerer   The geometry of flex tangents to a cubic
                                  curve and its parameterizations  . . . . 266--281
             Adam Strzebo\'nski   Real root isolation for
                                  $\exp$--$\log$--$\arctan$ functions  . . 282--314
      Andreas-Stephan Elsenhans   Invariants for the computation of
                                  intransitive and transitive Galois
                                  groups . . . . . . . . . . . . . . . . . 315--326
                Juan G. Alcazar   Local shape of generalized offsets to
                                  algebraic curves . . . . . . . . . . . . 327--341
Jon González-Sánchez and   
           Michael Harrison and   
          Irene Polo-Blanco and   
                  Josef Schicho   Algorithms for Del Pezzo surfaces of
                                  degree $5$ (construction,
                                  parametrization) . . . . . . . . . . . . 342--353
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 4, April, 2012

            Mark Giesbrecht and   
                 Daniel Panario   In honour of the research and influence
                                  of Joachim von zur Gathen at 60  . . . . 355--357
                   San Ling and   
        Igor E. Shparlinski and   
              Ron Steinfeld and   
                  Huaxiong Wang   On the modular inversion hidden number
                                  problem  . . . . . . . . . . . . . . . . 358--367
            Pierrick Gaudry and   
             Éric Schost   Genus $2$ point counting over prime
                                  fields . . . . . . . . . . . . . . . . . 368--400
               Thomas Prest and   
                Paul Zimmermann   Non-linear polynomial selection for the
                                  number field sieve . . . . . . . . . . . 401--409
             Mohamed Elkadi and   
       André Galligo and   
                   Thang Luu Ba   Approximate GCD of several univariate
                                  polynomials with small degree
                                  perturbations  . . . . . . . . . . . . . 410--421
                Somit Gupta and   
            Soumojit Sarkar and   
            Arne Storjohann and   
               Johnny Valeriote   Triangular $x$-basis decompositions and
                                  derandomization of linear algebra
                                  algorithms over $K[x]$ . . . . . . . . . 422--453
Martín Avendaño and   
             Ashraf Ibrahim and   
           J. Maurice Rojas and   
                   Korben Rusek   Faster $p$-adic feasibility for certain
                                  multivariate sparse polynomials  . . . . 454--479
           Matthew T. Comer and   
              Erich L. Kaltofen   On the Berlekamp/Massey algorithm and
                                  counting singular Hankel matrices over a
                                  finite field . . . . . . . . . . . . . . 480--491
           Luis H. Gallardo and   
          Olivier Rahavandrainy   All unitary perfect polynomials over
                                  $F_2$ with at most four distinct
                                  irreducible factors  . . . . . . . . . . 492--502
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 5, May, 2012

     Aurélien Greuet and   
                   Feng Guo and   
         Mohab Safey El Din and   
                     Lihong Zhi   Global optimization of polynomials
                                  restricted to a smooth variety using
                                  sums of squares  . . . . . . . . . . . . 503--518
           Torsten Sprenger and   
                  Wolfram Koepf   Algorithmic determination of $q$-power
                                  series for $q$-holonomic functions . . . 519--535
                    John Abbott   Twin-float arithmetic  . . . . . . . . . 536--551
              Nicole Sutherland   Efficient computation of maximal orders
                                  in radical (including Kummer) extensions 552--567
                 Jeaman Ahn and   
                Sijong Kwak and   
                 Yeongseok Song   The degree complexity of smooth surfaces
                                  of codimension $2$ . . . . . . . . . . . 568--581
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 6, June, 2012

              Xiao-Shan Gao and   
                   Deepak Kapur   Preface  . . . . . . . . . . . . . . . . 583--585
              Xiao-Shan Gao and   
                   Deepak Kapur   A brief introduction to Wen-Tsun Wu's
                                  academic career  . . . . . . . . . . . . 586--588
           Bruno Buchberger and   
              Markus Rosenkranz   Transforming problems from analysis to
                                  algebra: a case study in linear boundary
                                  problems . . . . . . . . . . . . . . . . 589--609
               Changbo Chen and   
               Marc Moreno Maza   Algorithms for computing triangular
                                  decomposition of polynomial systems  . . 610--642
         William Y. C. Chen and   
                Qing-Hu Hou and   
                    Yan-Ping Mu   The extended Zeilberger algorithm with
                                  parameters . . . . . . . . . . . . . . . 643--654
              Xiao-Shan Gao and   
                   Zhenyu Huang   Characteristic set algorithms for
                                  equation solving in finite fields  . . . 655--679
             Evelyne Hubert and   
               Marie-Paule Cani   Convolution surfaces based on polygonal
                                  curve skeletons  . . . . . . . . . . . . 680--699
                     Nan Li and   
                     Lihong Zhi   Computing the multiplicity structure of
                                  an isolated singular solution: Case of
                                  breadth one  . . . . . . . . . . . . . . 700--710
                  Ziming Li and   
                         Min Wu   Transforming linear functional systems
                                  into fully integrable systems  . . . . . 711--732
                 Xuhui Wang and   
                     Falai Chen   Implicitization, parameterization and
                                  singularity computation of Steiner
                                  surfaces using moving surfaces . . . . . 733--750
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 7, July, 2012

          Jeremy R. Johnson and   
             Erich Kaltofen and   
                   Hyungju Park   Special Issue on Symbolic and Algebraic
                                  Computation Foundations, Algorithmics
                                  and Applications: ISSAC 2009 . . . . . . 751--751
                 Ana Romero and   
                    Julio Rubio   Computing the homology of groups: the
                                  geometric way  . . . . . . . . . . . . . 752--770
                Luca De Feo and   
             Éric Schost   Fast arithmetics in Artin--Schreier
                                  towers over finite fields  . . . . . . . 771--792
                   Wei Zhou and   
                  George Labahn   Efficient algorithms for order basis
                                  computation  . . . . . . . . . . . . . . 793--819
          Ioannis Z. Emiris and   
           Angelos Mantzaflaris   Multihomogeneous resultant formulae for
                                  systems with scaled support  . . . . . . 820--842
              Jin-San Cheng and   
              Xiao-Shan Gao and   
                     Leilei Guo   Root isolation of zero-dimensional
                                  polynomial systems with linear
                                  univariate representation  . . . . . . . 843--858
           Christopher W. Brown   Fast simplifications for Tarski formulas
                                  based on monomial inequalities . . . . . 859--882
                  Hoon Hong and   
             Mohab Safey El Din   Variant quantifier elimination . . . . . 883--901
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 8, August, 2012

        Daouda Niang Diatta and   
           Bernard Mourrain and   
                 Olivier Ruatta   On the isotopic meshing of an algebraic
                                  implicit surface . . . . . . . . . . . . 903--925
         Martin R. Albrecht and   
                 Carlos Cid and   
     Jean-Charles Faug\`ere and   
                 Ludovic Perret   On the relation between the MXL family
                                  of algorithms and Gröbner basis
                                  algorithms . . . . . . . . . . . . . . . 926--941
               Teresa Krick and   
                   Agnes Szanto   Sylvester's double sums: an inductive
                                  proof of the general case  . . . . . . . 942--953
                   David Harvey   The Karatsuba integer middle product . . 954--967
               Shaoshi Chen and   
                  Manuel Kauers   Trading order for degree in creative
                                  telescoping  . . . . . . . . . . . . . . 968--995
          Mordechai Katzman and   
                   Karl Schwede   An algorithm for computing compatibly
                                  Frobenius split subvarieties . . . . . . 996--1008
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 9, September, 2012

            Nicolas Peltier and   
   Viorica Sofronie-Stokkermans   First-order theorem proving: Foreword    1009--1010
          Peter Baumgartner and   
          Björn Pelzer and   
                 Cesare Tinelli   Model Evolution with equality ---
                                  Revised and implemented  . . . . . . . . 1011--1045
    Christian Mahesh Hansen and   
             Roger Antonsen and   
               Martin Giese and   
                   Arild Waaler   Incremental variable splitting . . . . . 1046--1065
                  Silvio Ranise   On the verification of security-aware
                                  E-services . . . . . . . . . . . . . . . 1066--1088
             Christoph Wernhard   Projection and scope-determined
                                  circumscription  . . . . . . . . . . . . 1089--1108
              Claus-Peter Wirth   $\lim+$, $\delta^+$, and
                                  Non-Permutability of $\beta$-Steps . . . 1109--1135
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 10, October, 2012

        Viktor Levandovskyy and   
                Dusan Pagon and   
            Marko Petkovsek and   
              Valery Romanovski   Foreword from the Editors  . . . . . . . 1137--1139
              Douglas S. Shafer   Symbolic computation and the cyclicity
                                  problem for singularities  . . . . . . . 1140--1153
                 Zhiheng Yu and   
                    Lu Yang and   
                  Weinian Zhang   Discussion on polynomials having
                                  polynomial iterative roots . . . . . . . 1154--1162
                  Maoan Han and   
           Valery G. Romanovski   Isochronicity and normal forms of
                                  polynomial systems of ODEs . . . . . . . 1163--1174
               Mikhail Klin and   
                Josef Lauri and   
                   Matan Ziv-Av   Links between two semisymmetric graphs
                                  on $112$ vertices via association
                                  schemes  . . . . . . . . . . . . . . . . 1175--1191
             Thomas Cluzeau and   
                  Alban Quadrat   Serre's reduction of linear partial
                                  differential systems with holonomic
                                  adjoints . . . . . . . . . . . . . . . . 1192--1213
        Viktor Levandovskyy and   
            Kristina Schindelar   Fraction-free algorithm for the
                                  computation of diagonal forms matrices
                                  over Ore domains using Gröbner bases  . . 1214--1232
        Thomas Bächler and   
             Vladimir Gerdt and   
     Markus Lange-Hegermann and   
                 Daniel Robertz   Algorithmic Thomas decomposition of
                                  algebraic and differential systems . . . 1233--1266
     Johannes Blümlein and   
            Sebastian Klein and   
          Carsten Schneider and   
                    Flavia Stan   A symbolic summation approach to Feynman
                                  integral calculus  . . . . . . . . . . . 1267--1289
                Clemens G. Raab   Using Gröbner bases for finding the
                                  logarithmic part of the integral of
                                  transcendental functions . . . . . . . . 1290--1296
         Giandomenico Boffi and   
               Alessandro Logar   Computing Gröbner bases of pure binomial
                                  ideals via submodules of $Z^n$ . . . . . 1297--1308
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 11, November, 2012

               Graham Ellis and   
                   Le Van Luyen   Computational homology of $n$-types  . . 1309--1317
            Jordi Gu\`ardia and   
                 Enric Nart and   
                Sebastian Pauli   Single-factor lifting and factorization
                                  of polynomials over local fields . . . . 1318--1346
           M. Foupouagnigni and   
                   W. Koepf and   
             D. D. Tcheutia and   
             P. Njionou Sadjang   Representations of $q$-orthogonal
                                  polynomials  . . . . . . . . . . . . . . 1347--1371
          George E. Collins and   
                Werner Krandick   On the computing time of the continued
                                  fractions method . . . . . . . . . . . . 1372--1412
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??

Journal of Symbolic Computation
Volume 47, Number 12, December, 2012

     Nikolaj Bjòrner and   
            Laura Kovács   Foreword . . . . . . . . . . . . . . . . 1413--1415
     Thomas Martin Gawlitza and   
               Helmut Seidl and   
  Assalé Adjé and   
    Stéphane Gaubert and   
           Éric Goubault   Abstract interpretation meets convex
                                  optimization . . . . . . . . . . . . . . 1416--1446
    Stéphane Gaubert and   
            Ricardo D. Katz and   
                 Sergei Sergeev   Tropical linear-fractional programming
                                  and parametric mean payoff games . . . . 1447--1478
           Olivier Bouissou and   
          Yassamine Seladji and   
            Alexandre Chapoutot   Acceleration of the abstract fixpoint
                                  computation in numerical program
                                  analysis . . . . . . . . . . . . . . . . 1479--1511
            Peter Schrammel and   
               Bertrand Jeannet   Applying abstract acceleration to
                                  (co-)reachability analysis of reactive
                                  programs . . . . . . . . . . . . . . . . 1512--1532
             Gianluca Amato and   
            Maurizio Parton and   
             Francesca Scozzari   Discovering invariants via simple
                                  component analysis . . . . . . . . . . . 1533--1560
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 48, Number ??, January, 2013

         Lamia Labed Jilani and   
                Olfa Mraihi and   
              Asma Louhichi and   
           Wided Ghardallou and   
              Khaled Bsaies and   
                       Ali Mili   Invariant functions and invariant
                                  relations: an alternative to invariant
                                  assertions . . . . . . . . . . . . . . . 1--36
       Michael Brickenstein and   
               Alexander Dreyer   Gröbner-free normal forms for Boolean
                                  polynomials  . . . . . . . . . . . . . . 37--53
        J. I. Farrán and   
                 C. Munuera and   
               G. Tizziotti and   
                      F. Torres   Gröbner basis for norm-trace codes  . . . 54--63
             Michael Bogner and   
                  Stefan Reiter   On symplectically rigid local systems of
                                  rank four and Calabi--Yau operators  . . 64--100
                  Simon A. King   Minimal generating sets of non-modular
                                  invariant rings of finite groups . . . . 101--109
           Roberto La Scala and   
            Viktor Levandovskyy   Skew polynomial rings, Gröbner bases and
                                  the letterplace embedding of the free
                                  associative algebra  . . . . . . . . . . 110--131
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 49, Number ??, February, 2013

              Wolfram Koepf and   
                Stephen M. Watt   Guest Editors' foreword  . . . . . . . . 1--2
               Changbo Chen and   
         James H. Davenport and   
                John P. May and   
           Marc Moreno Maza and   
                  Bican Xia and   
                      Rong Xiao   Triangular decomposition of
                                  semi-algebraic systems . . . . . . . . . 3--26
               Deepak Kapur and   
                    Yao Sun and   
                  Dingkang Wang   An efficient algorithm for computing a
                                  comprehensive Gröbner system of a
                                  parametric polynomial system . . . . . . 27--44
         Moulay A. Barkatou and   
            Carole El Bacha and   
              George Labahn and   
           Eckhard Pflügel   On simultaneous row and column reduction
                                  of higher-order linear differential
                                  systems  . . . . . . . . . . . . . . . . 45--64
              S. A. Abramov and   
                 A. A. Ryabenko   Linear $q$-difference equations
                                  depending on a parameter . . . . . . . . 65--77
              Ernst W. Mayr and   
               Stephan Ritscher   Dimension-dependent bounds for Gröbner
                                  bases of polynomial ideals . . . . . . . 78--94
                  S. Linton and   
                 K. Hammond and   
               A. Konovalov and   
                   C. Brown and   
              P. W. Trinder and   
               H. -W. Loidl and   
                    P. Horn and   
                   D. Roozemond   Easy composition of symbolic computation
                                  software using SCSCP: a new Lingua
                                  Franca for symbolic computation  . . . . 95--119
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 50, Number ??, March, 2013

                 Toshinori Oaku   Algorithms for integrals of holonomic
                                  functions over domains defined by
                                  polynomial inequalities  . . . . . . . . 1--27
                    Ming Xu and   
                     Zhi-Bin Li   Symbolic termination analysis of
                                  solvable loops . . . . . . . . . . . . . 28--49
                    R. Gray and   
                A. Malheiro and   
                    S. J. Pride   Homotopy bases and finite derivation
                                  type for Schützenberger groups of monoids 50--78
              B. Paláncz   Application of Dixon resultant to
                                  satellite trajectory control by pole
                                  placement  . . . . . . . . . . . . . . . 79--99
              A. S. Detinko and   
             D. L. Flannery and   
                  E. A. O'Brien   Recognizing finite matrix groups over
                                  infinite fields  . . . . . . . . . . . . 100--109
             Adrien Poteaux and   
             Éric Schost   On the complexity of computing with
                                  zero-dimensional triangular sets . . . . 110--138
              Marcus Bishop and   
        J. Matthew Douglass and   
         Götz Pfeiffer and   
            Gerhard Röhrle   Computations for Coxeter arrangements
                                  and Solomon's descent algebra: Groups of
                                  rank three and four  . . . . . . . . . . 139--158
               Thomas Peter and   
             Gerlind Plonka and   
                  Daniela Rosca   Representation of sparse Legendre
                                  expansions . . . . . . . . . . . . . . . 159--169
   Bjarke Hammersholt Roune and   
Eduardo Sáenz-de-Cabezón   Complexity and algorithms for Euler
                                  characteristic of simplicial complexes   170--196
                 C. Cadavid and   
                  S. Molina and   
             J. D. Vélez   Limits of quotients of bivariate real
                                  analytic functions . . . . . . . . . . . 197--207
 Marie-Françoise Roy and   
        Sidi Mohamed Sedjelmaci   New fast Euclidean algorithms  . . . . . 208--226
       Joris van der Hoeven and   
         Grégoire Lecerf   On the bit-complexity of sparse
                                  polynomial and series multiplication . . 227--254
                 E. Ballico and   
                    M. Elia and   
                        M. Sala   On the evaluation of multivariate
                                  polynomials over finite fields . . . . . 255--262
           Cristina Bertone and   
           Francesca Cioffi and   
                Paolo Lella and   
             Margherita Roggero   Upgraded methods for the effective
                                  computation of marked schemes on a
                                  strongly stable ideal  . . . . . . . . . 263--290
        Alessandra Bernardi and   
              Kristian Ranestad   On the cactus rank of cubics forms . . . 291--297
               Alexander Hulpke   Computing generators of groups
                                  preserving a bilinear form over residue
                                  class rings  . . . . . . . . . . . . . . 298--307
               Abramo Hefez and   
    Marcelo Escudeiro Hernandes   Algorithms for the implementation of the
                                  analytic classification of plane
                                  branches . . . . . . . . . . . . . . . . 308--313
      Christopher J. Hillar and   
Abraham Martín del Campo   Finiteness theorems and algorithms for
                                  permutation invariant chains of Laurent
                                  lattice ideals . . . . . . . . . . . . . 314--334
                  Dan Roozemond   Computing split maximal toral
                                  subalgebras of Lie algebras over fields
                                  of small characteristic  . . . . . . . . 335--349
        Hülya Kadioglu and   
                 Tracy L. Payne   Computational methods for nilsoliton
                                  metric Lie algebras I  . . . . . . . . . 350--373
                  Ivan Soprunov   Toric complete intersection codes  . . . 374--385
              Shengchao Qin and   
                 Guanhua He and   
              Chenguang Luo and   
              Wei-Ngan Chin and   
                       Xin Chen   Loop invariant synthesis in a combined
                                  abstract domain  . . . . . . . . . . . . 386--408
         Joachim von zur Gathen   Lower bounds for decomposable univariate
                                  wild polynomials . . . . . . . . . . . . 409--430
                   Meng Jin and   
               Xiaoliang Li and   
                  Dongming Wang   A new algorithmic scheme for computing
                                  characteristic sets  . . . . . . . . . . 431--449
             Luis Felipe Tabera   Computing hypercircles by moving
                                  hyperplanes  . . . . . . . . . . . . . . 450--464
            Primoz Potocnik and   
                Pablo Spiga and   
                 Gabriel Verret   Cubic vertex-transitive graphs on up to
                                  1280 vertices  . . . . . . . . . . . . . 465--477
                   Jason Morton   Relations among conditional
                                  probabilities  . . . . . . . . . . . . . 478--492
            Daniel J. Bates and   
               David Eklund and   
                 Chris Peterson   Computing intersection numbers of Chern
                                  classes  . . . . . . . . . . . . . . . . 493--507
               Shenglong Hu and   
            Zheng-Hai Huang and   
                  Chen Ling and   
                       Liqun Qi   On determinants and eigenvalue theory of
                                  tensors  . . . . . . . . . . . . . . . . 508--531
                    John Abbott   Bounds on factors in $\mathbb{Z}[x]$ . . 532--563
           Bernard Mourrain and   
               Nelly Villamizar   Homological techniques for the analysis
                                  of the dimension of triangular spline
                                  spaces . . . . . . . . . . . . . . . . . 564--577
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 51, Number ??, April, 2013

         Alicia Dickenstein and   
            Sandra Di Rocco and   
             Evelyne Hubert and   
                  Josef Schicho   Foreword from the Editors  . . . . . . . 1--2
               Michael Harrison   Explicit solution by radicals, gonal
                                  maps and plane models of algebraic
                                  curves of genus $5$ or $6$ . . . . . . . 3--21
          Nathan Owen Ilten and   
                   Lars Kastner   Calculating generators of multigraded
                                  algebras . . . . . . . . . . . . . . . . 22--33
María Isabel Herrero and   
          Gabriela Jeronimo and   
                     Juan Sabia   Affine solution sets of sparse
                                  polynomial systems . . . . . . . . . . . 34--54
                Gavin Brown and   
          Alexander M. Kasprzyk   Small polygons and toric codes . . . . . 55--62
      Jean-Bernard Lasserre and   
            Monique Laurent and   
           Bernard Mourrain and   
          Philipp Rostalski and   
      Philippe Trébuchet   Moment matrices, border bases and real
                                  radical computation  . . . . . . . . . . 63--85
           Felipe Rincón   Computing tropical linear spaces . . . . 86--98
            Janko Böhm and   
             Wolfram Decker and   
          Santiago Laplagne and   
            Gerhard Pfister and   
     Andreas Steenpaß and   
                 Stefan Steidel   Parallel algorithms for normalization    99--114
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 52, Number ??, May, 2013

          Ioannis Z. Emiris and   
             Éric Schost   Special issue on symbolic and algebraic
                                  computation: Foundations, algorithmics
                                  and applications: ISSAC 2011 . . . . . . 1--2
          Luiz Emilio Allem and   
                Shuhong Gao and   
                Vilmar Trevisan   Extracting sparse factors from
                                  multivariate integral polynomials  . . . 3--16
             Mark van Hoeij and   
   Jürgen Klüners and   
                 Andrew Novocin   Generating subfields . . . . . . . . . . 17--34
           André Galligo   Deformation of roots of polynomials via
                                  fractional derivatives . . . . . . . . . 35--50
                A. Bernardi and   
                 J. Brachat and   
                   P. Comon and   
                    B. Mourrain   General tensor decomposition, moment
                                  matrices and applications  . . . . . . . 51--71
               Changbo Chen and   
         James H. Davenport and   
           Marc Moreno Maza and   
                  Bican Xia and   
                      Rong Xiao   Computing with semi-algebraic sets:
                                  Relaxation techniques and effective
                                  boundaries . . . . . . . . . . . . . . . 72--96
                     Li Guo and   
             William Y. Sit and   
                  Ronghua Zhang   Differential type operators and
                                  Gröbner--Shirshov bases . . . . . . . . . 97--123
               Deepak Kapur and   
                    Yao Sun and   
                  Dingkang Wang   An efficient method for computing
                                  comprehensive Gröbner bases . . . . . . . 124--142
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 53, Number ??, June, 2013

                Xiaoran Shi and   
               Xiaohong Jia and   
                    Ron Goldman   Using a bihomogeneous resultant to find
                                  the singularities of rational space
                                  curves . . . . . . . . . . . . . . . . . 1--25
              Nicole Sutherland   Efficient computation of maximal orders
                                  in Artin--Schreier extensions  . . . . . 26--39
                       Ye Liang   Selecting lengths of floats for the
                                  computation of approximate Gröbner bases  40--52
Enrique González-Jiménez and   
         José M. Tornero   Markoff--Rosenberger triples in
                                  arithmetic progression . . . . . . . . . 53--63
           André Galligo   Budan tables of real univariate
                                  polynomials  . . . . . . . . . . . . . . 64--80
                       Ye Liang   Structures of precision losses in
                                  computing approximate Gröbner bases . . . 81--95
           M. Foupouagnigni and   
                   W. Koepf and   
                 D. D. Tcheutia   Connection and linearization
                                  coefficients of the Askey--Wilson
                                  polynomials  . . . . . . . . . . . . . . 96--118
           Cristina Bertone and   
                Paolo Lella and   
             Margherita Roggero   A Borel open cover of the Hilbert scheme 119--135
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 54, Number ??, July, 2013

            John Ballantyne and   
                   Peter Rowley   A note on computing involution
                                  centralizers . . . . . . . . . . . . . . 1--8
                Luke Oeding and   
              Giorgio Ottaviani   Eigenvectors of tensors and algorithms
                                  for Waring decomposition . . . . . . . . 9--35
         Moulay A. Barkatou and   
                Carole El Bacha   On $k$-simple forms of first-order
                                  linear differential systems and their
                                  computation  . . . . . . . . . . . . . . 36--58
                Becky Eide Hall   Computing homology using generalized
                                  Gröbner bases . . . . . . . . . . . . . . 59--71
                 Stefan Steidel   Gröbner bases of symmetric ideals . . . . 72--86
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 55, Number ??, August, 2013

         Ryutaroh Matsumoto and   
                Diego Ruano and   
                      Olav Geil   Generalization of the Lee--O'Sullivan
                                  list decoding for one-point AG codes . . 1--9
                Feza Arslan and   
            Neslihan Sipahi and   
                      Nil Sahin   Monomial curve families supporting
                                  Rossi's conjecture . . . . . . . . . . . 10--18
           Christian Dönch   Characterization of relative Gröbner
                                  bases  . . . . . . . . . . . . . . . . . 19--29
     Jean-Charles Faug\`ere and   
         Mohab Safey El Din and   
       Pierre-Jean Spaenlehauer   On the complexity of the generalized
                                  MinRank problem  . . . . . . . . . . . . 30--58
    Andreas Arvanitoyeorgos and   
          Ioannis Chrysikos and   
                  Yusuke Sakane   Proving isometry for homogeneous
                                  Einstein metrics on flag manifolds by
                                  symbolic computation . . . . . . . . . . 59--71
                  Y. P. Liu and   
                 S. J. Liao and   
                       Z. B. Li   Symbolic computation of strongly
                                  nonlinear periodic oscillations  . . . . 72--95
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 56, Number ??, September, 2013

                Roger Oyono and   
       Nicolas Thériault   Group arithmetic in $ C_{3, 5} $ curves  1--26
             Heiko Dietrich and   
               Paolo Faccin and   
             Willem A. de Graaf   Computing with real Lie algebras: Real
                                  forms, Cartan decompositions, and Cartan
                                  subalgebras  . . . . . . . . . . . . . . 27--45
    Claude-Pierre Jeannerod and   
      Clément Pernet and   
                Arne Storjohann   Rank-profile revealing Gaussian
                                  elimination and the CUP matrix
                                  decomposition  . . . . . . . . . . . . . 46--68
              Hartwig Bosse and   
     Christine Gärtner and   
                Oleg Golubitsky   Ideal-specific elimination orders form a
                                  star-shaped region . . . . . . . . . . . 69--79
             Sonia L. Rueda and   
               Juana Sendra and   
               J. Rafael Sendra   An algorithm to parametrize
                                  approximately space curves . . . . . . . 80--106
                Maria Michalska   Curves testing boundedness of
                                  polynomials on subsets of the real plane 107--124
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 57, Number ??, October, 2013

                      T. Shaska   Computational algebraic geometry . . . . 1--2
                   H. Lange and   
                 P. E. Newstead   Bundles of rank $3$ on curves of
                                  Clifford index $3$ . . . . . . . . . . . 3--18
               Gene Freudenburg   Foundations of invariant theory for the
                                  down operator  . . . . . . . . . . . . . 19--47
            Daniel Plaumann and   
                Cynthia Vinzant   Determinantal representations of
                                  hyperbolic plane curves: an elementary
                                  approach . . . . . . . . . . . . . . . . 48--60
          Gabriel Bartolini and   
           Antonio F. Costa and   
             Milagros Izquierdo   On automorphisms groups of cyclic
                                  $p$-gonal Riemann surfaces . . . . . . . 61--69
                Amod Agashe and   
                   Randy Heaton   Computing intersection numbers between
                                  abelian varieties associated to
                                  subspaces of modular forms . . . . . . . 70--77
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 58, Number ??, November, 2013

            Rida T. Farouki and   
            Petroula Dospra and   
                 Takis Sakkalis   Scalar-vector algorithm for the roots of
                                  quadratic quaternion polynomials, and
                                  the characterization of quintic rational
                                  rotation-minimizing frame curves . . . . 1--17
              Jin-San Cheng and   
                    Kai Jin and   
                  Daniel Lazard   Certified rational parametric
                                  approximation of real algebraic space
                                  curves with local generic position
                                  method . . . . . . . . . . . . . . . . . 18--40
                 Zhikun She and   
                 Haoyang Li and   
                    Bai Xue and   
              Zhiming Zheng and   
                      Bican Xia   Discovering polynomial Lyapunov
                                  functions for continuous dynamical
                                  systems  . . . . . . . . . . . . . . . . 41--63
           Maximilian Jaroschek   Improved polynomial remainder sequences
                                  for Ore polynomials  . . . . . . . . . . 64--76
                 Martin Weimann   Factoring bivariate polynomials using
                                  adjoints . . . . . . . . . . . . . . . . 77--98
            Rida T. Farouki and   
                 Takis Sakkalis   Corrigendum to ``Rational
                                  rotation-minimizing frames on polynomial
                                  space curves of arbitrary degree'' [J.
                                  Symbolic Comput. \bf 45(8) (2010)
                                  844--856]  . . . . . . . . . . . . . . . 99--102
J. I. García-García and   
  M. A. Moreno-Frías and   
            A. Vigneron-Tenorio   On decomposable semigroups and
                                  applications . . . . . . . . . . . . . . 103--116
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 59, Number ??, December, 2013

          Vladimir P. Gerdt and   
               Amir Hashemi and   
          Benyamin M. -Alizadeh   Involutive bases algorithm incorporating
                                  $ F_5 $ criterion  . . . . . . . . . . . 1--20
                 Christian Eder   An analysis of inhomogeneous
                                  signature-based Gröbner basis
                                  computations . . . . . . . . . . . . . . 21--35
               David Gruber and   
               Martin Peternell   Conchoid surfaces of quadrics  . . . . . 36--53
           Joris van der Hoeven   Guessing singular dependencies . . . . . 54--80
                   Harm Derksen   The Graph Isomorphism Problem and
                                  approximate categories . . . . . . . . . 81--112
            Raoul Blankertz and   
     Joachim von zur Gathen and   
             Konstantin Ziegler   Compositions and collisions at degree $
                                  p^2 $  . . . . . . . . . . . . . . . . . 113--145
                      Anonymous   Editorial Board  . . . . . . . . . . . . ??


Journal of Symbolic Computation
Volume 60, Number ??, January, 2014

                 Sara Madariaga   Gröbner--Shirshov bases for the
                                  non-symmetric operands of dendriform
                                  algebras and quadri-algebras . . . . . . 1--14
              O. Shkaravska and   
                 M. van Eekelen   Univariate polynomial solutions of
                                  algebraic difference equations . . . . . 15--28
          Mordechai Katzman and   
                 Wenliang Zhang   Annihilators of Artinian modules
                                  compatible with a Frobenius map  . . . . 29--46
           Delphine Boucher and   
                    Felix Ulmer   Self-dual skew codes and factorization
                                  of skew polynomials  . . . . . . . . . . 47--61
                    Yongjae Cha   Closed form solutions of linear
                                  difference equations in terms of
                                  symmetric products . . . . . . . . . . . 62--77
               Junaid Alam Khan   Converting subalgebra bases with the
                                  Sagbi walk . . . . . . . . . . . . . . . 78--93
           Brendan D. McKay and   
                 Adolfo Piperno   Practical graph isomorphism, II  . . . . 94--112
                   David Harvey   Faster arithmetic for number-theoretic
                                  transforms . . . . . . . . . . . . . . . 113--119
            David H. Bailey and   
        Jonathan M. Borwein and   
            Alexander D. Kaiser   Automated simplification of large
                                  symbolic expressions . . . . . . . . . . 120--136


Journal of Symbolic Computation
Volume 61--62, Number ??, 2013

        Joaquim Infante Barbosa   Symbolic computation in applied
                                  computational mechanics  . . . . . . . . 1--2
                 C. M. C. Roque   Symbolic and numerical analysis of
                                  plates in bending using Matlab . . . . . 3--11
                  M. A. R. Loja   On the use of particle swarm
                                  optimization to maximize bending
                                  stiffness of functionally graded
                                  structures . . . . . . . . . . . . . . . 12--30
               H. Policarpo and   
                M. M. Neves and   
                  N. M. M. Maia   On a hybrid analytical-experimental
                                  technique to assess the storage modulus
                                  of resilient materials using symbolic
                                  computation  . . . . . . . . . . . . . . 31--52
       Miguel Belbut Gaspar and   
        Nelson Martins-Ferreira   A procedure for computing the symmetric
                                  difference of regions defined by
                                  polygonal curves . . . . . . . . . . . . 53--65
José Luis Galán-García and   
   Gabriel Aguilera-Venegas and   
  Pedro Rodríguez-Cielos   Technology integration into mathematics
                                  education and applications . . . . . . . 66--69
      Alfonsa García and   
    Francisco García and   
Ángel Martín del Rey and   
   Gerardo Rodríguez and   
     Agustín de la Villa   Changing assessment methods: New rules,
                                  new roles  . . . . . . . . . . . . . . . 70--84
          Djordje M. Kadijevich   Neglected critical issues of effective
                                  CAS utilization  . . . . . . . . . . . . 85--99
                     Rein Prank   A tool for evaluating solution economy
                                  of algebraic transformations . . . . . . 100--115
              S. V. Joubert and   
             M. Y. Shatalov and   
                  C. E. Coetzee   Using Fourier series to analyse mass
                                  imperfections in vibratory gyroscopes    116--127


Journal of Symbolic Computation
Volume 63, Number ??, May, 2014

          Veronika Pillwein and   
                  Stefan Takacs   A local Fourier convergence analysis of
                                  a multigrid method using symbolic
                                  computation  . . . . . . . . . . . . . . 1--20
               Li-Yong Shen and   
 Sonia Pérez-Díaz   Characterization of rational ruled
                                  surfaces . . . . . . . . . . . . . . . . 21--45
          Nicolette Meshkat and   
                 Seth Sullivant   Identifiable reparametrizations of
                                  linear compartment models  . . . . . . . 46--67
           Patrick Dehornoy and   
                Volker Gebhardt   Algorithms for Garside calculus  . . . . 68--116


Journal of Symbolic Computation
Volume 64, Number ??, August, 2014

     Jean-Charles Faug\`ere and   
Domingo Gómez-Pérez and   
            Jaime Gutierrez and   
                 Ludovic Perret   Mathematical and computer algebra
                                  techniques in cryptology . . . . . . . . 1--2
              Felix Fontein and   
                   Pawel Wocjan   On the probability of generating a
                                  lattice  . . . . . . . . . . . . . . . . 3--15
            Jaime Gutierrez and   
         Álvar Ibeas and   
                   Antoine Joux   Recovering a sum of two squares
                                  decomposition  . . . . . . . . . . . . . 16--21
             Srinivas Vivek and   
            C. E. Veni Madhavan   Cubic Sieve Congruence of the Discrete
                                  Logarithm Problem, and fractional part
                                  sequences  . . . . . . . . . . . . . . . 22--34
            Igor E. Shparlinski   Products with variables from
                                  low-dimensional affine spaces and
                                  shifted power identity testing in finite
                                  fields . . . . . . . . . . . . . . . . . 35--41
                 Arne Winterhof   Generalizations of complete mappings of
                                  finite fields and some applications  . . 42--52
                 Alev Topuzoglu   The Carlitz rank of permutations of
                                  finite fields: a survey  . . . . . . . . 53--66
Irene Márquez-Corbella and   
 Edgar Martínez-Moro and   
             Ruud Pellikaan and   
                    Diego Ruano   Computational aspects of retrieving a
                                  representation of an algebraic geometry
                                  code . . . . . . . . . . . . . . . . . . 67--87


Journal of Symbolic Computation
Volume 65, Number ??, November, 2014

              Maria Francis and   
             Ambedkar Dukkipati   Reduced Gröbner bases and
                                  Macaulay--Buchberger Basis Theorem over
                                  Noetherian rings . . . . . . . . . . . . 1--14
      Hiram H. López and   
           Rafael H. Villarreal   Computing the degree of a lattice ideal
                                  of dimension one . . . . . . . . . . . . 15--28
                   Niels Lubbes   Minimal families of curves on surfaces   29--48
              Walid Belkhir and   
            Alain Giorgetti and   
                Michel Lenczner   A symbolic transformation language and
                                  its application to a multiscale method   49--78
              Michael Sagraloff   On the complexity of the Descartes
                                  method when using approximate arithmetic 79--110
                  Simon A. King   A non-commutative $ F_5 $ algorithm with
                                  an application to the computation of
                                  Loewy layers . . . . . . . . . . . . . . 111--129


Journal of Symbolic Computation
Volume 66, Number ??, January / February, 2015

                 Adrian Popescu   An algorithm to compute the Hilbert
                                  depth  . . . . . . . . . . . . . . . . . 1--7
            Jens-Dietrich Bauch   Genus computation of global function
                                  fields . . . . . . . . . . . . . . . . . 8--20
              Manuel Kauers and   
                       Lily Yen   On the length of integers in telescopers
                                  for proper hypergeometric terms  . . . . 21--33
              Kurt Mehlhorn and   
          Michael Sagraloff and   
                  Pengming Wang   From approximate factorization to root
                                  isolation with application to
                                  cylindrical algebraic decomposition  . . 34--69
               S. Margulies and   
                     S. Onn and   
                D. V. Pasechnik   On the complexity of Hilbert refutations
                                  for partition  . . . . . . . . . . . . . 70--83
                   Lei Feng and   
                   Weiping Wang   An algorithm for computing mixed sums of
                                  products of Bernoulli polynomials and
                                  Euler polynomials  . . . . . . . . . . . 84--97
             A. A. Kytmanov and   
             A. M. Kytmanov and   
                 E. K. Myshkina   Finding residue integrals for systems of
                                  non-algebraic equations in $ C^n $ . . . 98--110
                  G. Hanrot and   
                  P. Zimmermann   Corrigendum to ``A long note on Mulders'
                                  short product'' [J. Symb. Comput. \bf 37
                                  (3) (2004) 391--401] . . . . . . . . . . 111--112
                      Anonymous   Editorial Board  . . . . . . . . . . . . IFC


Journal of Symbolic Computation
Volume 67, Number ??, March / April, 2015

            Jeremiah W. Johnson   Weight ideals associated to regular and
                                  log-linear arrays  . . . . . . . . . . . 1--15
              Robert Milson and   
             Francis Valiquette   Point equivalence of second-order ODEs:
                                  Maximal invariant classification order   16--41
               David Lubicz and   
                  Damien Robert   A generalisation of Miller's algorithm
                                  and applications to pairing computations
                                  on abelian varieties . . . . . . . . . . 68--92
                  I. Durand and   
          G. Sénizergues   Bottom-up rewriting for words and terms  93--121
                      Anonymous   Editorial Board  . . . . . . . . . . . . IFC