Alan L. SelmanProfessor

AWARDS AND HONORS

Humboldt Research Award, 2005
Chancellor’s Award for Excellence in Scholarship and Creative Activities, State University of New York,
2004
ACM-SIGACT Distinguished Service Award, 2001
Exceptional Scholar Award, University at Buffalo, 2002
Honored at the Sixteenth Annual IEEE Conference on Computational Complexity, June 2001, with a
Special Session preceding the conference of three retrospective talks on my work and a Dedication in the
Conference Proceedings
Fellow of the ACM, 1997
Invitation Fellowship from the Japan Society for the Promotion of Science, 1996
IEEE Computer Society Meritorious Service Award for founding the Symposium on Structure in
Complexity Theory, and serving as its Conference Chairman, 1986–1988
Fulbright Award, 1981–1982
Faculty Improvement Leave from Iowa State University, 1981–1982
Citations in Who’s Who in America, Who’s Who in the Media and Communications, and American Men
and Women in Science
RESEARCH GRANTS
1. Complexity of Feasible Computations, NSF, 2003–2006, $150,000
2. Workshop on Research in Theoretical Computer Science, NSF, 1999, $25,942
3. U.S.-Japan Cooperative Research, with J-Y. Cai, K. Regan, and M. Ogihara, NSF, 1998–2001,
$30,950
4. Complexity of Feasible Computations, with S. Homer, NSF, 1994–1997, $360,794
5. Wide Area Technical Report Server, with K. Maly, E. Fox, and J. French, NSF, 1993, $22,736
6. Cooperative Research in Complexity Theory, with S. Homer and L. Longpre, International ´
Programs, Netherlands, NSF, 1992–1994, $12,475
7. Complexity of Feasible Computations, NSF, 1990–1993, $199,782
8. Structure in Complexity Theory Conference, with S. Mahaney, NSF, 1986, $15,000
9. Complexity of Feasible Computations, NSA, 1987–1990, $215,000
10. Multiple Awards with the title “Complexity of Feasible Computations,” NSF, 1982–1987
11. Multiple Awards with the title “Studies in Nondeterminism and Relative Computation,” NSF,
1975–1982