Stephen D. Travers

23 papers A 1B 2C 2Misc 2Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2014 J jnl
Perfect correspondences between dot-depth and polynomial-time hierarchies.
J. Comput. Syst. Sci.
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
2014 J jnl
Unions of Disjoint NP-Complete Sets.
ACM Trans. Comput. Theory
Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers
2011 J jnl
The fault tolerance of NP-hard problems.
Inf. Comput.
Christian Glaßer, Aduri Pavan, Stephen D. Travers
2011 Misc conf
Unions of Disjoint NP-Complete Sets.
COCOON
Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers
2010 J jnl
Equivalence Problems for Circuits over Sets of Natural Numbers.
Theory Comput. Syst.
Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
2010 J jnl
Satisfiability of algebraic circuits over sets of natural numbers.
Discret. Appl. Math.
Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
2009 J jnl
Machines that Can Output Empty Words.
Theory Comput. Syst.
Christian Glaßer, Stephen D. Travers
2009 J jnl
Non-mitotic sets.
Theor. Comput. Sci.
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
2009 C conf
The Fault Tolerance of NP-Hard Problems.
LATA
Christian Glaßer, Aduri Pavan, Stephen D. Travers
2008 J jnl
The complexity of unions of disjoint sets.
J. Comput. Syst. Sci.
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
2007 Misc conf
Equivalence Problems for Circuits over Sets of Natural Numbers.
CSR
Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
2007 — conf
Non-mitotic Sets.
FSTTCS
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
2007 — conf
Satisfiability of Algebraic Circuits over Sets of Natural Numbers.
FSTTCS
Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
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
2007 A conf
The Complexity of Unions of Disjoint Sets.
STACS
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
2006 B conf
Machines that Can Output Empty Words.
MFCS
Christian Glaßer, Stephen D. Travers
2006 J jnl
Non-Mitotic Sets.
Electron. Colloquium Comput. Complex.
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang
2006 C conf
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy.
Developments in Language Theory
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
2006 J jnl
The Complexity of Unions of Disjoint Sets.
Electron. Colloquium Comput. Complex.
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
2006 J jnl
The complexity of membership problems for circuits over sets of integers.
Theor. Comput. Sci.
Stephen D. Travers
2005 J jnl
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes
Electron. Colloquium Comput. Complex.
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
2005 J jnl
Machines that can Output Empty Words
Electron. Colloquium Comput. Complex.
Christian Glaßer, Stephen D. Travers
2004 B conf
The Complexity of Membership Problems for Circuits over Sets of Integers.
MFCS
Stephen D. Travers