- Home
- Best Scientists - Computer Science
- Alan L. Selman

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
31
Citations
5,097
107
World Ranking
9728
National Ranking
4414

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.

- Algorithm
- Algebra
- Computational complexity theory

Alan L. Selman mainly focuses on Combinatorics, Discrete mathematics, Time complexity, Complexity class and Existential quantification. In the subject of general Combinatorics, his work in Polynomial hierarchy is often linked to Bounded function, thereby combining diverse domains of study. While the research belongs to areas of Discrete mathematics, Alan L. Selman spends his time largely on the problem of PSPACE, intersecting his research to questions surrounding Polynomial and co-NP.

His Time complexity study combines topics in areas such as If and only if and Turing reducibility. His Complexity class study deals with Descriptive complexity theory intersecting with Computable analysis, Structural complexity theory, Computable function, PH and FP. His study in Existential quantification is interdisciplinary in nature, drawing from both Polynomial and Complement.

- A comparison of polynomial time reducibilities (395 citations)
- Complexity measures for public-key cryptosystems (283 citations)
- The complexity of promise problems with applications to public-key cryptography (258 citations)

His primary areas of study are Discrete mathematics, Combinatorics, Time complexity, Complexity class and Disjoint sets. His studies examine the connections between Discrete mathematics and genetics, as well as such issues in Turing machine, with regards to Algebra. His Combinatorics research includes themes of Computational complexity theory and Nondeterministic algorithm.

In general Time complexity study, his work on NP-complete often relates to the realm of Promise problem, thereby connecting several areas of interest. He interconnects Partial function, PSPACE and Polynomial in the investigation of issues within Complexity class. His Disjoint sets research includes elements of Proof complexity, Propositional proof system and Open problem.

- Discrete mathematics (67.86%)
- Combinatorics (60.71%)
- Time complexity (30.00%)

- Discrete mathematics (67.86%)
- Combinatorics (60.71%)
- Disjoint sets (20.00%)

His primary scientific interests are in Discrete mathematics, Combinatorics, Disjoint sets, Turing machine and NEXPTIME. His work on Time complexity and Conjecture as part of general Discrete mathematics research is often related to Current and Propositional formula, thus linking different fields of science. His research on Combinatorics focuses in particular on Boolean hierarchy.

His work deals with themes such as Open problem, Focus and Propositional proof system, which intersect with Disjoint sets. His Turing machine research is multidisciplinary, relying on both Theoretical computer science, True quantified Boolean formula and Existential quantification. His research integrates issues of Complexity class and Descriptive complexity theory in his study of Theoretical computer science.

- Canonical disjoint NP-pairs of propositional proof systems (21 citations)
- Autoreducibility, mitoticity, and immunity (18 citations)
- Splitting NP-Complete Sets (15 citations)

- Algorithm
- Real number
- Algebra

His scientific interests lie mostly in Discrete mathematics, Combinatorics, NEXPTIME, Disjoint sets and Boolean hierarchy. In the field of Discrete mathematics, his study on Disjoint union overlaps with subjects such as Scope. His Combinatorics research is multidisciplinary, incorporating elements of Public key cryptosystem and Propositional proof system.

The study incorporates disciplines such as Collatz conjecture, Lonely runner conjecture and Conjecture in addition to Disjoint sets. His Boolean hierarchy research incorporates elements of Polynomial, NP-complete and Redundancy. He has researched PSPACE in several fields, including Time complexity, Complexity class and Boolean function.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

A comparison of polynomial time reducibilities

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

Theoretical Computer Science **(1975)**

523 Citations

Comparison of polynomial-time reducibilities

Richard Ladner;Nancy Lynch;Alan Selman.

symposium on the theory of computing **(1974)**

502 Citations

Complexity measures for public-key cryptosystems

Joachim Grollmann;Alan L. Selman.

SIAM Journal on Computing **(1988)**

405 Citations

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

Shimon Even;Alan L. Selman;Yacov Yacobi.

Information & Computation **(1984)**

340 Citations

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

Alan L. Selman.

international colloquium on automata, languages and programming **(1979)**

233 Citations

A taxonomy of complexity classes of functions

Alan L. Selman.

Journal of Computer and System Sciences **(1994)**

214 Citations

Complexity theory retrospective II

Lane A. Hemaspaandra;Alan L. Selman.

**(1998)**

201 Citations

Computability and complexity theory

Steven Homer;Alan L. Selman.

**(2001)**

188 Citations

Quantitative relativizations of complexity classes

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

SIAM Journal on Computing **(1984)**

188 Citations

Turing Machines and the Spectra of First-Order Formulas

Neil D. Jones;Alan L. Selman.

Journal of Symbolic Logic **(1974)**

165 Citations

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

Contact us

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:

University of Miami

University of Rochester

University of Wisconsin–Madison

University of Massachusetts Amherst

Weizmann Institute of Science

Virginia Tech

University of Copenhagen

University of Washington

Illinois Institute of Technology

MIT

University of Washington

Seoul National University

University of Calgary

University of Illinois at Chicago

Chonnam National University

Tel Aviv University

Michigan State University

University of Freiburg

United States Department of Agriculture

Imperial College London

University of Western Ontario

University of Iowa

University of Bonn

National Research Council (CNR)

Stockholm University

Stanford University

Something went wrong. Please try again later.