Alan L. Selman

Publication Activity (10 Years)

Years Active: 1972-2017
Publications (10 Years): 4

Top Venues

ICALP (1)

Electron. Colloquium Comput. Complex.

ACM Trans. Comput. Theory

Theory Comput. Syst.

Publications

Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek
Introduction to Autoreducibility and Mitoticity. Computability and Complexity (2017)
Alan L. Selman, Arnold L. Rosenberg
50 Years of TOCS. Theory Comput. Syst. 60 (1) (2017)
Andrew Hughes, Debasis Mandal, Aduri Pavan, Nathan Russell, Alan L. Selman
A thirty Year old conjecture about promise problems. Comput. Complex. 25 (4) (2016)
Dung T. Nguyen, Alan L. Selman
Structural Properties of Nonautoreducible Sets. ACM Trans. Comput. Theory 8 (3) (2016)
Dung T. Nguyen, Alan L. Selman
Non-autoreducible Sets for NEXP. STACS (2014)
Christian Glaßer, Andrew Hughes, Alan L. Selman, Nils Wisiol
Disjoint NP-Pairs and Propositional Proof Systems. SIGACT News 45 (4) (2014)
Dung T. Nguyen, Alan L. Selman
Non-autoreducible Sets for NEXP. Electron. Colloquium Comput. Complex. 20 (2013)
Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. ICALP (1) (2013)
Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. Electron. Colloquium Comput. Complex. 20 (2013)
Andrew Hughes, Aduri Pavan, Nathan Russell, Alan L. Selman
A Thirty Year Old Conjecture about Promise Problems. ICALP (1) (2012)
Jin-yi Cai, Alan L. Selman
Foreword. J. Comput. Syst. Sci. 77 (1) (2011)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
Non-mitotic sets. Theor. Comput. Sci. 410 (21-23) (2009)
Christian Glaßer, Alan L. Selman, Liyu Zhang
The Informational Content of Canonical Disjoint NP-Pairs. Int. J. Found. Comput. Sci. 20 (3) (2009)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The complexity of unions of disjoint sets. J. Comput. Syst. Sci. 74 (7) (2008)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Splitting NP-Complete Sets. SIAM J. Comput. 37 (5) (2008)
Christian Glaßer, Alan L. Selman, Liyu Zhang
Canonical disjoint NP-pairs of propositional proof systems. Theor. Comput. Sci. 370 (1-3) (2007)
Christian Glaßer, Alan L. Selman, Liyu Zhang
The Informational Content of Canonical Disjoint NP-Pairs. COCOON (2007)
Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. 73 (5) (2007)
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) (2007)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The Complexity of Unions of Disjoint Sets. STACS (2007)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
Non-mitotic Sets. FSTTCS (2007)
Christian Glaßer, Alan L. Selman, Liyu Zhang
The Informational Content of Canonical Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. 14 (018) (2007)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Mitosis in Computational Complexity. TAMC (2006)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Redundancy in Complete Sets. STACS (2006)
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)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
Non-Mitotic Sets. Electron. Colloquium Comput. Complex. 13 (090) (2006)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The Complexity of Unions of Disjoint Sets. Electron. Colloquium Comput. Complex. 13 (069) (2006)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets. SIAM J. Comput. 36 (2) (2006)
Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
Autoreducibility, Mitoticity, and Immunity. MFCS (2005)
Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
Autoreducibility, Mitoticity, and Immunity Electron. Colloquium Comput. Complex. (011) (2005)
Christian Glaßer, Alan L. Selman, Liyu Zhang
Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems Electron. Colloquium Comput. Complex. (072) (2005)
Christian Glaßer, Alan L. Selman, Liyu Zhang
Canonical Disjoint NP-Pairs of Propositional Proof Systems. MFCS (2005)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
Redundancy in Complete Sets Electron. Colloquium Comput. Complex. (068) (2005)
Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between disjoint NP-Pairs. Inf. Comput. 200 (2) (2005)
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs. SIAM J. Comput. 33 (6) (2004)
Aduri Pavan, Alan L. Selman
Bi-immunity separates strong NP-completeness notions. Inf. Comput. 188 (1) (2004)
Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between Disjoint NP-Pairs. Computational Complexity Conference (2004)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets. Computational Complexity Conference (2004)
Alan L. Selman, Samik Sengupta
Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy. Computational Complexity Conference (2004)
Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
Properties of NP-Complete Sets Electron. Colloquium Comput. Complex. (019) (2004)
Christian Glaßer, Alan L. Selman, Liyu Zhang
Canonical Disjoint NP-Pairs of Propositional Proof Systems Electron. Colloquium Comput. Complex. (106) (2004)
Alan L. Selman, Samik Sengupta
Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy Electron. Colloquium Comput. Complex. (007) (2004)
Christian Glaßer, Alan L. Selman, Samik Sengupta
Reductions between Disjoint NP-Pairs Electron. Colloquium Comput. Complex. 10 (027) (2003)
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs. Computational Complexity Conference (2003)
Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
Disjoint NP-Pairs Electron. Colloquium Comput. Complex. 10 (011) (2003)
Aduri Pavan, Alan L. Selman
Bi-Immunity Separates Strong NP-Completeness Notions Electron. Colloquium Comput. Complex. (005) (2002)
Aduri Pavan, Alan L. Selman
Bi-Immunity Separates Strong NP-Completeness Notions. STACS (2002)
Aduri Pavan, Alan L. Selman
Separation of NP-Completeness Notions. SIAM J. Comput. 31 (3) (2001)
Aduri Pavan, Alan L. Selman
Separation of NP-Completeness Notions. Computational Complexity Conference (2001)
Alan L. Selman
Editorial Statement. Theory Comput. Syst. 34 (1) (2001)
Aduri Pavan, Alan L. Selman
Separation of NP-completeness Notions Electron. Colloquium Comput. Complex. 8 (32) (2001)
Lance Fortnow, Aduri Pavan, Alan L. Selman
Distributionally Hard Languages. Theory Comput. Syst. 34 (3) (2001)
John E. Savage, Alan L. Selman, Carl Smith
The history and contribution of theoretical computer science. Adv. Comput. 55 (2001)
Aduri Pavan, Alan L. Selman
Complete distributional problems, hard languages, and resource-bounded measure. Theor. Comput. Sci. 234 (1-2) (2000)
Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
Complements of Multivalued Functions. Chic. J. Theor. Comput. Sci. 1999 (1999)
Jin-yi Cai, Alan L. Selman
Fine Separation of Average-Time Complexity Classes. SIAM J. Comput. 28 (4) (1999)
Ashish V. Naik, Alan L. Selman
Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets. Comput. Complex. 8 (2) (1999)
Lance Fortnow, Aduri Pavan, Alan L. Selman
Distributionally-Hard Languages. COCOON (1999)
Lane A. Hemaspaandra, Alan L. Selman
Writing and editing complexity theory: tales and tools. SIGACT News 29 (4) (1998)
Ashish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman
A Hierarchy Based on Output Multiplicity. Theor. Comput. Sci. 207 (1) (1998)
Lane A. Hemaspaandra, Alan L. Selman
Writing and Editing Complexity Theory: Tales and Tools CoRR (1998)
Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman
Oracles that Compute Values. SIAM J. Comput. 26 (4) (1997)
Anne Condon, Faith E. 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 28 (3) (1997)
Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
Computing Solutions Uniquely Collapses the Polynomial Hierarchy Electron. Colloquium Comput. Complex. 3 (27) (1996)
Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
Complements of Multivalued Functions. Computational Complexity Conference (1996)
Jin-yi Cai, Alan L. Selman
Fine Separation of Average Time Complexity Classes. STACS (1996)
Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
Computing Solutions Uniquely Collapses the Polynomial Hierarchy. SIAM J. Comput. 25 (4) (1996)
Ashish V. Naik, Alan L. Selman
A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. Computational Complexity Conference (1996)
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. 53 (2) (1996)
Alan L. Selman
Much Ado about Functions. Computational Complexity Conference (1996)
Jin-yi Cai, Alan L. Selman
Average Time Complexity Classes Electron. Colloquium Comput. Complex. 2 (19) (1995)
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. 6 (4) (1995)
James C. French, Edward A. Fox, Kurt Maly, Alan L. Selman
Wide Area Technical Report Service: Technical Reports Online. Commun. ACM 38 (4) (1995)
James C. French, Edward A. Fox, Kurt Maly, Alan L. Selman
Wide area technical report service - technical reports online. SIGACT News 25 (3) (1994)
Alan L. Selman
A Taxonomy of Complexity Classes of Functions. J. Comput. Syst. Sci. 48 (2) (1994)
Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC (1994)
Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman
On Using Oracles That Compute Values. STACS (1993)
Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang
Selectivity. ICCI (1993)
Luc Longpré, Alan L. Selman
Hard Promise Problems and Nonuniform Complexity. Theor. Comput. Sci. 115 (2) (1993)
Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. Computational Complexity Conference (1993)
Alan L. Selman
A Survey of One-Way Functions in Complexity Theory. Math. Syst. Theory 25 (3) (1992)
Steven Homer, Alan L. Selman
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. J. Comput. Syst. Sci. 44 (2) (1992)
Alan L. Selman
Complexity Classes for Partial Functions. Bull. EATCS 45 (1991)
Alan L. Selman
One-Way Functions in Complexity Theory. MFCS (1990)
Luc Longpré, Alan L. Selman
Hard Promise Problems and Nonuniform Complexity. STACS (1990)
Steven Homer, Alan L. Selman
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. Computational Complexity Conference (1989)
Joachim Grollmann, Alan L. Selman
Complexity Measures for Public-Key Cryptosystems. SIAM J. Comput. 17 (2) (1988)
Alan L. Selman
Natural Self-Reducible Sets. SIAM J. Comput. 17 (5) (1988)
Alan L. Selman
Promise Problems Complete for Complexity Classes Inf. Comput. 78 (2) (1988)
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)
Timothy J. Long, Alan L. Selman
Relativizing complexity classes with sparse oracles. J. ACM 33 (3) (1986)
Ronald V. Book, Timothy J. Long, Alan L. Selman
Qualitative Relativizations of Complexity Classes. J. Comput. Syst. Sci. 30 (3) (1985)
Shimon Even, Alan L. Selman, Yacov Yacobi
Hard-Core Theorems for Complexity Classes J. ACM 32 (1) (1985)
Ronald V. Book, Timothy J. Long, Alan L. Selman
Quantitative Relativizations of Complexity Classes. SIAM J. Comput. 13 (3) (1984)
Joachim Grollmann, Alan L. Selman
Complexity Measures for Public-Key Cryptosystems (Preliminary Report) FOCS (1984)
Shimon Even, Alan L. Selman, Yacov Yacobi
The Complexity of Promise Problems with Applications to Public-Key Cryptography Inf. Control. 61 (2) (1984)
José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman
Sparse Oracles and Uniform Complexity Classes FOCS (1984)
Ronald V. Book, Alan L. Selman
Characterizations of Reduction Classes Modulo Oracle Conditions. Math. Syst. Theory 17 (4) (1984)
Ronald V. Book, Timothy J. Long, Alan L. Selman
Controlled relativizations of P and NP. Theoretical Computer Science (1983)
Alan L. Selman, Xu Mei-Rui, Ronald V. Book
Positive Relativizations of Complexity Classes. SIAM J. Comput. 12 (3) (1983)

Alan L. Selman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alan L. Selman