%A Etienne Paul %T Equational methods in first order predicate calculus %J Journal of Symbolic Computation %K jsc %V 1 %N 1 %D March 1985 %P 7-29 %K resolution, term rewriting systems, satisfiable theories, quantifier-free first order theories %A Elmar Eder %T Properties of substitutions and unifications %J Journal of Symbolic Computation %K jsc %V 1 %N 1 %D March 1985 %P 31-46 %K first order substitutions with partial ordering %A B. Chazelle %A H. Edelsbrunner %T Optimal solutions for class of point retrieval problems %J Journal of Symbolic Computation %K jsc %V 1 %N 1 %D March 1985 %P 47-56 %A Erich Kaltofen %T Fast parallel absolute irreducibility testing %J Journal of Symbolic Computation %K jsc %V 1 %N 1 %D March 1985 %P 57-67 %A Richard Pavelle %A Paul S. Wang %T MACSYMA from F to G %J Journal of Symbolic Computation %K jsc %V 1 %N 1 %D March 1985 %P 69-100 %K tutorial introduction %A V.P. Gerdt %A A.B. Shvachka %A A.Yu. Zharkov %T Computer algebra application for classification of integrable non-linear evolution equations %J Journal of Symbolic Computation %K jsc %V 1 %N 1 %D March 1985 %P 101-107 %A K.S. Kolbig %T Explicit evaluation of certain definite integrals involving powers of logarithms %J Journal of Symbolic Computation %K jsc %V 1 %N 1 %D March 1985 %P 109-114 %A W. Bibel %A K. Aspetsberger %T A bibliography on parallel inference machines %J Journal of Symbolic Computation %K jsc %V 1 %N 1 %D March 1985 %P 115-118 %A Alan W. Biermann %T Automatic programming: a tutorial on formal methodologies %J Journal of Symbolic Computation %K jsc %V 1 %N 2 %D June 1985 %P 119-142 %A Gregory Butler %T Effective computation with group homomorphisms %J Journal of Symbolic Computation %K jsc %V 1 %N 2 %D June 1985 %P 143-157 %A David R. Barton %A Richard Zippel %T Polynomial decomposition algorithms %J Journal of Symbolic Computation %K jsc %V 1 %N 2 %D June 1985 %P 159-168 %A Allan Borodin %A Ronald Fagin %A John E. Hopcroft %A Martin Tompa %T Decreasing the nesting depth of expressions involving square roots %J Journal of Symbolic Computation %K jsc %V 1 %N 2 %D June 1985 %P 169-188 %A Richard Zippel %T Simplification of expressions involving radicals %J Journal of Symbolic Computation %K jsc %V 1 %N 2 %D June 1985 %P 189-210 %A John Fitch %T Solving algebra problems with REDUCE %J Journal of Symbolic Computation %K jsc %V 1 %N 2 %D June 1985 %P 211-227 %A Fritz Schwarz %T An algorithm for determining polynomial first integrals of autonomous systems of ordinary differential equations %J Journal of Symbolic Computation %K jsc %V 1 %N 2 %D June 1985 %P 229-233 %A Miguel Navarro-Saad %A Kurt Bernardo Wolf %T Applications of a factorisation theorem for ninth-order aberration optics %J Journal of Symbolic Computation %K jsc %V 1 %N 2 %D June 1985 %P 235-239 %A D. Coppersmith %A J.H. Davenport %T An application of factoring %J Journal of Symbolic Computation %K jsc %V 1 %N 2 %D June 1985 %P 241-243 %A W. Bibel %T Automated inferencing %J Journal of Symbolic Computation %K jsc %V 1 %N 3 %D September 1985 %P 245-260 %A D. Lazard %T Ideal bases and primary decomposition: case of two variables %J Journal of Symbolic Computation %K jsc %V 1 %N 3 %D September 1985 %P 261-270 %A E.V. Krishnamurthy %T Symbolic iterative algorithm for generalised inversion of rational polynomial matrices %J Journal of Symbolic Computation %K jsc %V 1 %N 3 %D September 1985 %P 271-281 %A G.W. Cherry %T Integration of finite terms with special functions: the error function %J Journal of Symbolic Computation %K jsc %V 1 %N 3 %D September 1985 %P 283-302 %A Michael Karr %T Theory of summation in finite terms %J Journal of Symbolic Computation %K jsc %V 1 %N 3 %D September 1985 %P 303-315 %A Nicola Rizzi %A Amabile Tatone %T Using symbolic computation in buckling analysis %J Journal of Symbolic Computation %K jsc %V 1 %N 3 %D September 1985 %P 317-321 %A Thierry Coquand %A Gerard Hut %T A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction %J Journal of Symbolic Computation %K jsc %V 1 %N 3 %D September 1985 %P 323-328 %A Leo Bachmair %A David A. Plaisted %T Termination orderings for associative-commutative rewriting systems %J Journal of Symbolic Computation %K jsc %V 1 %N 4 %D December 1985 %P 329-349 %K precedence- simplification- recursive path- associative path ordering term rewriting systems %A D.F. Holt %T The mechanical computation of fist and second cohomology groups %J Journal of Symbolic Computation %K jsc %V 1 %N 4 %D December 1985 %P 351-361 %K Nilpotent Quotient algorithm %A G. Butler %A C.W.H. Lam %T A general backtrack algorithm for the isomorphism problem of combinatorial objects %J Journal of Symbolic Computation %K jsc %V 1 %N 4 %D December 1985 %P 363-381 %K search trees, base change algorithm %A Klaus Madlener %A Friedrich Otto %T Pseudo-natural algorithms for the word problem for finitely presented monoids and groups %J Journal of Symbolic Computation %K jsc %V 1 %N 4 %D December 1985 %P 383-418 %K complexity %A Ph. Tombal %A A. Moussiaux %T MACSYMA computation of the Dirac-Bergmann algorithm for Hamiltonian systems with constraints %J Journal of Symbolic Computation %K jsc %V 1 %N 4 %D December 1985 %P 419-421 %K dynamical equations for physical theories %A Jerald J. Kovacic %T An algorithm for solving second order linear homogeneous differential equations %J Journal of Symbolic Computation %K jsc %V 2 %N 1 %D March 1986 %P 3-43 %A M.D. Atkinson %A R.A. Hassan %T On the computation of group characters %J Journal of Symbolic Computation %K jsc %V 2 %N 1 %D March 1986 %P 45-50 %A Michael C. Slattery %T Computing character degrees in p-groups %J Journal of Symbolic Computation %K jsc %V 2 %N 1 %D March 1986 %P 51-58 %A Ana Pasztor %T Non-standard algorithmic and dynamic logic %J Journal of Symbolic Computation %K jsc %V 2 %N 1 %D March 1986 %P 59-81 %A W. Boege %A R. Gebauer %A H. Kredel %T Some examples for solving systems of algebraic equations by calculating Groebner bases %J Journal of Symbolic Computation %K jsc %V 2 %N 1 %D March 1986 %P 83-98 %A Chanderjit Bajaj %T Proving geometric algorithm non-solvability: an application of factoring polynomials %J Journal of Symbolic Computation %K jsc %V 2 %N 1 %D March 1986 %P 99-102 %A Stanley J. Watowich %A Jeffery L. Krause %A R. Stephen Berry %T Stability analysis of an optimally controlled light-driven engine %J Journal of Symbolic Computation %K jsc %V 2 %N 1 %D March 1986 %P 103-108 %A Jurgen Avenhaus %T On the descriptive power of term rewriting systems %J Journal of Symbolic Computation %K jsc %V 2 %N 2 %D June 1986 %P 109-122 %A U. Furbach %A S. Holldobler %T Modelling the combination of functional and logic programming languages %J Journal of Symbolic Computation %K jsc %V 2 %N 2 %D June 1986 %P 123-138 %A Lorenzo Robbiano %T On the theory of graded structures %J Journal of Symbolic Computation %K jsc %V 2 %N 2 %D June 1986 %P 139-170 %A H. Edelsbrunner %A R. Waupotitsch %T Computing a Ham-sandwich cut in two dimensions %J Journal of Symbolic Computation %K jsc %V 2 %N 2 %D June 1986 %P 171-178 %A Bruce W. Char %A Gregory J. Fee %A Keith O. Geddes %A Gaston H. Gonnet %A Michael B. Monagan %T A tutorial introduction to Maple %J Journal of Symbolic Computation %K jsc %V 2 %N 2 %D June 1986 %P 179-200 %A Anthony Duncan %A Ralph Roskies %T Representations of unusual mathematical structures in scientific applications of symbolic computation %J Journal of Symbolic Computation %K jsc %V 2 %N 2 %D June 1986 %P 201-206 %A Carl Trindle %T Application of the MuMATH(R) symbol manipulation system to chemically significant permutation groups %J Journal of Symbolic Computation %K jsc %V 2 %N 2 %D June 1986 %P 207-212 %A Stanly Steinberg %A Patrick J. Roache %T Using MACSYMA to write FORTRAN subroutines %J Journal of Symbolic Computation %K jsc %V 2 %N 2 %D June 1986 %P 213-216 %A B.F. Caviness %T Computer algebra: past and future %J Journal of Symbolic Computation %K jsc %V 2 %N 3 %D September 1986 %P 217-236 %A J.H. Davenport %A M.F. Singer %T Elementary and Liouvillian solutions of linear differential equations %J Journal of Symbolic Computation %K jsc %V 2 %N 3 %D September 1986 %P 237-260 %A Heinrich Rolletschek %T On the number of divisions of the Euclidean algorithm applied to Gaussian integers %J Journal of Symbolic Computation %K jsc %V 2 %N 3 %D September 1986 %P 261-291 %A David A. Plaisted %A Steven Greenbaum %T A structure-preserving clause form translation %J Journal of Symbolic Computation %K jsc %V 2 %N 3 %D September 1986 %P 293-304 %A Paul S. Wang %T FINGER: a symbolic system for automatic generation of numerical programs in finte element analysis %J Journal of Symbolic Computation %K jsc %V 2 %N 3 %D September 1986 %P 305-316 %A R.V. Book %A J.H. Siekmann %T On unification: equational theories are not bounded %J Journal of Symbolic Computation %K jsc %V 2 %N 4 %D December 1986 %P 317-324 %A Lawrence C. Paulson %T Constructing recursion operators in intuitionistic type theory %J Journal of Symbolic Computation %K jsc %V 2 %N 4 %D December 1986 %P 325-355 %A Murray R. Bremner %T Fast computation of weight multiplicities %J Journal of Symbolic Computation %K jsc %V 2 %N 4 %D December 1986 %P 357-362 %A Philippe le\ Chenadec %T A catalogue of complete group presentations %J Journal of Symbolic Computation %K jsc %V 2 %N 4 %D December 1986 %P 363-381 %A D. Armbruster %A H. Kredel %T Constructing universal unfoldings using Grobner bases %J Journal of Symbolic Computation %K jsc %V 2 %N 4 %D December 1986 %P 383-388 %A B. Kutzler %A S. Stifter %T On the application of Buchberger's algorithm to automated geometry theorem proving %J Journal of Symbolic Computation %K jsc %V 2 %N 4 %D December 1986 %P 389-397 %A Deepak Kapur %T Using Grobner bases to reason about geometry problems %J Journal of Symbolic Computation %K jsc %V 2 %N 4 %D December 1986 %P 399-408 %A Bruno Buchberger %T History and basic features of the critical-pair/completion procedure %J Journal of Symbolic Computation %K jsc %V 3 %N 1/2 %D February/April 1987 %P 3-38 %A Ronald V. Book %T Thue systems as rewriting systems %J Journal of Symbolic Computation %K jsc %V 3 %N 1/2 %D February/April 1987 %P 39-68 %A Nachum Dershowitz %T Termination of rewriting %J Journal of Symbolic Computation %K jsc %V 3 %N 1/2 %D February/April 1987 %P 69-115 %A Michael Rusinowitch %T Path of subterms ordering and recursive decomposition ordering revisited %J Journal of Symbolic Computation %K jsc %V 3 %N 1/2 %D February/April 1987 %P 117-131 %A Jieh Hsiang %T Rewrite method for theorem proving in first order theory with equality %J Journal of Symbolic Computation %K jsc %V 3 %N 1/2 %D February/April 1987 %P 133-151 %A Katherine A. Yelick %T Unification in combinations of collapse-free regular theories %J Journal of Symbolic Computation %K jsc %V 3 %N 1/2 %D February/April 1987 %P 153-181 %A Erik Tiden %A Stefan Arnborg %T Unification problems with one-sided distributivity %J Journal of Symbolic Computation %K jsc %V 3 %N 1/2 %D February/April 1987 %P 183-202 %A Dan Benananv %A Deepak Kapur %A Paliath Narendran %T Complexity of matching problems %J Journal of Symbolic Computation %K jsc %V 3 %N 1/2 %D February/April 1987 %P 203-216 %A Albrecht Fortenbacher %T An algebraic approach to unification under associativity and commutativity %J Journal of Symbolic Computation %K jsc %V 3 %N 3 %D June 1987 %P 217-229 %A Charles C. Sims %T Verifying nilpotence %J Journal of Symbolic Computation %K jsc %V 3 %N 3 %D June 1987 %P 231-247 %A F. Aurenhammer %T Recognising polytopical cell complexes and constructing projection polyhedra %J Journal of Symbolic Computation %K jsc %V 3 %N 3 %D June 1987 %P 249-255 %A Francois Fages %T Associative-commutatative unification %J Journal of Symbolic Computation %K jsc %V 3 %N 3 %D June 1987 %P 257-275 %A J.F. Ogilvie %A R.H. Tipping %T On the analytic solution by computer algebra of some problems in the vibration-rotational spectroscopy of diatomic molecules %J Journal of Symbolic Computation %K jsc %V 3 %N 3 %D June 1987 %P 277-281 %A W.A. Beyer %A L. Heller %T A Steiner tree associated with three quarks %J Journal of Symbolic Computation %K jsc %V 3 %N 3 %D June 1987 %P 283-289 %A R.D. Mills %T Using a small algebraic manipulation system to solve differential and algebraic equations by variational and approximation techniques %J Journal of Symbolic Computation %K jsc %V 3 %N 3 %D June 1987 %P 291-301 %K MUMATH %A A.L. Semjonov %A L.S. Mel'nikov %A V.A. Evstigneev %T Solving the problems of kinetics of complex reactions by symbolic algebraic manipulation methods %J Journal of Symbolic Computation %K jsc %V 3 %N 3 %D June 1987 %P 303-307 %A R. Boffgen %A M.A. Reichert %T Computing the decomposition of primes p and p-adic absolute values in semi-cimple algebras over Q %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 3-10 %A Johannes Buchmann %A H.C. Williams %T On principal ideal testing in algebraic number fields %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 11-19 %A L. Cerlienco %A M. Mignotte %A F. Piras %T Computing the measure of a polynomial %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 21-33 %A Harvey Cohn %A Jesse Ira Deutsch %T Application of symbolic manipulation to the Hecke transformations of modular forms in two variables, II %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 35-40 %A Carsten Eckhardt %T Computation of class numbers by an analytic method %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 41-52 %A H.G. Folz %A H.G. Zimmer %T What is the rank of the Demjanenko matrix ? %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 53-67 %A David J. Ford %T The construction of maximal orders over a Dedekind domain %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 69-75 %A Erich Kaltofen %T Deterministic irreducibility testing of polynomials over large finite fields %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 77-82 %A Gunter Malle %T Polynomials for primitive nonsolvable permutation groups of degree d <= 15 %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 83-92 %A B. Heinrich Matzat %A Andreas Zeh-Marschke %T Polynome mit der Galoisgruppe M11 uber Q %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 93-97 %A Eckart Maus %T Computation of integral bases in certain Sn extensions of Q %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 99-102 %A Attila Petho %T On the resolution of Thue inequalities %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 103-109 %A W. Plesken %T Towards a soluble quotient algorithm %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 111-122 %A M. Pohst %T A modification of the LLL reduction algorithm %J Journal of Symbolic Computation %K jsc %V 4 %N 1 %D August 1987 %P 123-127