Follow
Alan Selman
Alan Selman
Professor emeritus of computer science and engineering, University at Buffalo
No verified email
Title
Cited by
Cited by
Year
Comparison of polynomial-time reducibilities
R Ladner, N Lynch, A Selman
Proceedings of the sixth annual ACM symposium on Theory of computing, 110-121, 1974
5331974
Complexity measures for public-key cryptosystems
J Grollmann, AL Selman
SIAM Journal on Computing 17 (2), 309-335, 1988
4191988
The complexity of promise problems with applications to public-key cryptography
S Even, AL Selman, Y Yacobi
Information and control 61 (2), 159-173, 1984
3381984
P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
AL Selman
Mathematical Systems Theory 13, 55-65, 1979
2331979
A taxonomy of complexity classes of functions
AL Selman
Journal of Computer and System Sciences 48 (2), 357-381, 1994
2141994
Computability and complexity theory
S Homer, AL Selman, S Homer
Springer, 2011
1992011
Quantitative relativizations of complexity classes
RV Book, TJ Long, AL Selman
SIAM Journal on Computing 13 (3), 461-487, 1984
1891984
Turing machines and the spectra of first-order formulas with equality
ND Jones, AL Selman
Proceedings of the fourth annual ACM symposium on Theory of computing, 157-167, 1972
1591972
Reductions on NP and P-selective sets
AL Selman
Theoretical Computer Science 19 (3), 287-304, 1982
1441982
A second step toward the polynomial hierarchy
TP Baker, AL Selman
Theoretical Computer Science 8 (2), 177-187, 1979
1101979
Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
AL Selman
Information and Control 52 (1), 36-51, 1982
1071982
Arithmetical reducibilities.
AL Selman
Carnegie Mellon University, 1971
1011971
Relativizing complexity classes with sparse oracles
TJ Long, AL Selman
Journal of the ACM (JACM) 33 (3), 618-627, 1986
941986
Computing solutions uniquely collapses the polynomial hierarchy
LA Hemaspaandra, AV Naik, M Ogihara, AL Selman
SIAM Journal on Computing 25 (4), 697-708, 1996
931996
Completeness of calculii for axiomatically defined classes of algebras
AL Selman
Carnegie Mellon University, 1971
921971
A survey of one-way functions in complexity theory
AL Selman
Mathematical systems theory 25 (3), 203-221, 1992
761992
P-selective sets and reducing search to decision vs self-reducibility
E Hemaspaandra, AV Naik, M Ogihara, AL Selman
Journal of Computer and System Sciences 53 (2), 194-209, 1996
751996
Natural self-reducible sets
AL Selman
SIAM Journal on Computing 17 (5), 989-996, 1988
711988
Polynomial time enumeration reducibility
AL Selman
SIAM Journal on Computing 7 (4), 440-457, 1978
681978
Oracles for structural properties: The isomorphism problem and public-key cryptography
S Homer, AL Selman
Proceedings. Structure in Complexity Theory Fourth Annual Conference, 3, 4 …, 1989
671989
The system can't perform the operation now. Try again later.
Articles 1–20