Stephen D. Travers

Publication Activity (10 Years)

Years Active: 2004-2014
Publications (10 Years): 0

Top Topics

Correspondence Matching

Polynomial Time Complexity

Top Venues

J. Comput. Syst. Sci.

ACM Trans. Comput. Theory

Publications

Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers
Unions of Disjoint NP-Complete Sets. ACM Trans. Comput. Theory 6 (1) (2014)
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
Perfect correspondences between dot-depth and polynomial-time hierarchies. J. Comput. Syst. Sci. 80 (7) (2014)
Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers
Unions of Disjoint NP-Complete Sets. COCOON (2011)
Christian Glaßer, Aduri Pavan, Stephen D. Travers
The fault tolerance of NP-hard problems. Inf. Comput. 209 (3) (2011)
Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
Equivalence Problems for Circuits over Sets of Natural Numbers. Theory Comput. Syst. 46 (1) (2010)
Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
Satisfiability of algebraic circuits over sets of natural numbers. Discret. Appl. Math. 158 (13) (2010)
Christian Glaßer, Aduri Pavan, Stephen D. Travers
The Fault Tolerance of NP-Hard Problems. LATA (2009)
Christian Glaßer, Stephen D. Travers
Machines that Can Output Empty Words. Theory Comput. Syst. 44 (3) (2009)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
Non-mitotic sets. Theor. Comput. Sci. 410 (21-23) (2009)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The complexity of unions of disjoint sets. J. Comput. Syst. Sci. 74 (7) (2008)
Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
Satisfiability of Algebraic Circuits over Sets of Natural Numbers. FSTTCS (2007)
Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
Equivalence Problems for Circuits over Sets of Natural Numbers. CSR (2007)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The Complexity of Unions of Disjoint Sets. STACS (2007)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
Non-mitotic Sets. FSTTCS (2007)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
Non-Mitotic Sets. Electron. Colloquium Comput. Complex. 13 (090) (2006)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The Complexity of Unions of Disjoint Sets. Electron. Colloquium Comput. Complex. 13 (069) (2006)
Christian Glaßer, Stephen D. Travers
Machines that Can Output Empty Words. MFCS (2006)
Stephen D. Travers
The complexity of membership problems for circuits over sets of integers. Theor. Comput. Sci. 369 (1-3) (2006)
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. Developments in Language Theory (2006)
Christian Glaßer, Stephen D. Travers
Machines that can Output Empty Words Electron. Colloquium Comput. Complex. (147) (2005)
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes Electron. Colloquium Comput. Complex. (035) (2005)
Stephen D. Travers
The Complexity of Membership Problems for Circuits over Sets of Integers. MFCS (2004)