Dana Randall

Dana Randall is an American computer scientist. She works as the ADVANCE Professor of Computing, and adjunct professor of mathematics at the Georgia Institute of Technology. She is also an External Professor of the Santa Fe Institute.^[2] Previously she was executive director of the Georgia Tech Institute of Data Engineering and Science (IDEaS) that she co-founded,^[3] and director of the Algorithms and Randomness Center.^[4] Her research include combinatorics, computational aspects of statistical mechanics, Monte Carlo stimulation of Markov chains, and randomized algorithms.

Randall was born in Queens, New York. She graduated from New York City's Stuyvesant High School in 1984.^[5] She received her A.B. in Mathematics from Harvard University in 1988 and her Ph.D. in computer science from the University of California, Berkeley in 1994 under the supervision of Alistair Sinclair.^[6]

Her sister is theoretical physicist Lisa Randall.

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.^{[citation needed]}

In 2012 she became a fellow of the American Mathematical Society.^[7]

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.^[8]

• Clustering in interfering models of binary mixtures^[9]

• Dana Randall's website
• Arnold Ross Lectures details at the AMS