The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alan L. Selman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christian Glaßer, Alan L. Selman, Liyu Zhang
    Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems. [Citation Graph (0, 0)][DBLP]
    Essays in Memory of Shimon Even, 2006, pp:241-253 [Conf]
  2. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
    Complements of Multivalued Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:260-269 [Conf]
  3. Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
    Properties of NP-Complete Sets. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:184-197 [Conf]
  4. Christian Glaßer, Alan L. Selman, Samik Sengupta
    Reductions between Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:42-53 [Conf]
  5. Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
    Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:313-332 [Conf]
  6. Steven Homer, Alan L. Selman
    Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:3-14 [Conf]
  7. Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman
    P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:52-64 [Conf]
  8. Ashish V. Naik, Alan L. Selman
    A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:224-232 [Conf]
  9. Aduri Pavan, Alan L. Selman
    Separation of NP-Completeness Notions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:78-89 [Conf]
  10. Alan L. Selman
    Much Ado about Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:198-212 [Conf]
  11. Alan L. Selman, Samik Sengupta
    Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:82-90 [Conf]
  12. Lance Fortnow, Aduri Pavan, Alan L. Selman
    Distributionally-Hard Languages. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:184-193 [Conf]
  13. Theodore P. Baker, Alan L. Selman
    A Second Step toward the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:71-75 [Conf]
  14. José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman
    Sparse Oracles and Uniform Complexity Classes [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:308-311 [Conf]
  15. Joachim Grollmann, Alan L. Selman
    Complexity Measures for Public-Key Cryptosystems (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:495-503 [Conf]
  16. Alan L. Selman
    P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:546-555 [Conf]
  17. Alan L. Selman, Yacov Yacobi
    The Complexity of Promise Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:502-509 [Conf]
  18. Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang
    Selectivity. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:55-59 [Conf]
  19. Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
    Computing Solutions Uniquely collapses the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:56-64 [Conf]
  20. Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Autoreducibility, Mitoticity, and Immunity. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:387-398 [Conf]
  21. Christian Glaßer, Alan L. Selman, Liyu Zhang
    Canonical Disjoint NP-Pairs of Propositional Proof Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:399-409 [Conf]
  22. Alan L. Selman
    One-Way Functions in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:88-104 [Conf]
  23. Jin-yi Cai, Alan L. Selman
    Fine Separation of Average Time Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:331-343 [Conf]
  24. Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman
    On Using Oracles That Compute Values. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:398-407 [Conf]
  25. John G. Geske, Dung T. Huynh, Alan L. Selman
    A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:125-135 [Conf]
  26. Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Redundancy in Complete Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:444-454 [Conf]
  27. Luc Longpré, Alan L. Selman
    Hard Promise Problems and Nonuniform Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:216-226 [Conf]
  28. Aduri Pavan, Alan L. Selman
    Bi-Immunity Separates Strong NP-Completeness Notions. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:408-418 [Conf]
  29. Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
    The Complexity of Unions of Disjoint Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:248-259 [Conf]
  30. Neil D. Jones, Alan L. Selman
    Turing Machines and the Spectra of First-Order Formulas with Equality [Citation Graph (0, 0)][DBLP]
    STOC, 1972, pp:157-167 [Conf]
  31. Richard E. Ladner, Nancy A. Lynch, Alan L. Selman
    Comparisons of Polynomial-Time Reducibilities [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:110-121 [Conf]
  32. Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Mitosis in Computational Complexity. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:61-67 [Conf]
  33. Ronald V. Book, Timothy J. Long, Alan L. Selman
    Controlled relativizations of P and NP. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:85-90 [Conf]
  34. John E. Savage, Alan L. Selman, Carl Smith
    The history and contribution of theoretical computer science. [Citation Graph (0, 0)][DBLP]
    Advances in Computers, 2001, v:55, n:, pp:172-185 [Journal]
  35. James C. French, Edward A. Fox, Kurt Maly, Alan L. Selman
    Wide Area Technical Report Service: Technical Reports Online. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1995, v:38, n:4, pp:45- [Journal]
  36. Ashish V. Naik, Alan L. Selman
    Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:2, pp:169-187 [Journal]
  37. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
    Complements of Multivalued Functions. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  38. Lane A. Hemaspaandra, Alan L. Selman
    Writing and Editing Complexity Theory: Tales and Tools [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  39. Alan L. Selman
    Complexity Classes for Partial Functions. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1991, v:45, n:, pp:114-130 [Journal]
  40. Aduri Pavan, Alan L. Selman
    Separation of NP-completeness Notions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:32, pp:- [Journal]
  41. Aduri Pavan, Alan L. Selman
    Bi-Immunity Separates Strong NP-Completeness Notions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:005, pp:- [Journal]
  42. Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
    Disjoint NP-Pairs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:011, pp:- [Journal]
  43. Christian Glaßer, Alan L. Selman, Samik Sengupta
    Reductions between Disjoint NP-Pairs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:027, pp:- [Journal]
  44. Alan L. Selman, Samik Sengupta
    Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:007, pp:- [Journal]
  45. Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
    Properties of NP-Complete Sets [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:019, pp:- [Journal]
  46. Christian Glaßer, Alan L. Selman, Liyu Zhang
    Canonical Disjoint NP-Pairs of Propositional Proof Systems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:106, pp:- [Journal]
  47. Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Autoreducibility, Mitoticity, and Immunity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:011, pp:- [Journal]
  48. Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Redundancy in Complete Sets [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:068, pp:- [Journal]
  49. Christian Glaßer, Alan L. Selman, Liyu Zhang
    Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:072, pp:- [Journal]
  50. Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
    Computing Solutions Uniquely Collapses the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:27, pp:- [Journal]
  51. Shimon Even, Alan L. Selman, Yacov Yacobi
    The Complexity of Promise Problems with Applications to Public-Key Cryptography [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:61, n:2, pp:159-173 [Journal]
  52. Christian Glaßer, Alan L. Selman, Samik Sengupta
    Reductions between disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:200, n:2, pp:247-267 [Journal]
  53. Aduri Pavan, Alan L. Selman
    Bi-immunity separates strong NP-completeness notions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:188, n:1, pp:116-126 [Journal]
  54. Alan L. Selman
    Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:52, n:1, pp:36-51 [Journal]
  55. Alan L. Selman
    Promise Problems Complete for Complexity Classes [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:78, n:2, pp:87-97 [Journal]
  56. Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang
    Nondeterministically Selective Sets. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1995, v:6, n:4, pp:403-416 [Journal]
  57. Shimon Even, Alan L. Selman, Yacov Yacobi
    Hard-Core Theorems for Complexity Classes [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:1, pp:205-217 [Journal]
  58. Timothy J. Long, Alan L. Selman
    Relativizing complexity classes with sparse oracles. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:3, pp:618-627 [Journal]
  59. Ronald V. Book, Timothy J. Long, Alan L. Selman
    Qualitative Relativizations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:3, pp:395-413 [Journal]
  60. Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
    P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:194-209 [Journal]
  61. Steven Homer, Alan L. Selman
    Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:287-301 [Journal]
  62. Alan L. Selman
    Some Observations on NP, Real Numbers and P-Selective Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:23, n:3, pp:326-332 [Journal]
  63. Alan L. Selman
    A Taxonomy of Complexity Classes of Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:2, pp:357-381 [Journal]
  64. Neil D. Jones, Alan L. Selman
    Turing Machines and the Spectra of First-Order Formulas. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:1, pp:139-150 [Journal]
  65. Ronald V. Book, Celia Wrathall, Alan L. Selman, David P. Dobkin
    Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1977, v:11, n:, pp:1-8 [Journal]
  66. Ronald V. Book, Alan L. Selman
    Characterizations of Reduction Classes Modulo Oracle Conditions. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1984, v:17, n:4, pp:263-277 [Journal]
  67. Lance Fortnow, Aduri Pavan, Alan L. Selman
    Distributionally Hard Languages. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:3, pp:245-261 [Journal]
  68. Alan L. Selman
    Editorial Statement. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:1, pp:1- [Journal]
  69. Alan L. Selman
    P-selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1979, v:13, n:, pp:55-65 [Journal]
  70. Alan L. Selman
    A Survey of One-Way Functions in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:3, pp:203-221 [Journal]
  71. Ronald V. Book, Timothy J. Long, Alan L. Selman
    Quantitative Relativizations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:3, pp:461-487 [Journal]
  72. Jin-yi Cai, Alan L. Selman
    Fine Separation of Average-Time Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1310-1325 [Journal]
  73. Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman
    Oracles that Compute Values. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1043-1065 [Journal]
  74. Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang
    Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:6, pp:1369-1416 [Journal]
  75. Joachim Grollmann, Alan L. Selman
    Complexity Measures for Public-Key Cryptosystems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:309-335 [Journal]
  76. Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
    Computing Solutions Uniquely Collapses the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:4, pp:697-708 [Journal]
  77. Aduri Pavan, Alan L. Selman
    Separation of NP-Completeness Notions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:906-918 [Journal]
  78. Alan L. Selman
    Polynomial Time Enumeration Reducibility. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:4, pp:440-457 [Journal]
  79. Alan L. Selman
    Natural Self-Reducible Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:989-996 [Journal]
  80. Alan L. Selman, Xu Mei-Rui, Ronald V. Book
    Positive Relativizations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:565-579 [Journal]
  81. Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta
    Properties of NP-Complete Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:516-542 [Journal]
  82. Theodore P. Baker, Alan L. Selman
    A Second Step Toward the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:177-187 [Journal]
  83. Richard E. Ladner, Nancy A. Lynch, Alan L. Selman
    A Comparison of Polynomial Time Reducibilities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1975, v:1, n:2, pp:103-123 [Journal]
  84. Luc Longpré, Alan L. Selman
    Hard Promise Problems and Nonuniform Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:115, n:2, pp:277-290 [Journal]
  85. Ashish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman
    A Hierarchy Based on Output Multiplicity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:207, n:1, pp:131-157 [Journal]
  86. Aduri Pavan, Alan L. Selman
    Complete distributional problems, hard languages, and resource-bounded measure. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:273-286 [Journal]
  87. Alan L. Selman
    Reductions on NP and P-Selective Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:287-304 [Journal]
  88. Christian Glaßer, Alan L. Selman, Liyu Zhang
    Canonical disjoint NP-pairs of propositional proof systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:60-73 [Journal]
  89. Christian Glaßer, Alan L. Selman, Liyu Zhang
    The Informational Content of Canonical Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:307-317 [Conf]
  90. Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Autoreducibility, mitoticity, and immunity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:5, pp:735-754 [Journal]
  91. Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran
    Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:167-178 [Journal]

  92. Non-mitotic Sets. [Citation Graph (, )][DBLP]


  93. The Informational Content of Canonical Disjoint NP-Pairs. [Citation Graph (, )][DBLP]


  94. Non-Mitotic Sets. [Citation Graph (, )][DBLP]


  95. The Complexity of Unions of Disjoint Sets. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002