.gif)
Gary Miller (professor)
Encyclopedia
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 also made an ACM Fellow in 2002.
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
.
Computer science
Computer science or computing science is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems...
at Carnegie Mellon University
Carnegie Mellon University
Carnegie Mellon University is a private research university in Pittsburgh, Pennsylvania, United States....
, Pittsburgh, United States. In 2003, he won the ACM
Association for Computing Machinery
The Association for Computing Machinery is a learned society for computing. It was founded in 1947 as the world's first scientific and educational computing society. Its membership is more than 92,000 as of 2009...
Paris Kanellakis Award
Paris Kanellakis Award
The Paris Kanellakis Theory and Practice Award is granted yearly by the Association for Computing Machinery to honor specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing...
(with three others) for the Miller–Rabin primality test. He was also made an ACM Fellow in 2002.
Miller received his Ph.D.
Doctor of Philosophy
Doctor of Philosophy, abbreviated as Ph.D., PhD, D.Phil., or DPhil , in English-speaking countries, is a postgraduate academic degree awarded by universities...
from the University of California, Berkeley
University of California, Berkeley
The University of California, Berkeley , is a teaching and research university established in 1868 and located in Berkeley, California, USA...
in 1975 under the direction of Manuel Blum
Manuel Blum
Manuel Blum is a computer scientist who received the Turing Award in 1995 "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking".-Biography:Blum attended MIT, where he received his bachelor's degree and...
. His Ph.D. thesis was titled Riemann's Hypothesis and Tests for Primality.
Apart from computational number theory
Computational number theory
In mathematics, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations...
and primality testing, he has worked in the areas of computational geometry
Computational geometry
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational...
, scientific computing, parallel algorithms and
randomized algorithms. Among his Ph.D. students are Susan Landau
Susan Landau
Susan Landau is an American mathematician and engineer, as of 2011, a Visiting Scholar at the Computer Science Department, Harvard University....
, Tom Leighton, Shang-Hua Teng
Shanghua Teng
Shang-Hua Teng is the chairman of the Computer Science Department at the Viterbi School of Engineering of the University of Southern California. In 2008 he was awarded the Gödel Prize for his joint work on smoothed analysis of algorithms with Daniel Spielman...
, and Jonathan Shewchuk
Jonathan Shewchuk
Jonathan Richard Shewchuk is an Associate Professor in Computer Science at the University of California, Berkeley.He obtained his B.S. in Physics and Computing Science from Simon Fraser University in 1990, and his M.S. and Ph.D...
.
External links
- Gary Miller's web page at Carnegie Mellon.
- Gary Miller at the Mathematics Genealogy ProjectMathematics Genealogy ProjectThe Mathematics Genealogy Project is a web-based database for the academic genealogy of mathematicians. As of September, 2010, it contained information on approximately 145,000 mathematical scientists who contribute to "research-level mathematics"...
. - Miller's original paper "Riemann's Hypothesis and Tests for Primality"