World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
34
Citations
5824
World Ranking
12069
National Ranking
4918

Research.com Recognitions

  • 1998 - ACM Fellow Throughout his career Alan L. Selman has been an influential contributor to computational complexity theory and a dedicated professional within the academic comuter science community.

Overview

Alan L. Selman was affiliated with the University at Buffalo, State University of New York in the United States. Their primary field of study was computer science, with particular focus on the subfields of artificial intelligence and computational theory and mathematics.

Their research topics centered around logic, reasoning, and knowledge, as well as logic, programming, and type systems, and advanced algebra and logic.

Selman's publication record includes works published in the venue Theory of Computing Systems. One notable paper is titled In Memoriam - Alan Selman (1941 - 2021), published in 2021 in the journal Theory of Computing Systems.

Frequent co-authors included:

  • Mitsunori Ogihara
  • Paul Axt
  • Christian Glaßer
  • Andrew Hughes
  • Nils Wisiol

The award received by Alan L. Selman included recognition as an ACM Fellow in 1998 for contributions to computational complexity theory and involvement within the academic computer science community.

Best Publications

  • A comparison of polynomial time reducibilities

    Richard E. Ladner;Nancy A. Lynch;Alan L. Selman

  • Comparison of polynomial-time reducibilities

    Richard Ladner;Nancy Lynch;Alan Selman

  • P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP

    Alan L. Selman

  • Complexity measures for public-key cryptosystems

    Joachim Grollmann;Alan L. Selman

  • The complexity of promise problems with applications to public-key cryptography

    Shimon Even;Alan L. Selman;Yacov Yacobi

  • A taxonomy of complexity classes of functions

    Alan L. Selman

  • Complexity theory retrospective II

    Lane A. Hemaspaandra;Alan L. Selman

  • Quantitative relativizations of complexity classes

    Ronald V. Book;Timothy J. Long;Alan L. Selman

  • Computability and complexity theory

    Steven Homer;Alan L. Selman

  • Turing Machines and the Spectra of First-Order Formulas

    Neil D. Jones;Alan L. Selman

  • Turing machines and the spectra of first-order formulas with equality

    Neil D. Jones;Alan L. Selman

  • Reductions on NP and P-selective sets

    Alan L. Selman

  • Oracles for structural properties: the isomorphism problem and public-key cryptography

    Steven Homer;Alan L. Selman

  • A second step toward the polynomial hierarchy

    Theodore P. Baker;Alan L. Selman

  • Analogues of semirecursive sets and effective reducibilities to the study of NP complexity

    Alan L. Selman

  • Computing Solutions Uniquely Collapses the Polynomial Hierarchy

    Lane A. Hemaspaandra;Ashish V. Naik;Mitsunori Ogihara;Alan L. Selman

  • Relativizing complexity classes with sparse oracles

    Timothy J. Long;Alan L. Selman

  • Arithmetical Reducibilities I

    Alan L. Selman

  • Disjoint NP-Pairs

    Christian Glasser;Alan L. Selman;Samik Sengupta;Liyu Zhang

  • A survey of one-way functions in complexity theory

    Alan L. Selman

Frequent Co-Authors

Mitsunori Ogihara
Mitsunori Ogihara University of Miami
Lane A. Hemaspaandra
Lane A. Hemaspaandra University of Rochester
Arnold L. Rosenberg
Arnold L. Rosenberg University of Massachusetts Amherst
Jin-Yi Cai
Jin-Yi Cai University of Wisconsin–Madison
Edward A. Fox
Edward A. Fox Virginia Tech
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Neil D. Jones
Neil D. Jones University of Copenhagen
Richard E. Ladner
Richard E. Ladner University of Washington
Lance Fortnow
Lance Fortnow Illinois Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Considering studying Computer Science in the USA, but looking for flexibility? Online computer science programs are a great alternative for students needing to balance studies with work or personal commitments. Many universities now offer computer science degree online options, some of which can be completed at an accelerated pace.

Cost and academic eligibility are common concerns. There are numerous cheap online college classes available, making quality education more accessible. Additionally, if your academic background is a concern, you’ll find the best colleges for low gpa that accept students with varying GPAs, so you don’t have to put your ambitions on hold.

A Computer Science degree opens pathways beyond traditional IT roles. If you are curious about career diversity, you might also explore “what can i do with an environmental science degree” to see how tech skills intersect with fields like environmental science. Online learning provides the flexibility and variety to launch a successful and adaptable career.

Best Scientists Citing Alan L. Selman

Trending Scientists

Recently Published Articles