Alan Selman
Alan Selman
Professor emeritus of computer science and engineering, University at Buffalo
Verified email at buffalo.edu
Title
Cited by
Cited by
Year
A comparison of polynomial time reducibilities
RE Ladner, NA Lynch, AL Selman
Theoretical Computer Science 1 (2), 103-123, 1975
5061975
Complexity measures for public-key cryptosystems
J Grollmann, AL Selman
SIAM Journal on Computing 17 (2), 309-335, 1988
3901988
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
2981984
P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
AL Selman
International Colloquium on Automata, Languages, and Programming, 546-555, 1979
2271979
A taxonomy of complexity classes of functions
AL Selman
Journal of Computer and System Sciences 48 (2), 357-381, 1994
2081994
Quantitative relativizations of complexity classes
RV Book, TJ Long, AL Selman
SIAM Journal on Computing 13 (3), 461-487, 1984
1861984
Computability and complexity theory
S Homer, AL Selman
Springer Science & Business Media, 2011
1642011
Reductions on NP and P-selective sets
AL Selman
Theoretical Computer Science 19 (3), 287-304, 1982
1521982
Turing machines and the spectra of first-order formulas
ND Jones, AL Selman
The Journal of Symbolic Logic 39 (1), 139-150, 1974
1501974
Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
AL Selman
Information and Control 52 (1), 36-51, 1982
1031982
A second step toward the polynomial hierarchy
TP Baker, AL Selman
Theoretical Computer Science 8 (2), 177-187, 1979
1021979
Relativizing complexity classes with sparse oracles
TJ Long, AL Selman
Journal of the ACM (JACM) 33 (3), 618-627, 1986
931986
Arithmetical reducibilities I
AL Selman
Mathematical Logic Quarterly 17 (1), 335-350, 1971
831971
Completeness of calculii for axiomatically defined classes of algebras
AL Selman
Carnegie Mellon University, 1971
791971
A survey of one-way functions in complexity theory
AL Selman
Mathematical systems theory 25 (3), 203-221, 1992
741992
Natural self-reducible sets
AL Selman
SIAM Journal on Computing 17 (5), 989-996, 1988
731988
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
701996
Computing solutions uniquely collapses the polynomial hierarchy
LA Hemaspaandra, AV Naik, M Ogihara, AL Selman
SIAM Journal on Computing 25 (4), 697-708, 1996
701996
Polynomial time enumeration reducibility
AL Selman
SIAM Journal on Computing 7 (4), 440-457, 1978
671978
Oracles for structural properties: The isomorphism problem and public-key cryptography
S Homer, AL Selman
Journal of Computer and System Sciences 44 (2), 287-301, 1992
661992
The system can't perform the operation now. Try again later.
Articles 1–20