Gary Miller (computer scientist)

Gary Lee Miller is a professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States.[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]

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

Early Life and Career

Miller received his Ph.D. from the University of California, Berkeley in 1975 under the direction of Manuel Blum. Following periods on the faculty at the University of Waterloo, the University of Rochester, MIT and the University of Southern California, Miller moved to Carnegie Mellon University, where he is now Professor of Computer Science. In addition to his influential thesis on computational number theory and primality testing, Miller has worked on many central topics in computer science, including graph isomorphism, parallel algorithms, computational geometry and scientific 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 titled Riemann's Hypothesis and Tests for Primality.[5]


gollark: Yes, *that's* ridiculous, but sometimes it isn't.
gollark: JS actually is faster than python generally.
gollark: Or you write still less-performant high-level code, which is what you actually need most of the t ime.
gollark: Assembly is obviously better for... I don't know, when you actually need to implement interrupt handlers or something, or when you have a small bit of computing which needs to be run as fast as possible, but most practical stuff is *not* that.
gollark: Actually, it might be better to write it as OpenCL if it parallelizes well enough to run on GPUs.

References
  1. "Gary Miller | Carnegie Mellon University - Computer Science Department". www.csd.cs.cmu.edu.
  2. "Citation for Gary Miller's ACM Fellow Award". Archived from the original on 2009-06-21. Retrieved 2008-09-11.
  3. "ACM Awards Knuth Prize to Creator of Problem-Solving Theory and Algorithms" (Press release). Association for Computing Machinery. Archived from the original on 3 November 2013. Retrieved 31 October 2013.
  4. "Gary Miller | Simons Institute for the Theory of Computing". simons.berkeley.edu.
  5. "Miller's thesis" (PDF).
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.