Alan Selman

| birth_place = New York City, NY | death_date = | death_place = Medford, NJ | field = Theoretical computer science
Mathematics | thesis_title = Arithmetical Reducibilities and Sets of Formulas Valid in Finite Structures | thesis_url = https://www.proquest.com/docview/302587361?pq-origsite=gscholar&fromopenview=true | thesis_year = 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) | 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 | 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 | spouse = Sharon Selman }} Alan Louis Selman (April 2, 1941 – January 22, 2021) 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. Provided by Wikipedia