Gary Miller (computer scientist)

From Wikipedia, the free encyclopedia
  (Redirected from Gary L. Miller (mathematician))
Jump to: navigation, search
Gary Miller
Strassen Knuth Prize presentation.jpg
Gary Miller (left) with Volker Strassen
Residence Pittsburgh
Institutions Carnegie Mellon University
Thesis Riemann's Hypothesis and Tests for Primality (1975)
Doctoral advisor Manuel Blum
Doctoral students Susan Landau
F. Thomson Leighton
Shang-Hua Teng
Jonathan Shewchuk
Known for Miller–Rabin primality test
Notable awards Paris Kanellakis Award (2003) Knuth Prize (2013)

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

Notes[edit]

  1. ^ Citation for Gary Miller's ACM Fellow Award
  2. ^ "ACM Awards Knuth Prize to Creator of Problem-Solving Theory and Algorithms" (Press release). Association for Computing Machinery. Retrieved 31 October 2013. 

External links[edit]