# Steven Homer

Affiliations:- Boston University, USA

According to our database

Collaborative distances:

^{1}, Steven Homer authored at least 58 papers between 1981 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2020

Review of Kernelization: Theory of Parameterized Preprocessing by Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi.

SIGACT News, 2020

2019

Proceedings of the 31st Benelux Conference on Artificial Intelligence (BNAIC 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), 2019

Learning Hierarchical Spectral Representations of Human Speech with the Information Dynamics of Thinking.

Proceedings of the 31st Benelux Conference on Artificial Intelligence (BNAIC 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), 2019

2018

SIGACT News, 2018

2017

SIGACT News, 2017

2014

Proceedings of the Computational Logic, 2014

Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2011

Texts in Computer Science, Springer, ISBN: 978-1-4614-0682-2, 2011

2010

Quantum Inf. Comput., 2010

Theory Comput. Syst., 2010

2008

Electron. Colloquium Comput. Complex., 2008

2007

SIGACT News, 2007

2006

Quantum Inf. Comput., 2006

2005

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2003

A Short History of Computational Complexity.

Bull. EATCS, 2003

2002

Quantum Inf. Comput., 2002

2001

Texts in Computer Science, Springer, ISBN: 978-1-4757-3544-4, 2001

Theor. Comput. Sci., 2001

2000

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999

Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy

Electron. Colloquium Comput. Complex., 1999

Chic. J. Theor. Comput. Sci., 1999

1997

Theor. Comput. Sci., 1997

SIAM J. Comput., 1997

Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut.

J. Parallel Distributed Comput., 1997

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

Inf. Process. Lett., 1996

Ann. Pure Appl. Log., 1996

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

A highly parallel algorithm to approximate MaxCut on distributed memory architectures.

Proceedings of IPPS '95, 1995

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994

Inf. Comput., April, 1994

Theor. Comput. Sci., 1994

J. Comput. Syst. Sci., 1994

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Theor. Comput. Sci., 1993

Theor. Comput. Sci., 1993

Proceedings of the STACS 93, 1993

Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs.

Proceedings of the Cliques, 1993

1992

SIAM J. Comput., 1992

Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography.

J. Comput. Syst. Sci., 1992

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991

Math. Syst. Theory, 1991

1990

Comput. Secur., 1990

Proceedings of the STACS 90, 1990

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989

Math. Syst. Theory, 1989

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1987

Theor. Comput. Sci., 1987

J. ACM, 1987

1986

Theor. Comput. Sci., 1986

Inf. Control., 1986

1984

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Theor. Comput. Sci., 1983

J. Symb. Log., 1983

Inf. Control., 1983

1982

J. Comput. Syst. Sci., 1982

1981

Math. Log. Q., 1981