This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Gary Miller (computer scientist) | |
|---|---|
| Name | Gary Miller |
| Birth date | 1953 |
| Birth place | United States |
| Nationality | American |
| Fields | Computer science, Mathematics |
| Workplaces | Carnegie Mellon University, Princeton University, Rutgers University, University of California, Berkeley |
| Alma mater | Princeton University, University of Illinois Urbana–Champaign |
| Doctoral advisor | Richard M. Karp |
| Known for | Primality testing, randomized algorithms, computational number theory |
Gary Miller (computer scientist) is an American computer scientist and mathematician noted for seminal work on randomized algorithms and computational number theory. He made foundational contributions to primality testing, complexity theory, and algorithmic number theory, influencing areas associated with ACM, SIAM, and research groups at Princeton University and Carnegie Mellon University. His work connects to major problems and techniques studied at institutions such as Bell Labs, IBM Research, and conferences like STOC, FOCS, and ICALP.
Miller earned undergraduate and graduate degrees at institutions with storied programs: he completed a doctorate at Princeton University under the supervision of Richard M. Karp, after earlier study at the University of Illinois Urbana–Champaign. During his formative years he engaged with research communities centered at MIT, Harvard University, and the Institute for Advanced Study and interacted with contemporaries connected to Andrew Yao, Silvio Micali, and Leslie Valiant. His doctoral cohort included students who later joined faculties at Stanford University, University of California, Berkeley, and Cornell University.
Miller has held faculty and research positions at several prominent centers: he served on the mathematics and computer science faculties at Rutgers University and later at Carnegie Mellon University, and he has maintained collaborations with researchers at Princeton University and University of California, Berkeley. He has been a visiting scholar at organizations such as Bell Labs, IBM Research, and the Mathematical Sciences Research Institute. Miller’s professional activities have included program committee membership for conferences like STOC, FOCS, and SODA, and editorial roles for journals associated with ACM, IEEE Computer Society, and SIAM.
Miller is best known for proposing an early randomized polynomial-time algorithm for primality testing that anticipates deterministic breakthroughs and connects to work by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena (AKS). His 1976 randomized test for primality used techniques related to the Generalized Riemann Hypothesis and probabilistic number theory, and it influenced later deterministic and randomized tests developed by researchers at Bell Labs and IBM Research. Miller’s research spans randomized algorithms, complexity classes like RP and BPP, and structural questions tied to NP and co-NP. He produced influential results on algorithmic number theory, including algorithms for discrete logarithms and factorization that connect to techniques pursued by Carl Pomerance, Peter Shor, and Don Knuth.
His work on randomized complexity includes reductions and algorithmic paradigms that tie to the Lovász Local Lemma, random walks on graphs as studied by László Lovász, and the design of efficient randomized data-structures used in systems at Google and Microsoft Research. Miller’s contributions to algebraic algorithmics relate to polynomial identity testing and to algebraic geometry methods exploited by scholars at ETH Zurich and University of Bonn. Collaborations and citations link his work to that of Richard Karp, Michael Sipser, Sanjeev Arora, Avi Wigderson, and Oded Goldreich.
Miller’s contributions have been recognized by invitations to deliver plenary and distinguished lectures at venues such as ICM-affiliated workshops, STOC, and FOCS. He has been elected to program committees and advisory boards for institutes including MSRI and has received recognition from professional societies including ACM and SIAM. His work is frequently cited in award-winning research connected to recipients of the Gödel Prize and the Turing Award.
- Miller, G. L., "Riemann's Hypothesis and Tests for Primality", Proceedings of a major conference, 1976. Cited alongside work by Agrawal, Kayal, Saxena, and commentary in Annals of Mathematics discussions. - Miller, G. L., papers on randomized complexity and algebraic algorithms, appearing in proceedings of STOC and FOCS, and journals associated with ACM and SIAM. - Collaborative works with scholars connected to Princeton University and Carnegie Mellon University on number-theoretic algorithms and randomized methods, cited in textbooks by Knuth and survey articles in Communications of the ACM.
Category:American computer scientists Category:Theoretical computer scientists Category:Princeton University alumni