| Gary Miller|
| Manuel Blum|
| Carnegie Mellon University|
Riemann's Hypothesis and Tests for Primality (1975)
F. Thomson Leighton
Paris Kanellakis Award (2003) Knuth Prize (2013)
University of California, Berkeley
Pittsburgh, Pennsylvania, United States
Miller–Rabin primality test
Shang-Hua Teng, Jonathan Shewchuk, F. Thomson Leighton
Shang‑Hua Teng, Manuel Blum, Jonathan Shewchuk, Daniel Spielman, F Thomson Leighton
Gary Miller (computer scientist) Wikipedia
Gary Lee 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 made an ACM Fellow in 2002 and won the Knuth Prize in 2013.
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 Susan Landau, F. Thomson Leighton, Shang-Hua Teng, and Jonathan Shewchuk.