| A comparison of polynomial time reducibilities RE Ladner, NA Lynch, AL Selman Theoretical Computer Science 1 (2), 103-123, 1975 | 505 | 1975 |
| Complexity measures for public-key cryptosystems J Grollmann, AL Selman SIAM Journal on Computing 17 (2), 309-335, 1988 | 385 | 1988 |
| 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 | 316 | 1984 |
| 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 | 222 | 1979 |
| A taxonomy of complexity classes of functions AL Selman Journal of Computer and System Sciences 48 (2), 357-381, 1994 | 203 | 1994 |
| Quantitative relativizations of complexity classes RV Book, TJ Long, AL Selman SIAM Journal on Computing 13 (3), 461-487, 1984 | 182 | 1984 |
| Computability and complexity theory S Homer, AL Selman Springer Science & Business Media, 2011 | 173 | 2011 |
| Reductions on NP and P-selective sets AL Selman Theoretical Computer Science 19 (3), 287-304, 1982 | 150 | 1982 |
| 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 | 150 | 1972 |
| A second step toward the polynomial hierarchy TP Baker, AL Selman Theoretical Computer Science 8 (2), 177-187, 1979 | 104 | 1979 |
| Analogues of semirecursive sets and effective reducibilities to the study of NP complexity AL Selman Information and Control 52 (1), 36-51, 1982 | 101 | 1982 |
| Relativizing complexity classes with sparse oracles TJ Long, AL Selman Journal of the ACM (JACM) 33 (3), 618-627, 1986 | 93 | 1986 |
| Arithmetical reducibilities. AL Selman Carnegie Mellon University, 1971 | 87 | 1971 |
| Completeness of calculii for axiomatically defined classes of algebras AL Selman Carnegie Mellon University, 1971 | 79 | 1971 |
| A survey of one-way functions in complexity theory AL Selman Mathematical systems theory 25 (3), 203-221, 1992 | 73 | 1992 |
| Computing solutions uniquely collapses the polynomial hierarchy LA Hemaspaandra, AV Naik, M Ogihara, AL Selman SIAM Journal on Computing 25 (4), 697-708, 1996 | 70 | 1996 |
| Natural self-reducible sets AL Selman SIAM Journal on Computing 17 (5), 989-996, 1988 | 69 | 1988 |
| Lecture notes in computer science TX Bui Springer, 1987 | 68* | 1987 |
| 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 | 67 | 1996 |
| 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 | 65 | 1992 |
Mitsunori OgiharaUniversity of MiamiVerified email at cs.miami.edu
