Jump to content

Gary Miller (computer scientist)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 108.17.80.118 (talk) at 02:39, 5 April 2013 (Knuth prize). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Gary Miller
Gary Miller (left) with Volker Strassen
Known forMiller–Rabin primality test
AwardsParis Kanellakis Award (2003) Knuth Prize (2013)
Scientific career
InstitutionsCarnegie Mellon University
ThesisRiemann's Hypothesis and Tests for Primality (1975)
Doctoral advisorManuel Blum
Doctoral studentsSusan Landau
Tom Leighton
Shang-Hua Teng
Jonathan Shewchuk

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[1] and won the Knuth Prize in 2013.[2]

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, Tom Leighton, Shang-Hua Teng, and Jonathan Shewchuk.

Notes

Template:Persondata