Dana Randall
From Wikipedia, the free encyclopedia
Dana Randall is a professor of theoretical computer science at Georgia Tech. Her primary research interest is analyzing algorithms for counting problems (eg. 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.[1]
Her sister is physicist Lisa Randall.
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.
[edit] References
- ^ "Stuyvesant Math Team, Spring 1983". http://173.8.135.113/Math1983.html. Retrieved 2007-10-31.
[edit] External links
 |
This biography of an academic is a stub. You can help Wikipedia by expanding it. |
| P ≟ NP | This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it. |
