The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Steven Homer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer
    Hyper-Polynomial Hierarchies and the NP-Jump. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:102-110 [Conf]
  3. Rodney G. Downey, Steven Homer, William I. Gasarch, Michael Moses
    On Honest Polynomial Reductions, Relativizations, and P=NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:196-207 [Conf]
  4. Frederic Green, Steven Homer, Chris Pollett
    On the Complexity of Quantum ACC. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:250-262 [Conf]
  5. Steven Homer
    Structural Properties of Nondeterministic Complete Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:3-10 [Conf]
  6. Steven Homer, Luc Longpré
    On Reductions of NP Sets to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:79-88 [Conf]
  7. 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]
  8. Zhixiang Chen, Carlos Cunha, Steven Homer
    Finding a Hidden Code by Asking Questions. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:50-55 [Conf]
  9. Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer
    On the Learnability of Zn-DNF Formulas (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:198-205 [Conf]
  10. Zhixiang Chen, Steven Homer
    On Learning Counting Functions with Queries. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:218-227 [Conf]
  11. Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang
    Bounds on the Power of Constant-Depth Quantum Circuits. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:44-55 [Conf]
  12. Nader H. Bshouty, Zhixiang Chen, Steven Homer
    On Learning Discretized Geometric Concepts (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:54-63 [Conf]
  13. Steven Homer
    Minimal Degrees for Honest Polynomial Reducibilities [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:300-307 [Conf]
  14. Harry Buhrman, Steven Homer
    Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:116-127 [Conf]
  15. Steven Homer
    On Simple and Creative Sets in NP. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:412-425 [Conf]
  16. Steven Homer, Marcus Peinado
    A highly parallel algorithm to approximate MaxCut on distributed memory architectures. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:113-117 [Conf]
  17. Steven Homer, Sarah Mocas
    Nonuniform Lower Bounds for Exponential Time Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:159-168 [Conf]
  18. Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
    A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:1-11 [Conf]
  19. Klaus Ambos-Spies, Steven Homer, Robert I. Soare
    Minimal Pairs and Complete Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:24-36 [Conf]
  20. 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]
  21. K. Ganesan, Steven Homer
    Complete Problems and Strong Polynomial Reducibilities. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:240-250 [Conf]
  22. Zhixiang Chen, Steven Homer
    The Bounded Injury Priority Method and the Learnability of Unions of Rectangles. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:77, n:2, pp:143-168 [Journal]
  23. 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]
  24. Lance Fortnow, Steve Homer
    A Short History of Computational Complexity. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:80, n:, pp:95-133 [Journal]
  25. Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim
    Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:3, pp:- [Journal]
  26. William I. Gasarch, Steven Homer
    Relativizations Comparing NP and Exponential Time [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:58, n:1-3, pp:88-100 [Journal]
  27. Steven Homer, John H. Reif
    Arithmetic Theories for Computational Complexity Problems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:69, n:1-3, pp:1-11 [Journal]
  28. Steven Homer, Jie Wang
    Immunity of Complete Problems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:110, n:1, pp:119-129 [Journal]
  29. Judy Goldsmith, Steven Homer
    Scalability and the Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:3, pp:137-143 [Journal]
  30. Steven Homer
    Minimal degrees for polynomial reducibilities. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:2, pp:480-491 [Journal]
  31. Jerry Goldman, Steven Homer
    Quadratic Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:24, n:2, pp:180-196 [Journal]
  32. Steven Homer, Luc Longpré
    On Reductions of NP Sets to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:2, pp:324-336 [Journal]
  33. 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]
  34. Steven Homer, Marcus Peinado
    Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:46, n:1, pp:48-61 [Journal]
  35. Steven Homer
    Intermediate beta-R.E. Degrees and the Half-Jump. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:3, pp:790-796 [Journal]
  36. Harry Buhrman, Steven Homer, Leen Torenvliet
    Completeness for Nondeterministic Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:3, pp:179-200 [Journal]
  37. Steven Homer, Jie Wang
    Absolute Results Concerning One-Way Functions and Their Applications. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1989, v:22, n:1, pp:21-35 [Journal]
  38. 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]
  39. K. Ganesan, Steven Homer
    Complete Problems and Strong Polynomial Reducibilities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:4, pp:733-742 [Journal]
  40. Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
    Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:115, n:2, pp:225-241 [Journal]
  41. Klaus Ambos-Spies, Steven Homer, Robert I. Soare
    Minimal Pairs and Complete Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:229-241 [Journal]
  42. Zhixiang Chen, Steven Homer
    Learning Counting Functions with Queries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:155-168 [Journal]
  43. Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer
    Hyper-polynomial hierarchies and the polynomial jump. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:241-256 [Journal]
  44. Steven Homer
    On Simple and Creative Sets in NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:169-180 [Journal]
  45. Steven Homer, Stuart A. Kurtz, James S. Royer
    On A-Truth-Table-Hard Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:115, n:2, pp:383-389 [Journal]
  46. Steven Homer, Timothy J. Long
    Honest Polynomial Degrees and P=?NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:265-280 [Journal]
  47. Steven Homer, Wolfgang Maass
    Oracle-Dependent Properties of the Lattice of NP Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:24, n:, pp:279-289 [Journal]

  48. Efficient Universal Quantum Circuits. [Citation Graph (, )][DBLP]


  49. Setting standards in Europe. [Citation Graph (, )][DBLP]


  50. Universal Quantum Circuits [Citation Graph (, )][DBLP]


  51. Universal Quantum Circuits. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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