Journal of Symbolic Computation, Volume 33, 2002

Volume 33, Number 1, January 2002

• Christian Bauer, Alexander Frink, Richard Kreckel:
  Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language. 1-12
  
• Eng-Wee Chionh, Ming Zhang, Ronald N. Goldman:
  Fast Computation of the Bezout and Dixon Resultant Matrices. 13-29
  
• Willem A. de Graaf, 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ß, 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
  

Volume 33, Number 2, February 2002

• Bettina Eick, Charles R. B. Wright:
  Computing Subgroups by Exhibition in Finite Solvable Groups. 129-143
  
• Steve Linton, G. Pfeiffer, Edmund F. Robertson, Nikola Ruskuc:
  Computing Transformation Semigroups. 145-162
  
• Jonas Månsson, 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
  

Volume 33, Number 3, March 2002

• Murray R. Bremner, Irvin Roy Hentzel:
  Identities for the Associator in Alternative Algebras. 255-273
  
• Karin Gatermann, 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
  
• Scott McCallum, George E. Collins:
  Local Box Adjacency Algorithms for Cylindrical Algebraic Decompositions. 321-342
  

• P. P. Boyle, W. Tian, Fred Guan:
  The Riccati Equation in Mathematical Finance. 343-355
  
• Noel G. Lloyd, Jane M. Pearson:
  Symmetry in Planar Dynamical Systems. 357-366
  
• Thomas Wolf:
  Size Reduction and Partial Decoupling of Systems of Equations. 367-383
  

Volume 33, Number 4, April 2002

• George E. Collins:
  A Fast Euclidean Algorithm for Gaussian Integers. 385-392
  
• Ioannis Z. Emiris, Victor Y. Pan:
  Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant Matrices. 393-413
  
• Farshid Hajir, Christian Maire:
  Tamely Ramified Towers and Discriminant Bounds for Number Fields-II. 415-423
  
• Florian Hess:
  Computing Riemann-Roch Spaces in Algebraic Function Fields and Related Topics. 425-445
  
• Hoon Hong, Manfred Minimair:
  Sparse Resultant of Composed Polynomials IMixed-. Unmixed Case. 447-465
  
• Manfred Minimair:
  Sparse Resultant of Composed Polynomials II. Unmixed-Mixed Case. 467-478
  
• Dimitrios Poulakis, 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, Haibao Duan:
  A Mathematica Program for the Degrees of Certain Schubert Varieties. 507-517
  

Volume 33, Number 5, May 2002

• Gilles Villard:
  Preface. 519
  
• Sergei A. Abramov, Marko Petkovsek:
  Rational Normal Forms and Minimal Decompositions of Hypergeometric Terms. 521-543
  
• Jaime Gutierrez, Rosario Rubio, David Sevilla:
  On Multivariate Rational Function Decomposition. 545-562
  
• Gene Cooperman, Victor Grinberg:
  Scalable Parallel Coset Enumeration: Bulk Definition and the Memory Wall. 563-585
  
• Carlos D'Andrea, Ioannis Z. Emiris:
  Hybrid Sparse Resultant Matrices for Bivariate Polynomials. 587-608
  
• Elisabetta Fortuna, Patrizia M. Gianni, Barry M. 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, Marc Moreno Maza:
  On Computer-assisted Classification of Coupled Integrable Equations. 647-660
  
• André Galligo, David Rupprecht:
  Irreducible Decomposition of Curves. 661-677
  
• Bernard Mourrain, 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
  

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