Gregorio Malajovich received his bachelor's degree in mathematics from the Universidade Federal do Rio de Janeiro (UFRJ) in 1989, where he also obtained his master's degree in 1990. In 1993, he earned his PhD in mathematics from UC Berkeley. Malajovich has been on the faculty of UFRJ since 1991. He has held a postdoctoral position at the Mathematical Science Research Institute in Berkeley, and temporary visiting positions at City University of Hong Kong, University of Southern Denmark and Université Paul Sabatier. He has worked on subjects such as Newton iteration on manifolds, univariate polynomial solving, conditioning of sparse polynomial systems, root counting, and complexity theory. He also wrote an advanced undergraduate textbook on linear algebra (in Portuguese). His main research interests are complexity of algorithms for numerical computations, and the mathematics of solving systems of polynomial equations. This includes theoretical issues such as Smale's 17th problem, and also practical issues such as mixed volume computation. He is currently writing a book on nonlinear equations.
- Algorithms and Complexity in Algebraic Geometry, Fall 2014. Visiting Scientist.