Prof. Dr. Alan L. Selman

Profile

Academic positionFull Professor
Research fieldsNumerical Analysis, Optimization, Simulation,Theoretical Computer Science
KeywordsDisjoint NP-pairs, autoreducibility, mitoticity, proof systems

Current contact address

CountryUnited States of America
CityBuffalo
InstitutionState University of New York at Buffalo
InstituteDepartment of Computer Science

Host during sponsorship

Prof. Dr. Klaus W. WagnerLehrstuhl für Informatik IV (Lehrstuhl für Theoretische Informatik), Julius-Maximilians-Universität Würzburg, Würzburg
Start of initial sponsorship01/01/2006

Programme(s)

2005Humboldt Research Award Programme

Nominator's project description

Professor Selman is one of the founders of structural complexity theory. To this date, he is one of the leading scientists in this field, which he---like only very few other researchers---has crucially shaped by his innovative ideas and scientific achievements. He initiated and significantly contributed to the development of many subfields of complexity theory, such as the theory of P-selective sets and the complexity-theoretic foundation of cryptography by the study of promise problems and one-way functions.

Publications (partial selection)

2008Christian Glasser, A. Pavan, Alan L. Selman, Liyu Zhang: Splitting NP-complete Sets. In: SIAM Journal on Computing, 2008, 1517-1535
2008Christian Glasser, Alan L. Selman, Stephen Travers, Klaus Wagner: The Complexity of Unions of Disjoint Sets. In: Journal of Computer and System Sciences, 2008, 1173-1187