Over 130 published articles define the output of Dima Grigoriev, a mathematician whose work bridges the technical divide between algebraic geometry and computational complexity. Born in 1954 in Saint Petersburg, he has spent his career examining the intersection of symbolic computation and algorithmic methods, establishing himself as a significant contributor to the field of computer algebra.
Academic Formation
Grigoriev completed his formal training at Saint Petersburg State University, earning his Honours Diploma in 1976. He proceeded to join the Leningrad Department of the Steklov Mathematical Institute, where he conducted research from 1976 until 1992. During his tenure at this institution, he defended his thesis, "Multiplicative Complexity of a Family of Bilinear Forms," under the guidance of Anatol Slissenko to earn his Candidate of Sciences degree in 1979. By 1985, he achieved his Doctor of Science degree with a thesis focused on computational complexity in polynomial algebra, subsequently heading the Laboratory of algorithmic methods from 1988.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →International Career
The scope of Grigoriev's professional activity expanded internationally throughout the 1990s. Between 1992 and 1998, he served as a full professor at Pennsylvania State University. Following this period, he transitioned to the National Center for Scientific Research (CNRS) in France. His work within the French academic system included roles at the University of Rennes 1 and, beginning in 2008, as a Research Director at the Laboratory Paul Painlevé at the University of Lille 1.
Contributions and Recognition
Beyond his research output, Grigoriev has served on the editorial boards for the Journal of Computational Complexity, the Journal of Applicable Algebra in Engineering, Communications and Computations, and Groups, Complexity, Cryptology. His work has received several honors, including the Prize of the Leningrad Mathematical Society in 1984, the Max Planck Research Award in 1994, and the Humboldt Prize in 2002. He was also an invited speaker at the 1986 International Congress of Mathematicians held in Berkeley, California, and maintains an Erdős number of 2 through his collaborations with Andrew Odlyzko.
Fast facts
- Born: 1954, Saint Petersburg
- Citizenship: Soviet Union
- Fields of work: Algebraic geometry, computational complexity theory, computer algebra
- PhD: 1979, Steklov Institute of Mathematics
- Awards: Humboldt Prize, Max Planck Research Award
- Erdős number: 2
- Academic tenure: Pennsylvania State University, Steklov Institute, CNRS
Questions readers ask
What are Dima Grigoriev's primary research interests?
His work focuses on algebraic geometry, symbolic computation, and computational complexity theory within the context of computer algebra.
Which institutions have employed Grigoriev?
He has held positions at the Steklov Institute of Mathematics, Pennsylvania State University, and the National Center for Scientific Research in France.
Achievements
- Humboldt Prize
- Held posts at Pennsylvania State University, Steklov Institute of Mathematics and National Center for Scientific Research
- Fields: algebraic geometry, computational complexity theory and computer algebra
.jpg)
