Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
calg:aindex [14/012008 15:14] admin |
calg:aindex [22/042008 15:16] (current) edneral |
||
---|---|---|---|
Line 1: | Line 1: | ||
===== Authors Index ===== | ===== Authors Index ===== | ||
+ | |||
==== A ==== | ==== A ==== | ||
+ | * S.A.Abramov, 2008, Power Series and Linear Difference Equations | ||
* S.A.Abramov, 2005, To the memory of Manuel Bronstein | * S.A.Abramov, 2005, To the memory of Manuel Bronstein | ||
* S.A.Abramov, 2002, The Poles of Solutions of Difference Equations. | * S.A.Abramov, 2002, The Poles of Solutions of Difference Equations. | ||
Line 214: | Line 216: | ||
* A.A.Suhanov, 2000 Computer analis classes conjugation in 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 | * A.Semenov, 2001 Computing a Hilbert Polynomial using Thomas Involutive Division | ||
+ | |||
==== T ==== | ==== T ==== | ||
* M.N.Tentyakov, 1997 Automation of calculation of Feynman Diagrams. | * M.N.Tentyakov, 1997 Automation of calculation of Feynman Diagrams. | ||
- | * S.P.Tsarev, 2005, General definition of factorization of an arbitrary linear systems of partial differential equations | + | * 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, 2003 On rational definite summation | ||
* S.P.Tsarev, 2001 The Monge Problem: does it really help to park you car? | * S.P.Tsarev, 2001 The Monge Problem: does it really help to park you car? | ||
Line 246: | Line 251: | ||
* D.A.Yanovich, 2001 On parallelization of the algorithm for computing Janet bases | * D.A.Yanovich, 2001 On parallelization of the algorithm for computing Janet bases | ||
* D.A.Yanovich, 2001 Fast Computation of Polynomial Janet Bases. | * D.A.Yanovich, 2001 Fast Computation of Polynomial Janet Bases. | ||
+ | |||
+ | |||
==== Z ==== | ==== Z ==== | ||
+ | * 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.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, 1996 Parallel Algorithms of Construction of Multidimensional Chains of Recurrences. |