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

[3] Miller received his Ph.D. from the University of California, Berkeley, in 1975 under the direction of Manuel Blum.

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 titled Riemann's Hypothesis and Tests for Primality.