Alan Selman

Citata da

	Tutte	Dal 2020
Citazioni	4906	472
Indice H	33	10
i10-index	65	11

240

120

180

198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202568 92 95 106 120 93 104 211 159 176 192 136 120 122 97 127 66 114 148 234 193 196 130 125 99 108 101 80 134 58 75 61 60 50 87 171 57 79 69 9

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	554	1974
Complexity measures for public-key cryptosystems J Grollmann, AL Selman SIAM Journal on Computing 17 (2), 309-335, 1988	429	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	355	1984
P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP AL Selman Mathematical Systems Theory 13, 55-65, 1979	237	1979
A taxonomy of complexity classes of functions AL Selman Journal of Computer and System Sciences 48 (2), 357-381, 1994	217	1994
Computability and complexity theory S Homer, AL Selman, S Homer Springer, 2001	205	2001
Quantitative relativizations of complexity classes RV Book, TJ Long, AL Selman SIAM Journal on Computing 13 (3), 461-487, 1984	192	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	160	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	113	1979
Analogues of semirecursive sets and effective reducibilities to the study of NP complexity AL Selman Information and Control 52 (1), 36-51, 1982	108	1982
Arithmetical reducibilities. AL Selman Carnegie Mellon University, 1971	104	1971
Relativizing complexity classes with sparse oracles TJ Long, AL Selman Journal of the ACM (JACM) 33 (3), 618-627, 1986	99	1986
Computing solutions uniquely collapses the polynomial hierarchy LA Hemaspaandra, AV Naik, M Ogihara, AL Selman SIAM Journal on Computing 25 (4), 697-708, 1996	94	1996
Completeness of calculii for axiomatically defined classes of algebras AL Selman Carnegie Mellon University, 1971	88	1971
A survey of one-way functions in complexity theory AL Selman Mathematical systems theory 25 (3), 203-221, 1992	79	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	77	1996
Natural self-reducible sets AL Selman SIAM Journal on Computing 17 (5), 989-996, 1988	75	1988
Qualitative relativizations of complexity classes RV Book, TJ Long, AL Selman Journal of Computer and System Sciences 30 (3), 395-413, 1985	71	1985
Polynomial time enumeration reducibility AL Selman SIAM Journal on Computing 7 (4), 440-457, 1978	71	1978

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