THEORY

• S.A.Abramov, 2008, Power Series and Linear Difference Equations
• S.A.Abramov, 2005, To the memory of Manuel Bronstein
• S.A.Abramov, 2002, The Poles of Solutions of Difference Equations.
• S.A,Abramov, 2001, On solution of linear functional systems
• S.A,Abramov, 2000, Hypergeometric dispersion and the orbit problem
• S.A,Abramov, 1999, Applicability of Zeilberger's algorithm to rational functions.
• S.A.Abramov, 1998, Solution of Differential Equations by Using a Power Series whose Coefficients are Eventually Nice Functions of the Index.
• S.A.Abramov, 1998, EG-eliminations.
• S.A.Abramov, 1997, Accurate Integration.
• S.A.Abramov, 1995, On the Nature of Non-uniqueness of Factorization of Ordinary Differential Operators.
• R.G.Airapetyan, 1997, New Statements of Inverse Problems in Quantum Scattering Theory.
• Yu.A.Al'pin, 1999, Common invariant subspaces of a pair of matrices and related questions
• A.V.Astrelin, 1998, Grobner Bases and Involutive Bases.
• S.N.Avvakumov, 1996, A General Term of an Inverted Power Series.

• S.A.Baginyan, 1997. Examination of an Algorithm of Recognizing Tracks Detected by a System of Drifting Tubes.
• L.M.Berkovich, 1997. Integration of Linear Ordinary Second-Order Differential Equations (from Euler and Liouville to Computer Algebra).
• A.Yu.Blinkov, 2001. Computing Polynomial Janet Bases
• A.Yu.Blinkov, 1995. Minimum Involute Bases.
• Yu.A.Blinkov, 1998. Involutive Divisions of Monomials.
• Yu.A.Blinkov, 2000. An algorithm for quick search for Janet divisor
• Yu.A.Blinkov, 2000. The Method of separating monomials for involutive divisions.
• Yu.A.Blinkov, 2001. Fast Computation of Polynomial Janet Bases.
• Yu.A.Blinkov, 2001. Compuatation of Janet bases for toric ideals.
• Yu.A.Blinkov. 2005. Open Source Software GINV Implementing Groebner Bases Methods for Systems of Equations,
• A.A.Bogolubskaya, 1998. The Use of the Reduce System in Construction of Optimal Numerical Algorithms.
• A.D.Bruno, 2006. ON INTEGRABILITY OF THE EULER-POISSON EQUATIONS
• A.D.Bruno, 2007, Analysis of the local integrability by methods of normal form and power geometry

• J.Carette, 1996 Mathematical Knowledge of the MAPLE System.
• V.N.Chugunov, 1998 Inverse eigenvalue problems and computer algebra.

• V.F.Edneral, 2006. ON INTEGRABILITY OF THE EULER-POISSON EQUATIONS
• V.F.Edneral, 2001. Bifurcation Analysis of Low Resonant Case of the Generalized Henon – Heiles System
• V.F.Edneral, 2000. About Normal Form Method
• V.F.Edneral, 2000. On Approximated Equations Solving
• V.F.Edneral, 1997. Approximation of Solutions of Autonomous Ordinary Differential Equations.
• V.A.Eltekov, 1997. Solving Problems in Mathematical Logic Using the PLANER System.
• O.Efimovskaya, 2001. Integrable qubic ODEs on free associative algebras

• K.Geddes, 2001 Fast Numerics Combined with Enhanced Symbolic Computation in Maple 7
• V.P.Gerdt, 2001 Computing Polynomial Janet Bases
• K.Geddes, 1999 Symbolic and Hybrid Symbolic-Numeric Computing with Maple
• V.P.Gerdt, 1995 Minimum Involute Bases.
• V.P.Gerdt, 1998 Involutive Divisions of Monomials.
• V.P.Gerdt, 1999 Constrained dynamical systems and canonical polynomial bases.
• V.P.Gerdt, 2000 On the Relation Between Pommaret and Janet Bases
• V.P.Gerdt, 2000 An algorithm for quick search for Janet divisor
• V.P.Gerdt, 2001 On algorithmic optimization in computation of involutive bases.
• V.P.Gerdt, 2001 Fast Computation of Polynomial Janet Bases.
• V.P.Gerdt, 2006 On algorithmisation of the Dirac constraint formalism
• J. Gerhard, 2007, Parametric polynomial system solving with Maple
• P.E.Glotov, 1998 An Algorithm of Searching the Greatest Common Divisor of Ore Polynomials with Polynomial Coefficients Depending on a Parameter
• O.D.Golubitskii, 1998 Grobner Bases and Involutive Bases.
• O.D.Golubitskii, 1998 Involutive Grobner Walk.
• O.D.Golubitskii, 2000 Uniqueness of the representation of a class of strings generated by insertions into the kernel.
• N.L.Grigorenko, 1996 Computer Algebra Aspects of Solving Control Problems under Uncertain Conditions.
• A.A.Gusev, 2000 Algebraic perturbation theory for a hydrogen atom in weak electric fields
• A.A.Gusev, 2001 Algebraic system of perturbation theory for hydrogen-like atom in the point electric charge.
• V.P.Gusynin, 1995 Evaluation of Coefficients of the Heat Kernel Expansion for Non-minimum Operators in a Curved Space.

• D.Hare, 2000 Numerics in Maple 6
• K.J.Hare, 1997 Simplification and Comparison with a Sample in the MAPLE System.
• C.Howlett, 1995 About WMI's Work.
• C.Howlett, 1997 New Means of Deploying Computer Algebra.

• Kh.D.Ikramov, 1998 INVARIANT SUBSPACES OF MATRIX ALGEBRAS AND DETECTING OF THEIR EXISTENCE WITH THE USE OF MAPLE PROCEDURES
• Kh.D.Ikramov, 1998 THE INERTIA OF MATRICES AND QUADRATIC FORMS, CONDITIONALLY DEFINITE MATRICES, THE SEPARATION OF ROOTS OF ALGEBRAIC EQUATIONS, AND MAPLE-PROCEDURES
• Kh.D.Ikramov, 1999 Common invariant subspaces of a pair of matrices and related questions
• V.A.Ilyin, 1995 ATENSOR: A Program Written in the Language of the REDUCE 3.6 Computer Algebra System for Simplifying Tensor Expressions.
• V.A.Ilyin, 1998 Mathematical system as an object in computer algebra.

• D.E.Khmelnov, 2000 EG-eliminations algorithm: practical aspects of its usage.
• D.E.Khmelnov, 2000 MEG-eliminations
• D.E.Khmelnov, 1997 New Algorithms and Programs for Searching for Rational Solutions to Linear Difference and q-Difference Equations with Polynomial Coefficients.
• D.E.Khmelnov, 1997 Improved Algorithms for Difference and q-Difference Equations.
• D.E.Khmelnov, 1998 EG-eliminations
• K.V.Kholshevnikov, 2001 Geometry of Pairs of Keplerian Elliptic Orbits
• V.I.Khomich, 1996 Algorithms Recognizing Separable Superintuitionistic Prepositional Calculuses.
• A.M.Khvedelidze, 2006 On algorithmisation of the Dirac constraint formalism
• Yu.N.Kiselev, 1996 Problems of Symbolic-Numerical Implementation of Optimal Control Algorithms.
• A.Klimov, 2003 Supercompilation and Partial Evaluation: introduction and the state of affairs
• V.Kislenkov, 2002 Computation of functions over grids in context of symbolic-numeric-graphical interface
• M.V.Kondratieva, 2000 Computation differencial dimensional polinomial for different basis of Dirac's equation.
• M.V. Kondratieva, 2007, Jacobi bound for systems of ordinary differential equations
• V.V.Kornyak, 1995 Evaluation of Coefficients of the Heat Kernel Expansion for Non-minimum Operators in a Curved Space.
• V.V.Kornyak, 1998 A Program for Calculating Cohomology of Lie Superalgebras of Vector Fields.
• V.V.Kornyak, 2000 Computation of Cohomology of Lie Superalgebras: algorithm and implementation
• V.V.Kornyak, 2001 Method for Splitting of Cochain Complexes in Computation of Cohomologies of Lie (Super)algebras
• A.P.Kryukov, 1995 ATENSOR: A Program Written in the Language of the REDUCE 3.6 Computer Algebra System for Simplifying Tensor Expressions.
• A.P.Kryukov, 1998 Mathematical system as an object in computer algebra.

• A.V.Lapunov, 1998 An Implementation of the Knuth-Bendix Algorithm.
• V.N.Latyshev, 1996 Recognizable Properties of Associative Algebras.
• Ha Le, 1998 Communication-oriented Representation of Mathematical Objects
• Ha Le, 1998 Some Fun With MapleV Release 5
• Gregoire Lecerf (CNRS, France), Multivariate Polynomial Factorization Algorithms, 2006

• S.D.Makhortov, 2008 Algebraic Models of Production Logic and Opportunity of Their Application in Computer Algebra Systems
• G.Malashonok, 2001 Computations in Modules over Commutative Rings
• G.Malashonok, 2000 Efficient matrix methods in commutative domains.
• S.Mechveliani, 2001 Functional programming and categorial approach in computer algebra.
• S.Meshveliani, 2000 Cost bound for LLL-Grigoryev method for factoring in GF(q)[x,y].
• A.A. Mikhalev, 1995 Algorithms of the Combinatorial Theory of Lie Super algebras.
• A.A. Mikhalev, 1997 Algorithms for Construction of Standard Grobner-Shirshov Bases of Ideals of Free Algebras over Commutative Rings
• A.M.Mitichkina, 2000 Special Puiseux Series Solutions of Algebraic Equations
• A.V.Mityunin, 1998 The Calculation of Grobner Bases in Differential Modules.
• V.Mitrofanov, 2000 A project of distant hypergeometric calculator based on the use of operator factorization method and Internet client-server tecnology

• N.M.Nagornyi, 1995 Kleene's Realizability in Problems of Computer Science and Foundations of Mathematics.
• N.M.Nagornyi, 1996 Features of Computable Mathematical Analysis.
• A.V.Niukkanen, 1995 Operator Factorization and Prospectives for Its Use in Computer Algebra.
• A.V.Niukkanen, 1997 Factorization and Recurrent Relations for Hyper geometric Functions.
• A.V. Niukkanen, 1998 The Theory of Special Functions of Hypergeometric Type: State, Prospects, and Illustrative Examples.
• A.V. Niukkanen, 1998 Analytical Transformations of Hypergeometric Series with the Use of a New Extension of MAPLE.
• A.V. Niukkanen, 2000 Diagram technique for multiple hypergeometric series
• A.V. Niukkanen, 2000 A project of distant hypergeometric calculator based on the use of operator factorization method and Internet client-server tecnology
• A.V. Niukkanen, 2010 On the use of algebraic recurrence relations for the calculation of higher-order derivatives of composite functions

• G.A.Ososkov, 1997 Examination of an Algorithm of Recognizing Tracks Detected by a System of Drifting Tubes.
• A.Ovchinnikov, 2004 The Problem How to Compute a Characteristic Set of a Radical Differential Ideal

• Yu. Palii, 2000 Stabilization of the Integral of Motion and Constraint Manifold under Numerical Integration of the Dynamical Equations Using MAPLE
• Yu. Palii, 2006 On algorithmisation of the Dirac constraint formalism
• E.V.Pankrat'ev, 1995 Constructive Methods of Differential Algebra.
• E.V.Pankrat'ev, 1998 Grobner Bases and Involutive Bases.
• O.S.Paramonova, 1997 mplementation of Linear and Quadratic Transformations of Hyper geometric Series of the Gauss Type in the MAPLE System.
• O.S.Paramonova, 1998 Analytical Transformations of Hypergeometric Series with the Use of a New Extension of MAPLE.
• O.S.Paramonova, 2000 A project of distant hypergeometric calculator based on the use of operator factorization method and Internet client-server tecnology
• O.S.Paramonova, 2001 Computer generation of 32 analytical expressions for the Appell function F4
• M.Petkovsek, 1997 Partial Recurrences with Constant Coefficients: The Algebraic Case.
• R.I.Podlovchenko, 1996 An Algebraic Approach in Program Scheme Theory.
• S.Polyakov, 2004 Additive Decomposition of the Rational Functions
• P.I.Pronin, 1995 Evaluation of One-Loop Counter terms: New algorithms and Programs.
• I.V.Puzynin, 1997 New Statements of Inverse Problems in Quantum Scattering Theory.

• A.M.Raporterenko, 1995 The Use of Adobe Type I Fonts and XII Graphics in the GSL Interpreter of the Standard Lisp Language.
• A.M.Raporterenko, 1998 A LISP-system for Logical Analysis and Visualization of Online Data.
• V.N.Robuk, 1995 A Computer-Oriented Method for Constructing Solutions of Partial Differential Equations.
• V.N.Robuk, 1996 Exact Integration Problems in Computer Algebra.
• V.N.Robuk, 1997 Correct Separation of Variables Instead of Exact Integration.
• A.Ya.Rodionov, 1998 Mathematical system as an object in computer algebra.
• V.A.Rostovtsev, 2000 Algebraic perturbation theory for a hydrogen atom in weak electric fields
• V.A.Rostovtsev, 2001 Algebraic system of perturbation theory for hydrogen-like atom in the point electric charge.
• A.A.Ryabenko, 1995 Programs for Finding Rational Solutions to Linear Difference and q-Difference Equations with Polynomial Coefficients.
• A.A.Ryabenko, 1998 The Construction of Solutions to Linear Ordinary Homogeneous Differential Equations in Terms of Sparse Series in the Maple System
• A.A.Ryabenko, 1999 Special formal solutions of linear ordinary differential equations in Maple
• A.A.Ryabenko, 2000 Special Puiseux Series Solutions of Algebraic Equations
• A.A.Ryabenko, 2001 Symbolic solution of linear ODE by using series.

• V.N.Samoilov, 2000 Algebraic perturbation theory for a hydrogen atom in weak electric fields
• V.N.Samoilov, 2001 Algebraic system of perturbation theory for hydrogen-like atom in the point electric charge.
• N.V.Savel'eva, 1998 INVARIANT SUBSPACES OF MATRIX ALGEBRAS AND DETECTING OF THEIR EXISTENCE WITH THE USE OF MAPLE PROCEDURES
• N.V.Savel'eva, 1998 THE INERTIA OF MATRICES AND QUADRATIC FORMS, CONDITIONALLY DEFINITE MATRICES, THE SEPARATION OF ROOTS OF ALGEBRAIC EQUATIONS, AND MAPLE-PROCEDURES
• A.Semenov, 1998 LanHEP - A Program for the Automated Generation of Feynman Rules.
• S.I.Serdyukova, 1997 The Calculation of Spectra of Difference Boundary-Value Problems.
• S.I.Serdyukova, 1998 The Use of the Reduce System in Construction of Optimal Numerical Algorithms.
• S.I.Serdyukova, 2000 Solving Inverse Problem for Two-Dimensional Discrete Schro:dinger Equation by Using CAS REDUCE
• V.M.Sever'yanov, 1997 Parallel Calcination of Fractal Sets and Functions by Means of Neural Networks and Cellular Automata.
• I.V.Shchenkov, 1997 Computation Delay, Programming Concepts, and Analytical Calculations.
• G.Shpiz, 1998 Mathematical system as an object in computer algebra.
• Skorobogatov, S.Y.(Bauman Moscow State Technical University) Refal with High Order Functions
• S.L.Skorokhodov, 2001 Stable Calculations of Special Functions in MAPLE
• S.L.Skorokhodov, Dubna, 2002 Computer Algebra and Computing Special Functions
• S. Slavyanov, 2007, Invariant transformations, isomonodromic deformations and “antiquantization” for simplest ODE possessing accessory parameter and apparent singularity.
• K.V.Stepanyants, 1995 Evaluation of One-Loop Counter terms: New algorithms and Programs.
• A.A.Suhanov, 1999 Representatives classes conjugation of nilpotence elements in a simple Lie algebras low dimensions
• A.A.Suhanov, 2000 Computer analis classes conjugation in Lie algebras low dimensions
• A.Semenov, 2001 Computing a Hilbert Polynomial using Thomas Involutive Division

• M.N.Tentyakov, 1997 Automation of calculation of Feynman Diagrams.
• S.P.Tsarev, 2008, Hyperdeterminats as a computer algebra challenge: their computation and relations to integrable

partial difference equations

• S.P.Tsarev, 2005, General definition of factorization of an arbitrary linear systems of partial differential equations
• S.P.Tsarev, 2003 On rational definite summation
• S.P.Tsarev, 2001 The Monge Problem: does it really help to park you car?
• S.P.Tsarev, 2000 Factorization of overdetermined systems of linear PDEs
• S.P.Tsarev, 1998 On symbolic algorithms of factorization in general rings of Ore polynomials.
• S.P.Tsarev, 1995 On the Nature of Non-uniqueness of Factorization of Ordinary Differential Operators.

• F.Ulmer, 1998 Computing Liouvillian solutions of ordinary linear differential equations

• N.N.Vassiliev, 2000 Creation of Symplectic Mapping Invariants in Symbolic Form
• N.N.Vassiliev, 2000 Symbolic Constructing of invariants of symplectic maps
• N.N.Vassiliev, 2001 Geometry of Pairs of Keplerian Elliptic Orbits
• S.I.Vinitsky, 2000 Algebraic perturbation theory for a hydrogen atom in weak electric fields
• S.I.Vinitsky, 2001 Algebraic system of perturbation theory for hydrogen-like atom in the point electric charge.

• D.A.Yanovich, 2001 Computing Polynomial Janet Bases
• D.A.Yanovich, 1999 Monomial Janet and Pommaret bases
• D.A.Yanovich, 2000 An algorithm for quick search for Janet divisor
• D.A.Yanovich, 2001 On parallelization of the algorithm for computing Janet bases
• D.A.Yanovich, 2001 Fast Computation of Polynomial Janet Bases.

• M.S.Zuev, 2008 Block symbolic matrix algorithms
• E.V.Zima, 2008 Integral representation and closed form summation.
• E.P.Zhidkov, 1997 New Statements of Inverse Problems in Quantum Scattering Theory.
• E.V.Zima, 1996 Parallel Algorithms of Construction of Multidimensional Chains of Recurrences.
• E.V.Zima, 1997 Representation of Polynomials Designed for Fast Parallel Shift.
• E.V.Zima, 1998 How fast can we compute products?
• A.Zobnin, 2006 Admissible Orderings and Standard Bases of Differential Ideals.
• A.Zobnin, 2004 Standard Bases of Ideals in Differential Polynomial Rings
• A.A.Zolotykh, 1997 Decomposition of Tensor Products and Other Algorithms for the Representation of Simple Lie Algebras of Large Rank.
• A.A.Zolotykh, 1997 Algorithms for Construction of Standard Grobner-Shirshov Bases of Ideals of Free Algebras over Commutative Rings
• M.S.Zuev, 2007 Computer algebra methods for parallel computers