Gary Miller (professor)

Gary L. Miller is a professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 2003, he won the ACM Paris Kanellakis Award (with three others) for the Miller-Rabin primality test. He was also made an ACM Fellow in 2002 [ [http://fellows.acm.org/fellow_citation.cfm?id=1556943&srt=alpha&alpha=M Citation for Gary Miller's ACM Fellow Award] ] .

Miller received his Ph.D. from the University of California, Berkeley in 1975 under the direction of Manuel Blum. His Ph.D. thesis was titled "Riemann's Hypothesis and Tests for Primality".

Apart from computational number theory and primality testing, he has worked in the areas of computational geometry, scientific computing, parallel algorithms and
randomized algorithms. Among his Ph.D. students are Tom Leighton, Shang-Hua Teng, and Jonathan Shewchuk.

External links

* [http://www.cs.cmu.edu/~glmiller/ Gary Miller's web page] at Carnegie Mellon.
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=31473 Gary Miller] at the Mathematics Genealogy Project.
* Miller's original paper " [http://portal.acm.org/citation.cfm?id=803773&dl=ACM&coll=portal Riemann's Hypothesis and Tests for Primality] "

References