ISSAC 1993: Kiev, Ukraine

• Alexey Zharkov:
  On Algebraic Solutions of First Order Riccatti Equation. 1-3
  
• Marius van der Put, Peter A. Hendriks:
  A Rationality Result for Kovacic's Algorithm. 4-8
  
• Victor G. Ganzha, Evgenii V. Vorozhtsov:
  A Probabilistic Symbolic-Numerical Method for the Stability Analyses of Difference Schemes for PDEs. 9-13
  
• Victor F. Edneral:
  Computer Generation of Normalizing Transformation for Systems of Nonlinear ODE. 14-19
  
• Sergei A. Abramov:
  On d'Alembert Substitution. 20-26
  
• Marko Petkovsek, Bruno Salvy:
  Finding all Hypergeometric Solutions of Linear Differential Equations. 27-33
  
• David J. Jeffrey:
  Integration to Obtain Expressions Valid on Domains of Maximum Extent. 34-41
  
• Eugene V. Zima:
  Numeric Code Optimization in Computer Algebra Systems and Recurrent Relations Technique. 42-46
  
• George E. Collins, Werner Krandick:
  A Hybrid Method for High Precision Calculation of Polynomial Real Roots. 47-52
  
• D. M. Klimov, V. M. Rudenko, V. V. Leonov:
  Symbolic Evaluation in the Nonlinear Mechanical Systems. 53-54
  
• Alexander B. Godlevsky, Anatoly E. Doroshenko:
  Parallelizing Programs with APs. 55-62
  
• S. A. Gutnik:
  Application of Computer Algebra to Investigation of the Relative Equilibria of a Satellite. 63-64
  
• Ivan I. Shevchenko, Andrej G. Sokolsky:
  Studies of Regular Precessions of a Symmetric Satellite by Means of Computer Algebra. 65-67
  
• Michael B. Monagan, Walter M. Neuenschwander:
  GRADIENT: Algorithmic Differentiation in Maple. 68-76
  
• Philip S. Santas:
  A Type System for Computer Algebra (abstract). 77
  
• Jinzhao Wu, Lian Li:
  The Regular Problem and Green Equivalences for Special Monoids. 78-85
  
• László Babai, Katalin Friedl, Markus Stricker:
  Decomposition of *-closed Algebras in Polynomial Time. 86-94
  
• Hongzhong Wu:
  On the Assignment Complexity of Uniform Trees. 95-104
  
• Domenico Cantone, Vincenzo Cutello:
  Decision Procedures for Stratified Set-Theoretic Syllogistics. 105-110
  
• Tudor Jebelean:
  A Generalization of the Binary GCD Algorithm. 111-116
  
• László Babai, Robert Beals, Daniel N. Rockmore:
  Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time. 117-126
  
• Robert Beals:
  An Elementary Algorithm for Computing the Composition Factors of a Permutation Group. 127-134
  
• Marie-Françoise Roy:
  Aspect Graphs of Algebraic Surfaces. 135-143
  
• Daniel Richardson:
  A Zero Structure Theorem for Exponential Polynomials. 144-151
  
• Sergei A. Abramov, K. Yu. Kvashenko:
  On the Greatest Common Divisor of Polynomials which Depend on a Parameter. 152-156
  
• Manuel Bronstein, Bruno Salvy:
  Full Partial Fraction Decomposition of Rational Functions. 157-160
  
• Michael Kalkbrener:
  An Upper Bound on the Number of Monomials in the Sylvester Resultant. 161-163
  
• Emil Volcheck:
  Noether's S-Transformation Simplifies Curve Singularities Rationally: A Local Analysis. 164-172
  
• Bernard Mourrain:
  The 40 ``generic'' Positions of a Parallel Robot. 173-182
  
• Ioannis Z. Emiris, John F. Canny:
  A Practical Method for the Sparse Resultant. 183-192
  
• Dario Bini, Victor Y. Pan:
  Parallel Computations with Toeplitz-like and Hankel-like Matrices. 193-200
  
• J. Rafael Sendra, Juan Llovet:
  Efficient Algorithms for Hankel Matrices over Z[x₁, ..., x_r]. 201-208
  
• Gilles Villard:
  Computation of the Smith Normal Form of Polynomial Matrices. 209-217
  
• Kazuhiro Yokoyama, Taku Takeshima:
  On Hensel Construction of Eigenvalues and Eigenvectors of Matrices with Polynomial Entries. 218-224
  
• L. Vallier:
  An Algorithm for the Computation of Normal Forms and Invariant Manifolds. 225-233
  
• John Shackell:
  Nested Expansions and Hardy Fields. 234-238
  
• Dominik Gruntz:
  A New Algorithm for Computing Asymptotic Series. 239-244
  
• Volker Weispfenning:
  Differential Term-Orders. 245-253
  
• Klaus Madlener, Birgit Reinert:
  Computing Gröbner Bases in Monoid and Group Rings. 254-263
  
• Hoon Hong:
  Quantifier Elimination for Formulas Constrained by Quadratic Equations. 264-274
  
• Massimo Caboara:
  A Dynamic Algorithm for Gröbner Basis Computation. 275-283
  
• Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang:
  Automated Geometry Theorem Proving by Vector Calculation. 284-291
  
• Dongdai Lin, Zhuojun Liu:
  Some Results on Theorem Proving in Geometry over Finite Fields. 292-300
  
• Sabine Stifter:
  Geometry Theorem Proving in Vector Spaces by Means of Gröbner Bases. 301-310
  
• G. Keady, M. G. Richardson:
  An Application of IRENA to Systems of Nonlinear Equations Arising in Equilibrium Flows in Networks.. 311-320
  

Last update Fri May 25 08:24:21 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page