Alan J. S. Selman

Alan J. S. Selman was an American mathematician and computer scientist known for influential work in computational complexity theory, particularly in structural complexity, reducibilities, and classes of NP problems. His research connected fundamental questions in theoretical computer science with mathematical logic and recursion theory, and he served in leadership roles that shaped curricula and research at major institutions. Selman collaborated broadly across the fields represented by prominent researchers and institutions worldwide.

Early life and education

Selman was born in 1941 and educated in the United States, completing undergraduate studies and graduate work that bridged mathematics and computer science. He studied at the University of Michigan and pursued doctoral research at Harvard University, where he encountered researchers connected to the histories of Alonzo Church, Kurt Gödel, Alan Turing, and the development of recursion theory. During his formative years he interacted with scholars associated with Princeton University, Massachusetts Institute of Technology, and the Institute for Advanced Study, which influenced his orientation toward formal models and complexity.

Academic career and positions

Selman held academic appointments at the University at Buffalo within the State University of New York system, contributing to departmental development and graduate training linked to other programs at Cornell University, University of California, Berkeley, and Stanford University. He taught courses and supervised students who later joined faculties at institutions such as Carnegie Mellon University, University of Illinois Urbana–Champaign, and University of Toronto. Selman participated in conferences organized by entities including the Association for Computing Machinery, the IEEE Computer Society, and the European Association for Theoretical Computer Science, and he served on program committees alongside scholars from Harvard University, Yale University, and Columbia University.

Research contributions and legacy

Selman's research addressed central questions about reducibility, structural properties of complexity classes, and the interplay between nonuniformity and completeness. He produced results concerning many-one reducibilities and polynomial-time degrees that connected to work by Richard Karp, John Cook, Stephen Cook, Leonid Levin, and Juris Hartmanis. His analysis of complexity classes illuminated relationships among P, NP, co-NP, and other classes studied by researchers at Bell Labs, IBM Research, and the Los Alamos National Laboratory. Selman explored promise problems and generalized notions of hardness akin to concepts later developed by investigators at Microsoft Research and the Simons Institute for the Theory of Computing. His collaborations and citations involved scholars affiliated with Rutgers University, University of Wisconsin–Madison, and Princeton University.

He contributed to the formal theory of reductions and degrees that built on foundations laid by Emil Post and Alonzo Church and linked to subsequent developments by Michael Rabin, Dana Scott, and Noam Chomsky. Selman’s work influenced study of complete sets, one-way functions, and resource-bounded measure studied at venues such as the Annual ACM Symposium on Theory of Computing and the International Colloquium on Automata, Languages and Programming. His legacy includes a body of results cited in monographs produced by authors at Cambridge University Press, Oxford University Press, and academic lecture series at École Polytechnique.

Awards and honors

Over his career Selman received recognition from academic societies and institutions reflecting his contributions to theory. He delivered invited talks at meetings of the American Mathematical Society and the Association for Symbolic Logic and was honored with named lectureships connected to departments at SUNY campuses and partner institutions such as Colgate University and Rochester Institute of Technology. Colleagues organized workshops and special sessions in his memory at conferences hosted by the European Association for Theoretical Computer Science and the International Symposium on Mathematical Foundations of Computer Science.

Selected publications

- "Complexity Measures and Reducibilities" — contributions in conference proceedings appearing alongside work by Richard Lipton, Michael Sipser, and Juraj Hromkovič. - Papers on polynomial-time degrees and completeness that were cited in surveys by Lance Fortnow, Steve Homer, and Mihalis Yannakakis. - Articles addressing promise problems and generalized reductions referenced in collections edited by Ronald Fagin, Leslie Valiant, and László Babai. - Expository chapters and invited survey articles included in volumes from Cambridge University Press and proceedings of the Royal Society.

Category:Theoretical computer scientists Category:Mathematicians from New York