Stephen D. Travers

According to our database, Stephen D. Travers authored at least 12 papers between 2004 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2014

Perfect correspondences between dot-depth and polynomial-time hierarchies.

Christian Glaßer, Stephen D. Travers, Klaus W. Wagner

J. Comput. Syst. Sci., 2014

2011

Unions of Disjoint NP-Complete Sets.

Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2009

The Fault Tolerance of NP-Hard Problems.

Christian Glaßer, Aduri Pavan, Stephen D. Travers

Proceedings of the Language and Automata Theory and Applications, 2009

2007

Structural Properties of NP-Hard Sets and Uniform Characterisations of Complexity Classes (Strukturelle Eigenschaften NP-harter Mengen und uniforme Charakterisierungen von Komplexitätsklassen)

Stephen D. Travers

PhD thesis, 2007

The Complexity of Unions of Disjoint Sets.

Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner

Proceedings of the STACS 2007, 2007

Non-mitotic Sets.

Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Satisfiability of Algebraic Circuits over Sets of Natural Numbers.

Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Equivalence Problems for Circuits over Sets of Natural Numbers.

Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr

Proceedings of the Computer Science, 2007

2006

Machines that Can Output Empty Words.

Christian Glaßer, Stephen D. Travers

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy.

Christian Glaßer, Stephen D. Travers, Klaus W. Wagner

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

A Reducibility that Corresponds to Unbalanced Leaf-Language Classes

Christian Glaßer, Stephen D. Travers, Klaus W. Wagner

Electron. Colloquium Comput. Complex., 2005

2004

The Complexity of Membership Problems for Circuits over Sets of Integers.

Stephen D. Travers

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004