Lenore Blum
| Lenore Blum | |
|---|---|
Lenore Blum, Berkeley, California, 1998
|
|
| Born |
December 18, 1942 New York City |
| Nationality | USA |
| Alma mater |
Simmons College (B.S., 1963) Massachusetts Institute of Technology (Ph.D., Mathematics, 1968) |
| Occupation | mathematician, professor |
| Known for | Blum Blum Shub Pseudorandom number generator |
| Spouse(s) | Manuel Blum |
| Children | Avrim Blum (son) |
Simmons College (B.S., 1963)
Lenore Blum (December 18, 1942, New York) is a distinguished professor of Computer Science at Carnegie Mellon.
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 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 a 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.
...
Wikipedia