Gary Miller | |
|---|---|
 Gary Miller (left) withVolker Strassen | |
| Known for | Miller–Rabin primality test |
| Awards | Paris Kanellakis Award (2003)Knuth Prize (2013) |
| Scientific career | |
| Institutions | Carnegie Mellon University |
| Thesis | Riemann's Hypothesis and Tests for Primality (1975) |
| Doctoral advisor | Manuel Blum |
| Doctoral students | Susan Landau F. Thomson Leighton Jakub Pachocki Shang-Hua Teng Jonathan Shewchuk |
Gary Lee Miller is an Americancomputer scientist who is a professor of computer science atCarnegie Mellon University.[1] In 2003 he won theACMParis Kanellakis Award (with three others) for theMiller–Rabin primality test. He was made anACM Fellow in 2002[2] and won theKnuth Prize in 2013.[3]
Miller received hisPh.D. from theUniversity of California, Berkeley, in 1975 under the direction ofManuel Blum. Following periods on the faculty at theUniversity of Waterloo,the University of Rochester,MIT andthe University of Southern California, Miller moved toCarnegie Mellon University, where he is now professor ofcomputer science. In addition to his influential thesis oncomputational number theory and primality testing, Miller has worked on many central topics incomputer science, includinggraph isomorphism,parallel algorithms,computational geometry andscientific computing. His most recent focus on scientific computing led to breakthrough results with students Ioannis Koutis and Richard Peng in 2010 that currently provide the fastest algorithms—in theory and practice—for solving "symmetric diagonally dominant" linear systems, which have important applications in image processing, network algorithms, engineering and physical simulations.[4] His Ph.D. thesis was titledRiemann's Hypothesis and Tests for Primality.[5]
