Alan Selman

Citata da

	Tutte	Dal 2019
Citazioni	4869	499
Indice H	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 96 117 109 79 132 62 75 61 60 52 84 171 58 78 56

Accesso pubblico

Visualizza tutto

1 articolo

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Mitsunori OgiharaUniversity of MiamiEmail verificata su cs.miami.edu
Pavan AduriIowa State UniversityEmail verificata su cs.iastate.edu
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterEmail verificata su cs.rochester.edu
Nancy LynchProfessor of EECS, MITEmail verificata su csail.mit.edu
Richard E LadnerUniversity of WashingtonEmail verificata su cs.washington.edu
Jin-Yi CaiUniversity of Wisconsin - MadisonEmail verificata su cs.wisc.edu
Neil JonesEmail verificata su diku.dk
Dung T NguyenUniversity at BuffaloEmail verificata su buffalo.edu
Kurt MalyODUEmail verificata su cs.odu.edu
Theodore P. (Ted) BakerProfessor Emeritus of Computer Science, Florida State UniversityEmail verificata su cs.fsu.edu
Edith HemaspaandraProfessor of Computer Science, RITEmail verificata su cs.rit.edu
Lance FortnowIllinois Institute of TechnologyEmail verificata su iit.edu
Uwe SchöningProfessor of Computer Science, Ulm University, retiredEmail verificata su uni-ulm.de
Frederic GreenClark UniversityEmail verificata su clarku.edu
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverEmail verificata su thi.uni-hannover.de

Segui

Alan Selman

Professor emeritus of computer science and engineering, University at Buffalo

Nessuna email verificata

Computational complexity


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	352	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	207	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	95	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	76	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

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori