Alan Selman

Alan L. Selman
Alan L. Selman
Born(1941-04-02)April 2, 1941
New York City, NY
DiedJanuary 22, 2021(2021-01-22) (aged 79)
Medford, NJ
Alma materBS, City College of New York, 1962
MA, University of California, Berkeley, 1964
PhD, Pennsylvania State University, 1970
Known forStructural complexity theory
SpouseSharon Selman
AwardsACM 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
FieldsTheoretical computer science
Mathematics
ThesisArithmetical Reducibilities and Sets of Formulas Valid in Finite Structures (1970)
Doctoral advisorPaul Axt
Doctoral studentsJoachim 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]

  1. ^ Cite error: The named reference sharon was invoked but never defined (see the help page).
  2. ^ Cite error: The named reference fenner was invoked but never defined (see the help page).
  3. ^ Cite error: The named reference hemaspaandra was invoked but never defined (see the help page).