View source for Biography:Gary Miller (computer scientist)

{{short description|American computer scientist}}
{{Infobox scientist
| name              = Gary Miller
| image             = Strassen Knuth Prize presentation.jpg
| image_size        = 200px
| caption           = Gary Miller (left) with [[Biography:Volker Strassen|Volker Strassen]]
| birth_date        =
| birth_place       = 
| death_date        = 
| death_place       = 
| citizenship       = 
| nationality       = 
| ethnicity         = 
| fields            = 
| workplaces        = [[Organization:Carnegie Mellon University|Carnegie Mellon University]]
| alma_mater        = 
| doctoral_advisor  = [[Biography:Manuel Blum|Manuel Blum]]
| academic_advisors = 
| doctoral_students = [[Biography:Susan Landau|Susan Landau]]<br />[[Biography:F. Thomson Leighton|F. Thomson Leighton]]<br />[[Biography:Shang-Hua Teng|Shang-Hua Teng]]<br />[[Biography:Jonathan Shewchuk|Jonathan Shewchuk]]
| notable_students  = 
| thesis_url        = https://cs.uwaterloo.ca/research/tr/1975/CS-75-27.pdf
| thesis_title      = Riemann's Hypothesis and Tests for Primality
| thesis_year       = 1975
| known_for         = [[Miller–Rabin primality test]]
| author_abbrev_bot = 
| author_abbrev_zoo = 
| influences        = 
| influenced        = 
| awards            = Paris Kanellakis Award (2003)  Knuth Prize (2013)
| religion          = 
| signature         = <!--(filename only)-->
| footnotes         =  
}}
'''Gary Lee Miller''' is a professor of Computer Science at [[Organization:Carnegie Mellon University|Carnegie Mellon University]], Pittsburgh, United States.<ref>{{cite web |title=Gary Miller {{!}} Carnegie Mellon University - Computer Science Department |url=https://www.csd.cs.cmu.edu/people/faculty/gary-miller |website=www.csd.cs.cmu.edu}}</ref> In 2003 he won the  [[Organization:Association for Computing Machinery|ACM]] Paris Kanellakis Award (with three others) for the [[Miller–Rabin primality test]]. He was made an [[ACM Fellow]] in 2002<ref>{{Cite web |url=http://fellows.acm.org/fellow_citation.cfm?id=1556943&srt=alpha&alpha=M |title=Citation for Gary Miller's ACM Fellow Award |access-date=2008-09-11 |archive-url=https://web.archive.org/web/20090621014853/http://fellows.acm.org/fellow_citation.cfm?id=1556943&srt=alpha&alpha=M |archive-date=2009-06-21 |url-status=dead }}</ref> and won the Knuth Prize in 2013.<ref>{{Cite press release|url=http://www.acm.org/press-room/awards/sigact-knuth-prize-13/view|title=ACM Awards Knuth Prize to Creator of Problem-Solving Theory and Algorithms|publisher=[[Organization:Association for Computing Machinery|Association for Computing Machinery]]|access-date=31 October 2013|archive-url=https://web.archive.org/web/20131103145610/http://www.acm.org/press-room/awards/sigact-knuth-prize-13/view|archive-date=3 November 2013|url-status=dead}}</ref>

== Early life and career ==
Miller received his [[Social:Doctor of Philosophy|Ph.D.]] from the [[Organization:University of California, Berkeley|University of California, Berkeley]] in 1975 under the direction of [[Biography:Manuel Blum|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 [[Organization:Carnegie Mellon University|Carnegie Mellon University]], where he is now Professor of Computer Science. In addition to his influential thesis on [[Computational number theory|computational number theory]] and primality testing, Miller has worked on many central topics in [[Computer science|computer science]], including [[Graph isomorphism|graph isomorphism]], parallel algorithms, [[Computational geometry|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.<ref>{{cite web |title=Gary Miller {{!}} Simons Institute for the Theory of Computing |url=https://simons.berkeley.edu/people/gary-miller |website=simons.berkeley.edu|date=2 July 2013 }}</ref> His Ph.D. thesis was titled ''Riemann's Hypothesis and Tests for Primality''.<ref>{{cite web |title=Miller's thesis |url=https://www.cs.cmu.edu/~glmiller/Publications/Papers/Mi76.pdf}}</ref>

==References==
<References/>

==External links==
*[https://www.cs.cmu.edu/~glmiller/ Gary Miller's web page] at Carnegie Mellon.
*[http://genealogy.math.ndsu.nodak.edu/id.php?id=31473 Gary Miller] at the [[Mathematics Genealogy Project]].
* Miller's original paper "[http://portal.acm.org/citation.cfm?id=803773&dl=ACM&coll=portal Riemann's Hypothesis and Tests for Primality]"

{{Kanellakis Award laureates}}
{{Knuth Prize laureates}}

{{DEFAULTSORT:Miller, Gary}}
[[Category:American computer scientists]]
[[Category:Theoretical computer scientists]]

{{Sourceattribution|Gary Miller (computer scientist)}}