Steven Homer
Affiliations: | Boston University, Boston, MA, United States |
Area:
Computer ScienceGoogle:
"Steven Homer"Children
Sign in to add trainee| Loredana Lo Conte | grad student | 2000 | Boston University |
| Benjamin Hescott | grad student | 2008 | Boston University |
| Debajyoti Bera | grad student | 2010 | Boston University |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Buhrman H, Hescott B, Homer S, et al. (2010) Non-uniform reductions Theory of Computing Systems. 47: 317-341 |
| Bera D, Fenner S, Green F, et al. (2010) Efficient universal quantum circuits Quantum Information and Computation. 10: 16-27 |
| Bera D, Green F, Homer S. (2007) Small depth quantum circuits Sigact News. 38: 35-50 |
| Fenner S, Homer S, Pruim R, et al. (2001) Hyper-polynomial hierarchies and the polynomial jump Theoretical Computer Science. 262: 241-256 |
| Fenner S, Green F, Homer S, et al. (2000) Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy Proceedings of the Royal Society a: Mathematical, Physical and Engineering Sciences. 455: 3953-3966 |
| Homer S. (1999) Complexity, logic, and recursion theory , edited by Sorbi Andrea, Lecture notes in pure and applied mathematics, vol. 187, Marcel Dekker, Inc., New York, Basel, and Hong Kong, 1997, viii + 363 pp. Journal of Symbolic Logic. 64: 399-401 |
| Fenner S, Homer S, Ogihara M, et al. (1997) Oracles That Compute Values Siam Journal On Computing. 26: 1043-1065 |
| Chen Z, Homer S. (1997) Learning counting functions with queries Theoretical Computer Science. 180: 155-168 |
| Chen Z, Homer S. (1996) The bounded injury priority method and the learnability of unions of rectangles Annals of Pure and Applied Logic. 77: 143-168 |
| Goldsmith J, Homer S. (1996) Scalability and the isomorphism problem Information Processing Letters. 57: 137-143 |