NEWS
Institutional Subscription: Comprehensive Analyses to Enhance Your Global and Local Impact
New Feature: Compare Your Institution with the Previous Year
Find a Professional: Explore Experts Across 197 Disciplines in 221 Countries!
Find a Professional
Print Your Certificate
New! Young University / Institution Rankings 2025
New! Art & Humanities Rankings 2025
New! Social Sciences and Humanities Rankings 2025
Highly Cited Researchers 2025
AD
Scientific Index 2025
Scientist Rankings
University Rankings
Subject Rankings
Country Rankings
Login
Register & Pricing
insights
H-Index Rankings
insights
i10 Productivity Rankings
format_list_numbered
Citation Rankings
subject
University Subject Rankings
school
Young Universities
format_list_numbered
Top 100 Scientists
format_quote
Top 100 Institutions
format_quote
Compare & Choose
local_fire_department
Country Reports
person
Find a Professional
Alan Selman
University at Buffalo - Buffalo / United States
Engineering & Technology / Computer Science
AD Scientific Index ID: 1730006
Registration, Add Profile,
Premium Membership
Print Your Certificate
Ranking &
Analysis
Job
Experiences (0)
Education
Information (0)
Published Books (0)
Book Chapters (0)
Articles (0)
Presentations (0)
Lessons (0)
Projects (0)
Co-Authors
Subject Leaders
Editorship, Referee &
Scientific Board (0 )
Patents /
Designs (0)
Academic Grants
& Awards (0)
Artistic
Activities (0)
Certificate / Course
/ Trainings (0)
Association &
Society Memberships (0)
Contact, Office
& Social Media
person_outline
Alan Selman's MOST POPULAR ARTICLES
1-)
Comparison of polynomial-time reducibilitiesR Ladner, N Lynch, A SelmanProceedings of the sixth annual ACM symposium on Theory of computing, 110-121, 19745241974
2-)
Complexity measures for public-key cryptosystemsJ Grollmann, AL SelmanSIAM Journal on Computing 17 (2), 309-335, 19884051988
3-)
The complexity of promise problems with applications to public-key cryptographyS Even, AL Selman, Y YacobiInformation and Control 61 (2), 159-173, 19843371984
4-)
P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNPAL SelmanMathematical Systems Theory 13, 55-65, 19792371979
5-)
A taxonomy of complexity classes of functionsAL SelmanJournal of Computer and System Sciences 48 (2), 357-381, 19942171994
ARTICLES
Add your articles
We use cookies to personalize our website and offer you a better experience. If you accept cookies, we can offer you special services.
Cookie Policy
Accept