Ileana Streinu

Ileana Streinu is a Romanian -US - American mathematician and computer scientist, the discrete and computer-based geometry (especially rigidity problems), and combinatorics deals.

Streinu in 1994 received his doctorate at the University of Bucharest in Solomon Marcus ( Some Positive and Negative Results in Computational Geometry ), and in the same year at Rutgers University in computer science at William L. Steiger ( Grammatical inference ). She is professor of mathematics and computer science at Smith College in Northampton, where she is since 1994. She is also Adjunct Professor at the University of Massachusetts Amherst.

She has been a visiting professor and visiting scientist at the Technical University Berlin ( visiting professor in 2006 ), the Euler Institute in St. Petersburg, at the École Normale Supérieure in Paris, at Stanford University, the Catalan Polytechnic University in Barcelona, ​​at the Technical University Kyoto and at the University of Hamburg.

In 2010 she won the David P. Robbins Prize of the American Mathematical Society for their solution to the Carpenter 's Rule Problem ( first dissolved by Robert Connelly and others), in which it comes to a planar polygon with rigid edges without self-intersection by constant transformations in a convex to take shape .. the problem has applications in motion planning of robot arms.

In 2006 she received with Ciprian Borcea the Grigore Moisil Prize of the Romanian Academy of Sciences for their proof that minimal rigid graph ( Laman graph ) with n vertices have at most different embeddings in the Euclidean plane.