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 so called "decomposition theorem" for analyzing Markov chains.
Her sister is Lisa Randall.
[edit] External links
 This biography of an academic is a stub. You can help by expanding it. |
|
This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it. |
