Dana Randall
| Dana Randall | |
|---|---|
| Born | Queens, New York City |
| Alma mater | Ph.D., University of California, Berkeley, 1994, A.B., Harvard University, 1988 |
| Occupation | Professor of theoretical computer science |
| Employer | Georgia Tech |
| Relatives | Sister, Lisa Randall |
| Awards | Fellow of the American Mathematical Society, Outstanding Service Award, Georgia Tech [1] |
Dana Randall is a professor of theoretical computer science at Georgia Tech. Her primary research interest is analyzing algorithms for counting problems (e.g. counting matchings in a graph) using Markov chains. One of her important contributions to this area is a decomposition theorem for analyzing Markov chains. Randall was born in Queens in New York City. She graduated from New York's Stuyvesant High School in 1984.[2]
She delivered her Arnold Ross Lecture on October 29, 2009, an honor previously conferred on Barry Mazur, Elwyn Berlekamp, Ken Ribet, Manjul Bhargava, David Kelly and Paul Sally.[3] In 2010, she gave a talk at Princeton University's "Women in Theory" workshop.[4]
In 2012 she became a fellow of the American Mathematical Society.[5]
Her sister is physicist Lisa Randall.
Publications
References
- ↑ "Dana Randall wins Institute outstanding service award". Retrieved 2013-06-08.
- ↑ "Stuyvesant Math Team, Spring 1983". Retrieved 2007-10-31.
- ↑ "AMS Ross Lectures".
- ↑ WOMEN IN THEORY: Dana Randall, Sampling Algorithms and Phase Transitions – Princeton Engineering
- ↑ List of Fellows of the American Mathematical Society, retrieved 2013-1.