default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan L. Selman
- > Home > Persons > Alan L. Selman
Publications
- 2016
[j56]Andrew Hughes, Debasis Mandal, Aduri Pavan, Nathan Russell, Alan L. Selman:
A thirty Year old conjecture about promise problems. Comput. Complex. 25(4): 883-919 (2016)- 2012
- [c36]Andrew Hughes, Aduri Pavan, Nathan Russell, Alan L. Selman:
A Thirty Year Old Conjecture about Promise Problems. ICALP (1) 2012: 473-484 - 2008
- [j49]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Splitting NP-Complete Sets. SIAM J. Comput. 37(5): 1517-1535 (2008) - 2007
- [j48]Christian Glaßer, Mitsunori Ogihara
, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. 73(5): 735-754 (2007) - [j46]Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran:
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. 385(1-3): 167-178 (2007) - 2006
- [j45]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. SIAM J. Comput. 36(2): 516-542 (2006) - [c31]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Redundancy in Complete Sets. STACS 2006: 444-454 - [c30]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Mitosis in Computational Complexity. TAMC 2006: 61-67 - 2005
- [c29]Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, Mitoticity, and Immunity. MFCS 2005: 387-398 - [i13]Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, Mitoticity, and Immunity. Electron. Colloquium Comput. Complex. TR05 (2005) - [i12]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Redundancy in Complete Sets. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j43]Aduri Pavan, Alan L. Selman:
Bi-immunity separates strong NP-completeness notions. Inf. Comput. 188(1): 116-126 (2004) - [c25]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. CCC 2004: 184-197 - [i9]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. Electron. Colloquium Comput. Complex. TR04 (2004) - 2002
- [c23]Aduri Pavan, Alan L. Selman:
Bi-Immunity Separates Strong NP-Completeness Notions. STACS 2002: 408-418 - [i5]Aduri Pavan, Alan L. Selman:
Bi-Immunity Separates Strong NP-Completeness Notions. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j39]Lance Fortnow, Aduri Pavan, Alan L. Selman:
Distributionally Hard Languages. Theory Comput. Syst. 34(3): 245-261 (2001) - [j38]Aduri Pavan, Alan L. Selman:
Separation of NP-Completeness Notions. SIAM J. Comput. 31(3): 906-918 (2001) - [c22]Aduri Pavan, Alan L. Selman:
Separation of NP-Completeness Notions. CCC 2001: 78-89 - [i4]Aduri Pavan, Alan L. Selman:
Separation of NP-completeness Notions. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j37]Aduri Pavan, Alan L. Selman:
Complete distributional problems, hard languages, and resource-bounded measure. Theor. Comput. Sci. 234(1-2): 273-286 (2000) - 1999
- [c21]Lance Fortnow, Aduri Pavan, Alan L. Selman:
Distributionally-Hard Languages. COCOON 1999: 184-193
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
