The Conference will be devoted to modern polynomial algorithms in Computer Algebra which are gaining importance in various applications of science
as well as in fundamental researches.
N. Vasiliev, E. Novikova, Ya. Shibaeva
(secretary), N. Zalesskaya
B.Buchberger (Schloss Hagenberg, Austria), V.Gerdt (Dubna, Russia), P.Gianni (Pisa, Italy),
D.Grigoriev (Bonn, Germany), V.Pan (New York, USA), L.Robbiano (Genova, Italy),
N.Vasiliev (St. Petersburg, Russia), A. Vershik (St. Petresburg, Russia), S.Watt (Western Ontario, Canada).
Combinatorics of monomial orderings
Computational algebraic geometry
Polynomial differential operators
Parallelization of algorithms
Complexity of algorithms
Official languages: English, Russian.
Previous Conference Polynomial Computer Algebra '2008
Extended abstracts of presentation in English up to 4 pages
using LaTeX with the style file birkmult.zip).
Attention. Deadline for paper submission and
registration has been prolonged till
March, 17 .
Limited funds for financial support for Russian participiants are
available from RFBR grant.
Registration fee is 200 €. For Russian participants
the fee could be covered by the RFBR grant.
Do not hesitate to contact the organizers
by the following E-mail address: