Dana Randall

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Dana Randall
AwardsFellow of the American Mathematical Society, Outstanding Service Award, Georgia Tech[1]
Scientific career
FieldsTheoretical computer science
InstitutionsGeorgia Tech
Sister, Lisa Randall

Dana Randall is a professor of theoretical computer science at Georgia Tech, where she is the Director of the Algorithms and Randomness Center and the ADVANCE Professor of Computing.


Randall was born in Queens, New York. She graduated from New York City's Stuyvesant High School in 1984.[2] 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.[3]

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.


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

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.[5]


  • Clustering in interfering models of binary mixtures[6]


  1. ^ "Dana Randall wins Institute outstanding service award". Math.gatech.edu. Retrieved 2013-06-08.
  2. ^ "Stuyvesant Math Team, Spring 1983". Archived from the original on 2011-05-29. Retrieved 2007-10-31.
  3. ^ "Dana Randall : CV". People.math.gatech.edu. Retrieved 7 November 2017.
  4. ^ "American Mathematical Society". Ams.org. Retrieved 7 November 2017.
  5. ^ "AMS Ross Lectures". Ams.org. Retrieved 7 November 2017.
  6. ^ "Archived copy" (PDF). Archived from the original (PDF) on 2016-03-05. Retrieved 2012-10-04.CS1 maint: archived copy as title (link)

External links[edit]