Journal of Symbolic Computation, Volume 20, 1995

Volume 20, Number 1, July 1995

• Enno Ohlebusch: Modular Properties of Composable Term Rewriting Systems. 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-69
• Graham H. Norton: On n-Dimensional Sequences I. 71-92 , Corrigenda: JSC 20(5/6): 769-770 (1995)
• Graham H. Norton: On the Minimal Realizations of a Finite Sequence. 93-115

Volume 20, Number 2, August 1995

• Ioannis Z. Emiris, John F. Canny: Efficient Inceremtal Algorithms for the Sparse Resultant and the Mixed Volume. 117-149
• François Arnault: Constructing Carmichael Numbers which are Strong Pseudoprimes to Several Bases. 151-161
• Günter Czichowski: A Note on Gröbner Bases and Integration of Rational Functions. 163-167
• John Shackell, Bruno Salvy: Asymptotic Forms and Algebraic Differential Equations. 169-177
• Gernot Haager, Gerd Baumann, Theo F. Nonnenmacher: An Algorithm to Determine Potential Systems in Mathematica. 179-196
• David Hartley, Philip Tuckey: Gröbner Bases in Clifford and Grassmann Algebras. 197-205
• B. Curtis Eaves, Uriel G. Rothblum: Linear Problems and Linear Algorithms. 207-214
• Max Dauchet, Anne-Cécile Caron, Jean-Luc Coquidé: Automata for Reduction Properties Solving. 215-233

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, Mark J. Encarnación: Efficient Rational Number Reconstruction. 287-297
• Mark J. Encarnación: Computing GCDs of Polynomials over Algebraic Number Fields. 299-313
• Alberto Policriti, Jacob T. Schwartz: T-Theorem Proving I. 315-342
• Miki Hermann, Phokion G. Kolaitis: The Complexity of Counting Problems in Equational Matching. 343-362

Volume 20, Number 4, October 1995

• Victor Shoup: A New Polynomial Factorization Algorithm and its Implementation. 363-397
• Wolfram Koepf: Algorithms for m-Fold Hypergeometric Summation. 399-417
• Catherine S. Greenhill: Theoretical and Experimental Comparison of Efficiency of Finite Field Extensions. 419-429
• Denis Lugiez: Positive and Negative Results for Higher-Order Disunification. 431-470
• Janusz Konieczny: Reduced Idempotents in the Semigroup of Boolean Matrices. 471-482

Volume 20, Number 5/6, November/December 1995

• George E. Andrews: On a Conjecture of Peter Borwein. 487-501
• Maylis Delest, Jean-Philippe Dubernard, I. Dutour: Parallelogram Polyominoes and Corners. 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 Lisonek: Closed Forms for the Number of Polygon Dissections. 595-601
• Roberto Pirastu, Kurt Siegl: Parallel Computation and Indefinite Summation: A MAPLE Application for the Rational Case. 603-616
• Roberto Pirastu, Volker Strehl: Rational Summation and Gosper-Petkovsek Representation. 617-635
• Nobuki Takayama: An Algorithm for Finding Recurrence Ralations of Binomial Sums and its Complexity. 637-651
• Philippe Flajolet, Bruno Salvy: Computer Algebra Libraries for Combinatorial Structures. 653-671
• Peter Paule, Markus 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, Herbert S. Wilf: Five Surprisingly Simple Complexities. 725-729
• Herbert S. Wilf: The Computer-Aided Discovery of a Theorem about Young Tableaux. 731-735
• Christian Krattenthaler: HYP and HYPQ. 737-744
• István Nemes, Marko Petkovsek: RComp: A Mathematica Package for Computing with Recursive Sequences. 745-753
• John R. Stembridge: A Maple Package for Symmetric Functions. 755-768