Dmitri Yuryevich Grigoryev
Dmitri Jurjewitsch Grigorjew , Russian Дмитрий Юрьевич Григорьев , English transcription Dmitri Yurievich Grigoriev or Grigor'ev, called Dima Grigoriev , (born May 10, 1954 in Leningrad ) is a Russian mathematician and computer scientist who has lived in the USA since the 1990s and research. He deals with algebraic geometry , complexity theory , algebraic cryptography and computer algebra .
Grigoriev graduated from the Leningrad State University in 1976 and then worked at the Steklov Institute in Leningrad (LOMI). There he received his doctorate in 1979 under Anatol Slissenko (candidate title, dissertation: Multiplicative Complexity of a Family of Bilinear Forms (Russian)) and habilitated (Russian doctorate) in 1985 with the thesis Complexity in Polynomial Algebras (Russian). From 1988 to 1992 he headed the Laboratory for Algorithmic Methods at the Steklov Institute in Leningrad. 1992 to 1998 he was a professor at Penn State University . From 1998 he was Research Director of the CNRS at the University of Rennes I. and from 2008 at the University of Lille 1.
He was also a visiting scientist at the University of Bonn and at the Max Planck Institute for Mathematics in Bonn.
In 1984 he received the Leningrad Mathematical Society Prize , the Max Planck Research Prize in 1994 and the Humboldt Research Prize in 2002 , on the basis of which he conducted research with Ulrich Trottenberg at the Fraunhofer Institute for Algorithms and Scientific Computing (SCAI). In 1986 he was invited speaker at the International Congress of Mathematicians in Berkeley (Computational complexity in polynomial algebra) .
He is a member of the editorial board of the Journal of Computational Complexity.
His Erdős number is 2 due to joint publications with Andrew Odlyzko .
Fonts (selection)
- with N. Vorobjov: Solving systems of polynomial inequalities in subexponential time, J. Symb. Computation, Volume 5, 1988, pp. 37-64
- Complexity of deciding Tarski algebra, J. Symb. Computation, Vol. 5, 1988, pp. 65-108.
- with D. Mount, L. Babai: Isomorphism of graphs with bounded eigenvalue multiplicity, 14th ACM Symp. Theory of Computing, 1982, pp. 310-324
- with M. Karpinski, MF Singer: Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields, SIAM J. Computing, Volume 19, 1982, pp. 1059-1063
- with A. Slissenko: Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane, St. Petersburg Math. J., Volume 10, 1999, pp. 315-332
Web links
Individual evidence
- ↑ Dmitri Jurjewitsch Grigorjew in the Mathematics Genealogy Project (English)
- ↑ Humboldt Research Award to Dr. Dima Grigoriev , idw, November 26, 2002
- ^ Erdős number project .
- ↑ ISSAC '92 Publication .
| personal data | |
|---|---|
| SURNAME | Grigoryev, Dmitri Jurjewitsch |
| ALTERNATIVE NAMES | Grigoriev, Dmitri Yurievich; Grigoriev, Dima; Григорьев, Дмитрий Юрьевич (Russian) |
| BRIEF DESCRIPTION | Russian mathematician and computer scientist |
| DATE OF BIRTH | May 10, 1954 |
| PLACE OF BIRTH | Leningrad |