Lenore Blum, Berkeley, California, 1998
December 18, 1942 |
New York City
Simmons College (B.S., 1963)
Massachusetts Institute of Technology (Ph.D., Mathematics, 1968)
|Known for||Blum Blum Shub Pseudorandom number generator|
|Children||Avrim Blum (son)|
Early life and education
Blum grew up in New York City and Venezuela. Her mother was a science teacher in a New York City school.
After high school graduation, she studied architecture at Carnegie Institute of Technology from 1959 to 1961 before transferring to Simmons College in Boston to study mathematics, graduating with a B.S. in 1963. She spent 9 years in college.
She received her Ph.D. in mathematics from the Massachusetts Institute of Technology in 1968. Her dissertation was on Generalized Algebraic Structures and her advisor was Gerald Sacks. She then went to the University of California at Berkeley as a Postdoctoral Fellow and Lecturer in Mathematics.
In 1973 she joined the faculty of Mills College where in 1974 she founded the Mathematics and Computer Science Department (serving as its Head or co-Head for 13 years). In 1979 she was awarded the first Letts-Villard Chair at Mills.
In 1983 Blum won an National Science Foundation CAREER award to work with Michael Shub for two years at the CUNY Graduate Center. They worked on secure random number generators and evaluating rational functions, see Blum Blum Shub. In 1987 she spent a year at IBM. In 1989 she published a paper with Michael Shub and Stephen Smale on NP completeness, recursive functions and universal Turing machines, see Blum–Shub–Smale machine. In 1990 she gave an address at the International Congress of Mathematicians on computational complexity theory and real computation.
In 1992 Blum became the deputy director of the Mathematical Sciences Research Institute, otherwise known as MSRI. After visiting the City University of Hong Kong for a year, she moved to her current position at Carnegie Mellon in 1999.  In 2002 she was selected to be a Noether Lecturer. In 2012 she became a fellow of the American Mathematical Society.
- L. Blum, M. Blum and M. Shub, “A Simple Secure Pseudo-Random Number Generator,” SIAM Journal of Computing, Vol. 15, No. 2, 364-383, May 1986.
- L. Blum, “A New Simple Homotopy Algorithm for Linear Programming I,” Journal of Complexity, Vol.4, No.2, 124-136, June 1988.
- L. Blum, M. Shub, S. Smale, “On a Theory of Computation Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines,” FOCS; 88; Bulletin of the AMS, Vol. 21, No.1, 1-46, July 1989.
- L. Blum, F. Cucker, M. Shub and S. Smale, Complexity and Real Computation, Springer-Verlag, 1998.
- L. Blum, “Computing over the Reals, Where Turing Meets Newton”, Notices of the AMS, October, 2004.
- "Class of 1963 News: Professor tries to instill passion for math, science", Simmons College Class of 1963 News. Originally written by Joyce Gannon and published Sunday, August 21, 2005 in the Pittsburgh Post-Gazette
- "Short Vita: Lenore Blum", Carnegie Mellon University website
- List of Fellows of the American Mathematical Society, retrieved 2012-11-10.