Dana Randall

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Dana Randall
Born Queens, New York City
Fields Theoretical computer science
Institutions Georgia Tech
Notable awards Fellow of the American Mathematical Society, Outstanding Service Award, Georgia Tech [1]
Notes
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.

Education[edit]

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

Her sister is theoretical physicist Lisa Randall.

Research[edit]

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.

Accolades[edit]

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]

Publications[edit]

References[edit]

  1. ^ "Dana Randall wins Institute outstanding service award". Retrieved 2013-06-08. 
  2. ^ "Stuyvesant Math Team, Spring 1983". Retrieved 2007-10-31. 
  3. ^ http://people.math.gatech.edu/~randall/vita.html
  4. ^ List of Fellows of the American Mathematical Society, retrieved 2013-1.
  5. ^ "AMS Ross Lectures". 

External links[edit]