| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jin-yi Cai, Alan L. Selman |
Foreword.  |
J. Comput. Syst. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Alan L. Selman |
Computability and Complexity Theory, Second Edition. |
|
2011 |
DOI RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang |
Non-mitotic sets. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Liyu Zhang |
The Informational Content of Canonical Disjoint NP-Pairs. |
Int. J. Found. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner |
The complexity of unions of disjoint sets. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Splitting NP-Complete Sets. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Liyu Zhang |
The Informational Content of Canonical Disjoint NP-Pairs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Liyu Zhang |
Canonical disjoint NP-pairs of propositional proof systems. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran |
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Autoreducibility, mitoticity, and immunity. |
J. Comput. Syst. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner |
The Complexity of Unions of Disjoint Sets. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Liyu Zhang |
The Informational Content of Canonical Disjoint NP-Pairs. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang |
Non-mitotic Sets. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang |
Non-Mitotic Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner |
The Complexity of Unions of Disjoint Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta |
Properties of NP-Complete Sets. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Mitosis in Computational Complexity. |
TAMC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Redundancy in Complete Sets. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Liyu Zhang |
Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems. |
Essays in Memory of Shimon Even |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman (eds.) |
Theoretical Computer Science, Essays in Memory of Shimon Even |
Essays in Memory of Shimon Even |
2006 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Redundancy in Complete Sets |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Liyu Zhang |
Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Autoreducibility, Mitoticity, and Immunity |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Samik Sengupta |
Reductions between disjoint NP-Pairs. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang |
Autoreducibility, Mitoticity, and Immunity. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Liyu Zhang |
Canonical Disjoint NP-Pairs of Propositional Proof Systems. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta |
Properties of NP-Complete Sets |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Alan L. Selman, Samik Sengupta |
Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Liyu Zhang |
Canonical Disjoint NP-Pairs of Propositional Proof Systems |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Bi-immunity separates strong NP-completeness notions. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang |
Disjoint NP-Pairs. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman, Samik Sengupta |
Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta |
Properties of NP-Complete Sets. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Samik Sengupta |
Reductions between Disjoint NP-Pairs. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Samik Sengupta |
Reductions between Disjoint NP-Pairs |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang |
Disjoint NP-Pairs |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang |
Disjoint NP-Pairs. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Bi-Immunity Separates Strong NP-Completeness Notions |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Bi-Immunity Separates Strong NP-Completeness Notions. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Separation of NP-completeness Notions |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Aduri Pavan, Alan L. Selman |
Distributionally Hard Languages. |
Theory Comput. Syst. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman |
Editorial Statement. |
Theory Comput. Syst. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Separation of NP-Completeness Notions. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | John E. Savage, Alan L. Selman, Carl Smith |
The history and contribution of theoretical computer science. |
Advances in Computers |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Separation of NP-Completeness Notions. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aduri Pavan, Alan L. Selman |
Complete distributional problems, hard languages, and resource-bounded measure. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer |
Complements of Multivalued Functions. |
Chicago J. Theor. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Ashish V. Naik, Alan L. Selman |
Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets. |
Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai, Alan L. Selman |
Fine Separation of Average-Time Complexity Classes. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Aduri Pavan, Alan L. Selman |
Distributionally-Hard Languages. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman |
A Hierarchy Based on Output Multiplicity. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Alan L. Selman |
Writing and Editing Complexity Theory: Tales and Tools |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Alan L. Selman |
Writing and editing complexity theory: tales and tools. |
SIGACT News |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Condon, Faith Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys |
Strategic directions in research in theory of computing. |
SIGACT News |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman |
Oracles that Compute Values. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman |
Computing Solutions Uniquely Collapses the Polynomial Hierarchy |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman |
P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman |
Computing Solutions Uniquely Collapses the Polynomial Hierarchy. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai, Alan L. Selman |
Fine Separation of Average Time Complexity Classes. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish V. Naik, Alan L. Selman |
A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
P, p-selective, adaptive reductions, nonadaptive reductions, complexity classes, NP |
| 1 | Alan L. Selman |
Much Ado about Functions. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
multivalued functions, search functions, hierarchies, one-way functions, complexity classes |
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer |
Complements of Multivalued Functions. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
multivalued functions, NPMV functions, coNPMV, complete functions, query hierarchy, functional analogue, Boolean hierarchy, computational complexity, complexity, multivalued logic, polynomial time hierarchy |
| 1 | Jin-yi Cai, Alan L. Selman |
Average Time Complexity Classes |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang |
Nondeterministically Selective Sets. |
Int. J. Found. Comput. Sci. |
1995 |
DBLP BibTeX RDF |
|
| 1 | James C. French, Edward A. Fox, Kurt Maly, Alan L. Selman |
Wide Area Technical Report Service: Technical Reports Online. |
Commun. ACM |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | James C. French, Edward A. Fox, Kurt Maly, Alan L. Selman |
Wide area technical report service - technical reports online. |
SIGACT News |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman |
A Taxonomy of Complexity Classes of Functions. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman |
Computing Solutions Uniquely collapses the Polynomial Hierarchy. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Alan L. Selman |
Hard Promise Problems and Nonuniform Complexity. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang |
Selectivity. |
ICCI |
1993 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman |
On Using Oracles That Compute Values. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman |
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Alan L. Selman |
A Survey of One-Way Functions in Complexity Theory. |
Mathematical Systems Theory |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Alan L. Selman |
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. |
J. Comput. Syst. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman |
Complexity Classes for Partial Functions. |
Bulletin of the EATCS |
1991 |
DBLP BibTeX RDF |
|
| 1 | Alan L. Selman |
One-Way Functions in Complexity Theory. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Longpré, Alan L. Selman |
Hard Promise Problems and Nonuniform Complexity. |
STACS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Alan L. Selman |
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. |
Structure in Complexity Theory Conference |
1989 |
DBLP BibTeX RDF |
|
| 1 | Alan L. Selman |
Promise Problems Complete for Complexity Classes |
Inf. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman |
Natural Self-Reducible Sets. |
SIAM J. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Grollmann, Alan L. Selman |
Complexity Measures for Public-Key Cryptosystems. |
SIAM J. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | John G. Geske, Dung T. Huynh, Alan L. Selman |
A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees. |
STACS |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy J. Long, Alan L. Selman |
Relativizing complexity classes with sparse oracles. |
J. ACM |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman (eds.) |
Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, June 2-5, 1986 |
Structure in Complexity Theory Conference |
1986 |
DBLP BibTeX RDF |
|
| 1 | Shimon Even, Alan L. Selman, Yacov Yacobi |
Hard-Core Theorems for Complexity Classes |
J. ACM |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Timothy J. Long, Alan L. Selman |
Qualitative Relativizations of Complexity Classes. |
J. Comput. Syst. Sci. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Alan L. Selman, Yacov Yacobi |
The Complexity of Promise Problems with Applications to Public-Key Cryptography |
Information and Control |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Alan L. Selman |
Characterizations of Reduction Classes Modulo Oracle Conditions. |
Mathematical Systems Theory |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Timothy J. Long, Alan L. Selman |
Quantitative Relativizations of Complexity Classes. |
SIAM J. Comput. |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Grollmann, Alan L. Selman |
Complexity Measures for Public-Key Cryptosystems (Preliminary Report) |
FOCS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman |
Sparse Oracles and Uniform Complexity Classes |
FOCS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman, Xu Mei-Rui, Ronald V. Book |
Positive Relativizations of Complexity Classes. |
SIAM J. Comput. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Timothy J. Long, Alan L. Selman |
Controlled relativizations of P and NP. |
Theoretical Computer Science |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman |
Reductions on NP and P-Selective Sets. |
Theor. Comput. Sci. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman |
Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity |
Information and Control |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman, Yacov Yacobi |
The Complexity of Promise Problems. |
ICALP |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman |
Some Observations on NP, Real Numbers and P-Selective Sets. |
J. Comput. Syst. Sci. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Theodore P. Baker, Alan L. Selman |
A Second Step Toward the Polynomial Hierarchy. |
Theor. Comput. Sci. |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman |
P-selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. |
Mathematical Systems Theory |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan L. Selman |
P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. |
ICALP |
1979 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")