Andrew Odlyzko
| Andrew Odlyzko | |
|---|---|
| Born |
23 July 1949 (age 67) Tarnów, Poland |
| Fields | Mathematics |
| Institutions | University of Minnesota |
| Alma mater |
Massachusetts Institute of Technology (Ph.D., Mathematics, 1975) California Institute of Technology (B.S., M.S., Mathematics) |
| Doctoral advisor | Harold Stark |
Andrew Michael Odlyzko (born 23 July 1949) is a mathematician and a former head of the University of Minnesota's Digital Technology Center and of the Minnesota Supercomputing Institute.
Odlyzko received his B,S, and M.S. in mathematics from the California Institute of Technology and his Ph.D. from the Massachusetts Institute of Technology in 1975. In the field of mathematics he has published extensively on analytic number theory, computational number theory, cryptography, algorithms and computational complexity, combinatorics, probability, and error-correcting codes. In the early 1970s, he was a co-author (with D. Kahaner and Gian-Carlo Rota) of one of the founding papers of the modern umbral calculus. In 1985 he and Herman te Riele disproved the Mertens conjecture. In mathematics, he is probably known best for his work on the Riemann zeta function, which led to the invention of improved algorithms, including the Odlyzko–Schönhage algorithm, and large-scale computations, which stimulated extensive research on connections between the zeta function and random matrix theory.
More recently, he has worked on communication networks, electronic publishing, economics of security and electronic commerce.
...
Wikipedia