Alan Selman
Alan Selman
Professor emeritus of computer science and engineering, University at Buffalo
No verified email
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
5011975
Complexity measures for public-key cryptosystems
J Grollmann, AL Selman
SIAM Journal on Computing 17 (2), 309-335, 1988
3961988
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
3291984
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
2221979
A taxonomy of complexity classes of functions
AL Selman
Journal of Computer and System Sciences 48 (2), 357-381, 1994
2091994
Quantitative relativizations of complexity classes
RV Book, TJ Long, AL Selman
SIAM Journal on Computing 13 (3), 461-487, 1984
1821984
Computability and complexity theory
S Homer, AL Selman
Springer Science & Business Media, 2011
1792011
Turing machines and the spectra of first-order formulas
ND Jones, AL Selman
The Journal of Symbolic Logic 39 (1), 139-150, 1974
1521974
Reductions on NP and P-selective sets
AL Selman
Theoretical Computer Science 19 (3), 287-304, 1982
1501982
Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
AL Selman
Information and Control 52 (1), 36-51, 1982
1071982
A second step toward the polynomial hierarchy
TP Baker, AL Selman
Theoretical Computer Science 8 (2), 177-187, 1979
1071979
Relativizing complexity classes with sparse oracles
TJ Long, AL Selman
Journal of the ACM (JACM) 33 (3), 618-627, 1986
901986
Arithmetical reducibilities.
AL Selman
Carnegie Mellon University, 1971
901971
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
781992
Computing solutions uniquely collapses the polynomial hierarchy
LA Hemaspaandra, AV Naik, M Ogihara, AL Selman
SIAM Journal on Computing 25 (4), 697-708, 1996
731996
Natural self-reducible sets
AL Selman
SIAM Journal on Computing 17 (5), 989-996, 1988
731988
Autoreducibility, mitoticity, and immunity
C Glaßer, M Ogihara, A Pavan, AL Selman, L Zhang
Journal of Computer and System Sciences 73 (5), 735-754, 2007
69*2007
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
691996
Polynomial time enumeration reducibility
AL Selman
SIAM Journal on Computing 7 (4), 440-457, 1978
661978
The system can't perform the operation now. Try again later.
Articles 1–20