Alan Selman

Cited by

	All	Since 2019
Citations	4862	493
h-index	34	10
i10-index	65	10

240

120

180

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202443 70 87 91 99 122 91 100 208 160 174 199 138 120 115 94 123 86 111 148 234 189 185 124 131 97 117 109 79 131 62 75 61 60 52 84 171 59 79 48

Public access

View all

1 article

0 articles

available

not available

Based on funding mandates

Co-authors

Mitsunori OgiharaUniversity of MiamiVerified email at cs.miami.edu
Pavan AduriIowa State UniversityVerified email at cs.iastate.edu
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterVerified email at cs.rochester.edu
Nancy LynchProfessor of EECS, MITVerified email at csail.mit.edu
Richard E LadnerUniversity of WashingtonVerified email at cs.washington.edu
Jin-Yi CaiUniversity of Wisconsin - MadisonVerified email at cs.wisc.edu
Neil JonesVerified email at diku.dk
Dung T NguyenUniversity at BuffaloVerified email at buffalo.edu
Kurt MalyODUVerified email at cs.odu.edu
Theodore P. (Ted) BakerProfessor Emeritus of Computer Science, Florida State UniversityVerified email at cs.fsu.edu
Edith HemaspaandraProfessor of Computer Science, RITVerified email at cs.rit.edu
Lance FortnowIllinois Institute of TechnologyVerified email at iit.edu
Uwe SchöningProfessor of Computer Science, Ulm University, retiredVerified email at uni-ulm.de
Frederic GreenClark UniversityVerified email at clarku.edu
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerified email at thi.uni-hannover.de

Alan Selman

Professor emeritus of computer science and engineering, University at Buffalo

No verified email

Computational complexity


Title Sort by citations Sort by year Sort by 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	541	1974
Complexity measures for public-key cryptosystems J Grollmann, AL Selman SIAM Journal on Computing 17 (2), 309-335, 1988	422	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	349	1984
P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP AL Selman Mathematical Systems Theory 13, 55-65, 1979	235	1979
A taxonomy of complexity classes of functions AL Selman Journal of Computer and System Sciences 48 (2), 357-381, 1994	220	1994
Computability and complexity theory S Homer, AL Selman, S Homer Springer, 2011	206	2011
Quantitative relativizations of complexity classes RV Book, TJ Long, AL Selman SIAM Journal on Computing 13 (3), 461-487, 1984	190	1984
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	164	1972
Reductions on NP and P-selective sets AL Selman Theoretical Computer Science 19 (3), 287-304, 1982	147	1982
A second step toward the polynomial hierarchy TP Baker, AL Selman Theoretical Computer Science 8 (2), 177-187, 1979	112	1979
Analogues of semirecursive sets and effective reducibilities to the study of NP complexity AL Selman Information and Control 52 (1), 36-51, 1982	107	1982
Arithmetical reducibilities. AL Selman Carnegie Mellon University, 1971	103	1971
Computing solutions uniquely collapses the polynomial hierarchy LA Hemaspaandra, AV Naik, M Ogihara, AL Selman SIAM Journal on Computing 25 (4), 697-708, 1996	95	1996
Relativizing complexity classes with sparse oracles TJ Long, AL Selman Journal of the ACM (JACM) 33 (3), 618-627, 1986	94	1986
Completeness of calculii for axiomatically defined classes of algebras AL Selman Carnegie Mellon University, 1971	90	1971
A survey of one-way functions in complexity theory AL Selman Mathematical systems theory 25 (3), 203-221, 1992	77	1992
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	75	1996
Natural self-reducible sets AL Selman SIAM Journal on Computing 17 (5), 989-996, 1988	73	1988
Polynomial time enumeration reducibility AL Selman SIAM Journal on Computing 7 (4), 440-457, 1978	71	1978
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	68	1989

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors