Jump to content

Dana Randall

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Stuyhi (talk | contribs) at 04:17, 7 September 2006 (External links). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.


Dana is a graduate of Stuyvesant High School.