AOL Web Search

  1. About 1,940,000 search results
  1. Web results:
  2. Gary Miller (computer scientist) - Wikipedia

    en.wikipedia.org/wiki/Gary_Miller_(computer...

    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 L Miller. Professor of Computer Science. glmiller cs cmu edu. Office: 7215 Gates Hillman Center. Phone: 412-268-2631. US Mail: School of Computer Science. Carnegie Mellon University.

  4. Gary Miller - Simons Institute for the Theory of Computing

    simons.berkeley.edu/people/gary-miller

    Gary Miller received his PhD from UC Berkeley in 1975 under the supervision 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.

  5. Gary Miller (computer scientist) - Wikiwand

    www.wikiwand.com/en/Gary_Miller_(computer_scientist)

    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 made an ACM Fellow in 2002 and won the Knuth Prize in 2013.

  6. Gary Miller | Simons Institute for the Theory of Computing

    old.simons.berkeley.edu/people/gary-miller

    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.

  7. ‪Gary L. Miller‬ - ‪Google Scholar‬

    scholar.google.com/citations?user=umm-i20AAAAJ

    Riemann's hypothesis and tests for primality. GL Miller. Proceedings of the seventh annual ACM symposium on Theory of computing, 234-239. , 1975. 1412. 1975. Optimal route selection in a content delivery network. CF Bornstein, TK Canfield, GL Miller, SB Rao, R Sundaram. US Patent 7,274,658.

  8. Gary L. Miller. Todd Phillips. The recent Sparse Voronoi Refinement (SVR) Algorithm for mesh generation has the fastest theoretical bounds for runtime and memory usage. We present a robust ...

  9. Gary Miller | Carnegie Mellon University Computer Science ...

    www.csd.cs.cmu.edu/people/faculty/gary-miller

    My main interest is in sequential and parallel algorithm design. Of particular interest are problems that arise in scientific computation and image processing. We have been working on three classes of problems.

  10. Gary MILLER | Carnegie Mellon University, PA | CMU | Computer ...

    www.researchgate.net/profile/Gary-Miller-2/2

    Gary MILLER | Carnegie Mellon University, PA | CMU | Computer Science Department | Research profile - Page 2. Gary MILLER | Cited by 5,288 | of Carnegie Mellon University, PA (CMU) | Read 141 ...

  11. Gary Miller | DeepAI

    deepai.org/profile/gary-miller

    Professor of Computer Science at Carnegie Mellon University. Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser