Skip to content
Surf Wiki
Save to docs
engineering

From Surf Wiki (app.surf) — the open knowledge base

Gary Miller (computer scientist)

American computer scientist


American computer scientist

FieldValue
nameGary Miller
imageStrassen Knuth Prize presentation.jpg
image_size200px
captionGary Miller (left) with Volker Strassen
workplacesCarnegie Mellon University
doctoral_advisorManuel Blum
doctoral_studentsSusan Landau
F. Thomson Leighton
Jakub Pachocki
Shang-Hua Teng
Jonathan Shewchuk
thesis_urlhttps://cs.uwaterloo.ca/research/tr/1975/CS-75-27.pdf
thesis_titleRiemann's Hypothesis and Tests for Primality
thesis_year1975
known_forMiller–Rabin primality test
awardsParis Kanellakis Award (2003) Knuth Prize (2013)
signature

F. Thomson Leighton Jakub Pachocki Shang-Hua Teng Jonathan Shewchuk Gary Lee Miller is an American computer scientist who is a professor of computer science at Carnegie Mellon University. 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 and won the Knuth Prize in 2013.

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. His Ph.D. thesis was titled Riemann's Hypothesis and Tests for Primality.

References

References

  1. "Gary Miller {{!}} Carnegie Mellon University - Computer Science Department".
  2. "Citation for Gary Miller's ACM Fellow Award".
  3. "ACM Awards Knuth Prize to Creator of Problem-Solving Theory and Algorithms". [[Association for Computing Machinery]].
  4. (2 July 2013). "Gary Miller {{!}} Simons Institute for the Theory of Computing".
  5. "Miller's thesis".
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

Want to explore this topic further?

Ask Mako anything about Gary Miller (computer scientist) — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report