Dima Grigoriev

Dima Grigoriev (Dmitry Grigoryev) (born 10 May 1954) is a mathematician. His research interests include algebraic geometry, symbolic computation and computational complexity theory in computer algebra, with over 130 published articles.[2][3]

Dima (Dmitry) Grigoriev
Born (1954-05-10) 10 May 1954
St.Petersburg, Russia
Alma materSaint Petersburg State University
Steklov Mathematics Institute
AwardsMax-Planck-Forschungspreis (1994),
Humboldt Prize (2002)
Scientific career
FieldsMathematician
InstitutionsCNRS, France
Doctoral advisorAnatol Slissenko[1]

Dima Grigoriev was born in Leningrad, Russia and graduated from the Leningrad State University, Dept. of Mathematics and Mechanics, in 1976 (Honours Diploma). During 1976–1992 he was with LOMI, Leningrad Department of the Steklov Mathematical Institute of the USSR Academy of Sciences.

In 1979 he earned PhD (Candidate of Sciences) in Physics and Mathematics with thesis "Multiplicative Complexity of a Family of Bilinear Forms" (from LOMI, under the direction of Anatol Slissenko). In 1985 he earned Doctor of Science (higher doctorate) with thesis "Computational Complexity in Polynomial Algebra". Since 1988 till 1992 he was the head of Laboratory of algorithmic methods Leningrad Department of the Steklov Mathematical Institute. During 1992–1998 Grigoriev hold the position of full professor at Penn State University.

Since 1998 he hold the position of Research Director at CNRS, University of Rennes 1, and since 2008 – Research Director at CNRS, Laboratory Paul Painleve University Lille 1 in France.

He is member of editorial boards of the Journal Computational Complexity,[4] Journal of Applicable Algebra in Engineering, Communications and Computations[5] and Groups, Complexity, Cryptology.[6]

He is recipient of the Prize of Leningrad Mathematical Society[7] (1984), Max Planck Research Award of the Max Planck Society, Germany (1994), and Humboldt Prize of Humboldt Foundation, Germany (2002), Invited Speaker of International Congress of Mathematicians, Berkeley, California, 1986.

He has Erdős number 2 due to his collaborations with Andrew Odlyzko.[8][9]

References
  1. Anatol Slissenko's homepage
  2. Grigoriev's home page
  3. List of publications of Grigoriev
  4. Journal Computational Complexity
  5. Journal of Applicable Algebra in Engineering, Communications and Computations
  6. "Groups, Complexity, Cryptology journal". Archived from the original on 18 September 2010. Retrieved 8 August 2010.
  7. Prize of Leningrad Mathematical Society award recipients
  8. Erdős number project.
  9. ISSAC '92 Publication.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.