Alan L. Selman | |
---|---|
![]() Alan L. Selman | |
Born | |
Died | January 22, 2021 | (aged 79)
Alma mater | BS, City College of New York, 1962 MA, University of California, Berkeley, 1964 PhD, Pennsylvania State University, 1970 |
Known for | Structural complexity theory |
Spouse | Sharon Selman |
Awards | ACM Fellow Fulbright Award Humboldt Research Award University at Buffalo Exceptional Scholar Award SUNY Chancellor's Award for Excellence in Scholarship and Creative Activities Japan Society for the Promotion of Science Invitation Fellowship ACM SIGACT Distinguished Service Prize IEEE Computer Society Meritorious Service Award for founding the Symposium on Structure in Complexity |
Scientific career | |
Fields | Theoretical computer science Mathematics |
Thesis | Arithmetical Reducibilities and Sets of Formulas Valid in Finite Structures (1970) |
Doctoral advisor | Paul Axt |
Doctoral students | Joachim Grollman John Geske Roy Rubinstein Ashish Naik A. Pavan S. Sengupta Liyu Zhang Dung Nguyeen Andrew Hughes Mitsunori Ogihara (postdoctoral advisee) Edith Hemaspaandra (postdoctoral advisee) Christian Glasser (postdoctoral advisee) |
Alan Louis Selman (April 2, 1941 – January 22, 2021)[1] was a mathematician and theoretical computer scientist known for his research on structural complexity theory, the study of computational complexity in terms of the relation between complexity classes rather than individual algorithmic problems.[2][3]