Prof. Dr. Dima Grigoriev

Profile

Academic positionFull Professor
Research fieldsTheoretical Computer Science,Algebra, Theory of Numbers, Algebraic Geometry,Numerical Analysis, Optimization, Simulation
KeywordsAlgebra, Cryptography, Differnetialgleichung, Komplexitaet, Symbolische Lösung
Honours and awards

2022: The 2021 AAECC Best Paper Award in Memory of Jacques Calmet link.springer.com/article/10.1007/s00200-022-00572-5

2002: Humboldt Prize

1994: Max-Planck-Forschungspreis

Current contact address

CountryFrance
CityVilleneuve d'Ascq
InstitutionUniversite de Lille
InstituteInstitut de Mathematiques
Homepagehttps://en.wikipedia.org/wiki/Dima_Grigoriev

Host during sponsorship

Prof. Dr. Ulrich TrottenbergFraunhofer-Institut für Algorithmen und Wissenschaftliches Rechnen (SCAI), St. Augustin
Start of initial sponsorship01/12/1994

Programme(s)

1994Max Planck Research Award Programme
2002Humboldt Research Award Programme

Nominator's project description

Since roughly 20 years Professor Grigoriev is among the leading scientists working in the field of complex theory, a main area of theoretical computer science. His extraordinarily wide interests range from the Kolmogorov complexity to different application problems of graph theory, algebraic theory and differential equations.

Publications (partial selection)

2021D.Grigoriev, N.Vorobjov: Complexity of deciding whether a tropical linear prevariety is a tropical variety. In: Applicable Algebra in Engineering, Communication and Computing, 32, 2021, 157-174
2014D.Grigoriev, J. Reinitz, S. Vakulenko, A. Weber : Punctuated evolution and robustness in morphogenesis. . In: BioSystems, 2014, 106-113
2011Dima Grigoriev, E. Bierstone, P. Milman, J. Wlodarczyk: Effective Hironaka resolution and its complexity.. In: The Asian Journal of Mathematics, volume dedicated to H. Hironaka, 2011, 193-228
2010Dima Grigoriev, G erald Tenenbaum: A low complexity probabilistic test for integer multiplication.. In: Journal of Complexity, 2010, 263-267
2010Dima Grigoriev, S.Vakulenko: Complexity and stable evolution of circuits.. In: Edited by Solomon Feferman and Wilfried Sieg. Proofs, Categories and Computations. Essays in honor of Grigori Mints.. College Publications. 2010. 279-296
2010Dima Grigoriev, Fritz Schwarz: Non-holonomic ideals in the plane and absolute factoring.. In: Proc. ACM Int. Symp. Symb. Algebr. Comput., Munich,, 2010, 93-97
2009Dima Grigoriev Vladimir Shpilrain: Authentication from matrix conjugation.. In: Groups, Complexity, Cryptology, 2009, 199-205
2009Dima Grigoriev, Sergei Vakulenko: Instability, Complexity and evolution.. In: Journal of Mathematical Sciences , 2009, 787-808
2009Dima Grigoriev: Newton-Puiseux series for non-holonomic D-modules and factoring linear partial differential operators.. In: Moscow Mathematical Journal, 2009, 775-800
2008Dima Grigoriev Fritz Schwarz: Loewy decomposition of linear third-order PDE's in the plane. In: Proc. ACM Int. Symp. Symb. Algebr. Comput., Austria, 2008, 277-286
2007Dima Grigoriev Fritz Schwarz: Loewy- and primary- decompositions of D-modules. In: Adv. Appl. Math., 2007, 526-541
2005Dima Grigoriev, F. Schwarz: Generalized Loewy-decompsition of D-modules. In: Intern. Symp. Symbol. Algebr. Comput., 2005, 163-170
2005Dima Grigoriev: Weak Bezout inequality for D-modules . In: J. Complexity, 2005, 532-542
2004Dima Grigoriev, F. Schwarz: Factoring and solving linear partial differential equations. In: Computing, 2004, 179-197