Journal of Symbolic Computation, Volume 15, 1993

Volume 15, Number 1, January 1993

• Laurence Puel, Ascánder Suárez: Compiling Pattern Matching by Term Decomposition. 1-26
• Greg Sidebottom: Implementing CLP(IB) Using the Connection Theorem Proving Method and a Clause Management System. 27-48
• William W. Adams, A. K. Boyle, Philippe Loustaunau: Transitivity for Weak and Strong Gröbner Bases. 49-65
• Stanley Burris, John Lawrence: The Equivalence Problem for Finite Rings. 67-71
• D. M. Klimov, V. V. Leonov, 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, M. Grinfeld, J. Hubble: Computer Algebra Techniques in Affinity Binding Equations: The Dimer Case. 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

Volume 15, Number 2, February 1993

• Dinesh Manocha: Multipolynomial Resultant Algorithms. 99-122
• Hirokazu Murao, Hidetsune Kobayashi, Tetsuro Fujise: On Factorizing the Symbolic U-Resultant - Application of the ddet Operator -. 123-142
• Michael Kalkbrener: A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties. 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-197
• Hans-Gert Gräbe: On Lucky Primes. 199-209
• Martin Wursthorn: Isomorphisms of Modular Group Algebras: An Algorithm and its Application to Groups of Order. 211-227
• Gregory Butler, John J. Cannon: On Holt's Algorithm. 229-233
• Satish R. Thatte: Finite Acyclic Theories are Unitary. 235-249

Volume 15, Number 3, March 1993

• Thomas Becker: Standard Bases in Power Series Rings: Uniqueness and Superfluous Critical Pairs. 251-265
• Elizabeth W. Rutman: Primary Decomposition of Modules: Two Variables over a Field. 267-275
• Thomas 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-313
• Jesse Ira Deutsch: Identities Arising From Hecke Transformations of Modular Forms Over Q(\surd2) and Q(\surd3). 315-323
• Robert A. Wilson: The Brauer Tree for J_3 in Characteristic 17. 325-330
• Aart Middeldorp, Yoshihito Toyama: Completeness of Combinations of Constructor Systems. 331-348
• Rongdong Wang, 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

Volume 15, Number 4, April 1993

• Guy Viry: Factorization of Multivariate Polynomials with Coefficients in F_p. 371-391
• Bernard Beauzamy, Vilmar Trevisan, Paul S. Wang: Polynomial Factorization Sharp Bounds, Efficient Algorithms. 393-413
• Wayne Snyder: A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations. 415-450
• Chang Nian Zhang, Behrooz Shirazi, David Y. Y. Yun: An Efficient Algorithm and Parallel Implementations for Binary and Residue Number Systems. 451-462

Volume 15, Number 5/6, May/June 1993

• Nachum Dershowitz, Uday S. Reddy: Deductive and Inductive Synthesis of Equational Programs. 467-494
• Dmitri Boulanger, Maurice Bruynooghe: Deriving Fold/Unfold Transformations of Logic Programs Using Extended OLDT-Based Abstract Interpretation. 495-521
• Arie van Deursen, Paul Klint, Frank Tip: Origin Tracking. 523-545
• Philippe Clauss, Catherine Mongenet: Synthesis Aspects in the Design of Efficient Processor Arrays from Affine Recurrence Equations. 547-569
• Douglas R. Smith: Constructing Specification Morphisms. 571-606
• Christine Paulin-Mohring, Benjamin Werner: Synthesis of ML Programs in the System Coq. 607-640
• Yukihide Takayama: QPC_2: A Constructive Calculus with Parameterized Specifications. 641-672
• Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti: A Derived Algorithm for Evaluating \varepsilon-Expressions over Abstract Sets. 673-704
• Ritu Chadha, David A. Plaisted: On the Mechanical Derivation of Loop Invariants. 705-744
• Nachum Dershowitz, Yuh-Jeng Lee: Logical Debugging. 745-773
• Pierre Flener, Yves Deville: Logic Program Synthesis from Incomplete Specifications. 778-805
• Amr F. Fahmy, Alan W. Biermann: Synthesis of Real Time Acceptors. 807-842