Richard J. Lipton | |
---|---|
Born | September 6, 1946 |
Fields | computer science |
Institutions |
Yale Berkeley Princeton Georgia Tech |
Alma mater | Carnegie Mellon |
Thesis | On Synchronization Primitive Systems (1973) |
Doctoral advisor | David Parnas |
Doctoral students |
Dan Boneh Avi Wigderson Chee Yap |
Known for | Karp–Lipton theorem and planar separator theorem |
Notable awards | Knuth Prize (2014) |
Richard Jay "Dick" Lipton (born September 6, 1946) is an American computer scientist who has worked in computer science theory, cryptography, and DNA computing. Lipton is Associate Dean of Research, Professor, and the Frederick G. Storey Chair in Computing in the College of Computing at the Georgia Institute of Technology.
In 1968, Lipton received his undergraduate degree in mathematics from Case Western Reserve University. In 1973, he received his Ph.D. from Carnegie Mellon University; his dissertation, supervised by David Parnas, is entitled On Synchronization Primitive Systems. After graduating, Lipton taught at Yale 1973–1978, at Berkeley 1978–1980, and then at Princeton 1980–2000. Since 2000, Lipton has been at Georgia Tech. While at Princeton, Lipton worked in the field of DNA computing. Since 1996, Lipton has been the chief consulting scientist at Telcordia.
In 1980, along with Richard M. Karp, Lipton proved that if SAT can be solved by Boolean circuits with a polynomial number of logic gates, then the polynomial hierarchy collapses to its second level.