Steven Homer - RankMe

67 papers A* 4A 8B 2Misc 2Journal 36Unranked 10

Year	Rank	Type	Title / Venue / Authors
2019	—	`conf`	Learning Hierarchical Spectral Representations of Human Speech with the Information Dynamics of Thinking. BNAIC/BENELEARN Steven Homer
2019	—	`conf`	Maximum Entropy Bayesian Actor Critic. BNAIC/BENELEARN Steven Homer
2018	J	`jnl`	Fixed-Parameter Extrapolation and Aperiodic Order: Open Problems. SIGACT News Stephen A. Fenner, Frederic Green, Steven Homer
2014	—	`ch.`	Computational Complexity. Computational Logic Lance Fortnow, Steven Homer
2014	—	`ch.`	Turing and the development of computational complexity. Turing's Legacy Steven Homer, Alan L. Selman
2011	—	`book`	Computability and Complexity Theory, Second Edition. Steven Homer, Alan L. Selman
2010	J	`jnl`	Efficient universal quantum circuits. Quantum Inf. Comput. Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer
2010	J	`jnl`	Non-Uniform Reductions. Theory Comput. Syst. Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet
2009	Misc	`conf`	Efficient Universal Quantum Circuits. COCOON Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer
2008	J	`jnl`	Universal Quantum Circuits CoRR Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer
2008	J	`jnl`	Universal Quantum Circuits. Electron. Colloquium Comput. Complex. Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer
2007	J	`jnl`	Small depth quantum circuits. SIGACT News Debajyoti Bera, Frederic Green, Steven Homer
2006	J	`jnl`	Quantum lower bounds for fanout. Quantum Inf. Comput. M. Fang, Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang
2005	B	`conf`	Bounds on the Power of Constant-Depth Quantum Circuits. FCT Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang
2003	J	`jnl`	A Short History of Computational Complexity. Bull. EATCS Lance Fortnow, Steven Homer
2002	J	`jnl`	Counting, fanout and the complexity of quantum ACC. Quantum Inf. Comput. Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett
2001	—	`book`	Computability and Complexity Theory. Steven Homer, Alan L. Selman
2001	J	`jnl`	Hyper-polynomial hierarchies and the polynomial jump. Theor. Comput. Sci. Stephen A. Fenner, Steven Homer, Randall J. Pruim, Marcus Schaefer
2000	A	`conf`	On the Complexity of Quantum ACC. CCC Frederic Green, Steven Homer, Chris Pollett
1999	J	`jnl`	Complements of Multivalued Functions. Chic. J. Theor. Comput. Sci. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
1999	J	`jnl`	Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy Electron. Colloquium Comput. Complex. Stephen A. Fenner, Frederic Green, Steven Homer, Randall J. Pruim
1997	J	`jnl`	Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut. J. Parallel Distributed Comput. Steven Homer, Marcus Peinado
1997	A	`conf`	Hyper-Polynomial Hierarchies and the NP-Jump. CCC Stephen A. Fenner, Steven Homer, Randall J. Pruim, Marcus Schaefer
1997	J	`jnl`	Learning Counting Functions with Queries. Theor. Comput. Sci. Zhixiang Chen, Steven Homer
1997	J	`jnl`	Oracles that Compute Values. SIAM J. Comput. Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman
1996	A	`conf`	Complements of Multivalued Functions. CCC Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
1996	Misc	`conf`	Finding a Hidden Code by Asking Questions. COCOON Zhixiang Chen, Carlos Cunha, Steven Homer
1996	A	`ed.`	Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996 CCC Steven Homer, Jin-Yi Cai
1996	J	`jnl`	Scalability and the Isomorphism Problem. Inf. Process. Lett. Judy Goldsmith, Steven Homer
1996	J	`jnl`	The Bounded Injury Priority Method and the Learnability of Unions of Rectangles. Ann. Pure Appl. Log. Zhixiang Chen, Steven Homer
1995	—	`conf`	A highly parallel algorithm to approximate MaxCut on distributed memory architectures. IPPS Steven Homer, Marcus Peinado
1995	B	`conf`	Nonuniform Lower Bounds for Exponential Time Classes. MFCS Steven Homer, Sarah Mocas
1995	A*	`conf`	On the Learnability of COLT Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer
1994	J	`jnl`	Immunity of Complete Problems Inf. Comput. Steven Homer, Jie Wang
1994	J	`jnl`	Minimal Pairs and Complete Problems. Theor. Comput. Sci. Klaus Ambos-Spies, Steven Homer, Robert I. Soare
1994	A*	`conf`	On Learning Counting Functions with Queries. COLT Zhixiang Chen, Steven Homer
1994	A*	`conf`	On Learning Discretized Geometric Concepts (Extended Abstract) FOCS Nader H. Bshouty, Zhixiang Chen, Steven Homer
1994	J	`jnl`	On Reductions of NP Sets to Sparse Sets. J. Comput. Syst. Sci. Steven Homer, Luc Longpré
1993	J	`jnl`	Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. Theor. Comput. Sci. Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
1993	—	`ed.`	Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992 Complexity Theory: Current Research Klaus Ambos-Spies, Steven Homer, Uwe Schöning
1993	—	`conf`	Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs. Cliques, Coloring, and Satisfiability Steven Homer, Marcus Peinado
1993	J	`jnl`	On A-Truth-Table-Hard Languages. Theor. Comput. Sci. Steven Homer, Stuart A. Kurtz, James S. Royer
1993	A	`conf`	On Using Oracles That Compute Values. STACS Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman
1992	J	`jnl`	Complete Problems and Strong Polynomial Reducibilities. SIAM J. Comput. K. Ganesan, Steven Homer
1992	J	`jnl`	Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. J. Comput. Syst. Sci. Steven Homer, Alan L. Selman
1992	—	`conf`	Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy. FSTTCS Harry Buhrman, Steven Homer
1991	J	`jnl`	Completeness for Nondeterministic Complexity Classes. Math. Syst. Theory Harry Buhrman, Steven Homer, Leen Torenvliet
1991	—	`conf`	On Reductions of NP Sets to Sparse Sets. SCT Steven Homer, Luc Longpré
1990	A	`conf`	A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. STACS Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
1990	A	`conf`	Minimal Pairs and Complete Problems. STACS Klaus Ambos-Spies, Steven Homer, Robert I. Soare
1990	J	`jnl`	Setting standards in Europe. Comput. Secur. Steven Homer
1990	—	`conf`	Structural Properties of Nondeterministic Complete Sets. SCT Steven Homer
1989	J	`jnl`	Absolute Results Concerning One-Way Functions and Their Applications. Math. Syst. Theory Steven Homer, Jie Wang
1989	A	`conf`	Complete Problems and Strong Polynomial Reducibilities. STACS K. Ganesan, Steven Homer
1989	—	`conf`	On Honest Polynomial Reductions, Relativizations, and P=NP. SCT Rodney G. Downey, Steven Homer, William I. Gasarch, Michael F. Moses
1989	—	`conf`	Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. SCT Steven Homer, Alan L. Selman
1987	J	`jnl`	Honest Polynomial Degrees and P=?NP. Theor. Comput. Sci. Steven Homer, Timothy J. Long
1987	J	`jnl`	Minimal degrees for polynomial reducibilities. J. ACM Steven Homer
1986	J	`jnl`	Arithmetic Theories for Computational Complexity Problems Inf. Control. Steven Homer, John H. Reif
1986	—	`conf`	On Simple and Creative Sets in NP. FSTTCS Steven Homer
1986	J	`jnl`	On Simple and Creative Sets in NP. Theor. Comput. Sci. Steven Homer
1984	A*	`conf`	Minimal Degrees for Honest Polynomial Reducibilities FOCS Steven Homer
1983	J	`jnl`	Intermediate beta-R.E. Degrees and the Half-Jump. J. Symb. Log. Steven Homer
1983	J	`jnl`	Oracle-Dependent Properties of the Lattice of NP Sets. Theor. Comput. Sci. Steven Homer, Wolfgang Maass
1983	J	`jnl`	Relativizations Comparing NP and Exponential Time Inf. Control. William I. Gasarch, Steven Homer
1982	J	`jnl`	Quadratic Automata. J. Comput. Syst. Sci. Jerry Goldman, Steven Homer
1981	J	`jnl`	Degrees of Non α-Speedable Sets. Math. Log. Q. Steven Homer, Barry E. Jacobs