Table of Contents

• A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word ProblemNorbert Kuhn, Klaus Madlener, Friedrich Otto. 8-15 [doi]
• PRECOMAS an Implementation of Constructive Matching MethodologyMarta Franová. 16-23 [doi]
• A Decidable Fragment of the Elementary Theory of Relations and Some ApplicationsDomenico Cantone, Vincenzo Cutello. 24-29 [doi]
• A Strong Problem Reduction Method Based on Function IntroductionMatthias Baaz, Alexander Leitsch. 30-37 [doi]
• Resolution Proof Systems with Weak Transformation RulesZbigniew Stachniak. 38-43 [doi]
• Dataflow for Logic Program as Substitution ManipulatorSusumu Yamasaki. 44-51 [doi]
• Reexamining Intractability of Tableau MethodsNeil V. Murray, Erik Rosenthal. 52-59 [doi]
• Algebraic Programming in the APS SystemAlexander A. Letichevsky, Julia V. Kapitonova. 68-75 [doi]
• A Delivery System for REDUCEJohn Fitch. 76-81 [doi]
• Univariate Power Series Expansions in REDUCEJulian A. Padget, A. Barnes. 82-87 [doi]
• SUI: A System Independent User Interface for an Integrated Scientific Computing EnvironmentY. Doleh, Paul S. Wang. 88-95 [doi]
• Progress Report on a System for General-Purpose Parallel Symbolic Algebraic ComputationBruce W. Char. 96-103 [doi]
• How to Test in Subexponential Time Whether Two Points Can Be Connected by a Curve in a Semialgebraic SetDima Grigoriev. 104-105 [doi]
• On the Isomorphism Problem for Finite-Dimensional Binomial AlgebrasKioshi Shirayanagi. 106-111 [doi]
• Arithmetic with Real Algebraic Numbers is in NCBhubaneswar Mishra, Paul Pedersen. 120-126 [doi]
• On Determining the Solvability of PolynomialsKazuhiro Yokoyama, Masayuki Noro, Taku Takeshima. 127-134 [doi]
• Modular Rational Sparse Multivariate Polynomial InterpolationErich Kaltofen, Yagati N. Lakshman, J.-M. Wiley. 135-139 [doi]
• Polynomials over Finite Fields with Large ImagesJoachim von zur Gathen. 140-144 [doi]
• Parallel Univariate Polynomial Factorization on Shared-Memory MultiprocessorsPaul S. Wang. 145-151 [doi]
• Gröbner Basis, Integration and Transcendental FunctionsNobuki Takayama. 152-156 [doi]
• Computation of Catalan s Constant Using Ramanujan s FormulaGregory J. Fee. 157-160 [doi]
• A Random Base Change Algorithm for Permutation GroupsGene Cooperman, Larry Finkelstein, N. Sarawagi. 161-168 [doi]
• FIDE: a REDUCE package for automation of FInite difference method for solving pDERichard Liska, L. Drsda. 169-176 [doi]
• Symbolic-Numerical Computations in the Stability Analyses of Difference SchemesS. I. Mazurik, Evgenii V. Vorozhtsov. 177-184 [doi]
• Local Approximation Study of Difference Operators by Means of REDUCE SystemVictor G. Ganzha, Michail Yu. Shashkov. 185-192 [doi]
• A Critical-Pair/Completion Based Integration AlgorithmA. C. Norman. 201-205 [doi]
• An Algorithm of Constructing the Integral of a Module - an Infinite Dimensional Analog of Gröbner BasisNobuki Takayama. 206-211 [doi]
• The Algorithm for Calculating Integrals of Hypergeometric Type Functions and Its Realization in REDUCE SystemVictor Adamchik, O. I. Marichev. 212-224 [doi]
• Complexity of Irreducibility Testing for a System of Linear Ordinary Differential EquationsDima Grigoriev. 225-230 [doi]
• An Algorithm for Computing the Formal Solutions of Differential Systems in the Neighborhood of an Irregular Singular PointGuoting Chen. 231-235 [doi]
• On Liouvillian Solutions of Homogeneous Linear Differential EquationsFelix Ulmer, Jacques Calmet. 236-243 [doi]
• Computer Generation of Necessary Integrability Conditions for Polynomial-Nonlinear Evolution SystemsVladimir P. Gerdt, A. Yu. Zharkov. 250-254 [doi]
• Automated Reasoning in Geometries Using the Characteristic Set Method and Gröbner Basis MethodShang-Ching Chou. 255-260 [doi]
• An Improvement of the Projection Operator in Cylindrical Algebraic DecompositionH. Hong. 261-264 [doi]
• Methods for Mechanical Geometry Formula DerivingShang-Ching Chou, Xiao-Shan Gao. 265-270 [doi]
• Regular Curves and Proper ParametrizationsDinesh Manocha. 271-276 [doi]
• Refutational Proofs of Geometry Theorems via Characteristic Set ComputationDeepak Kapur, H. K. Wan. 277-284 [doi]
• Application of Metasystem Transition to Function Inversion and TransformationRobert Glück, Valentin F. Turchin. 286-287 [doi]
• An Execution Model for Exploiting And-Or Parallelism in Logic Programs (abstract)Mounira Belmesk. 288 [doi]
• Equations, Disequations and Unsolvable Subsets (abstract)Philippe Codognet. 289 [doi]
• A Meta SimplifierC. Faure. 290 [doi]
• Detecting Algebraic Dependencies Between Unnested Radicals (abstract)Trevor J. Smedley. 292-293 [doi]
• Parallel Polynomial Computations by Recursive ProcessesDario Bini, Victor Y. Pan. 294 [doi]
• Solving Systems of Bivariate Algebraic Equations by Using Primitive Polynomial Remainder SequencesMichael Kalkbrener. 295 [doi]
• A Parallelization of the Buchberger AlgorithmRussell J. Bradford. 296 [doi]
• On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract)Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima. 297 [doi]
• A Modular Approach to the Computation of the Number of Real RootsJuan Llovet, J. Rafael Sendra. 298 [doi]
• Solving Algebraic Systems which Arise as Necessary Integrability Conditions for Polynomial-Nonlinear Evolution EquationsVladimir P. Gerdt, N. V. Khutornoy, A. Yu. Zharkov. 299 [doi]
• Application of REDUCE System for Analyzing Consistency of Systems of P.D.E. sVictor G. Ganzha, S. V. Meleshko, V. P. Shelest. 301 [doi]
• Some Applications of Maple Symbolic Computation to Scientific and Engineering ProblemsTony C. Scott, Gregory J. Fee. 302-303 [doi]
• Optimization Techniques for Symbolic Equation Solver in Engineering ApplicationsH. Q. Tan, X. Dong. 305 [doi]
• The Implementation of an Algorithm in Macsyma: Computing the Formal Solutions of Differential Systems in the Neighborhood of Regular Singular PointGuoting Chen, I. Gil. 307 [doi]