We stand with Ukraine  

Stephen D. Travers

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Unions of Disjoint NP-Complete Sets.
[BibTeX]
[DOI]
Christian Glaßer
,
John M. Hitchcock
,
Aduri Pavan
,
Stephen D. Travers
ACM Trans. Comput. Theory, 2014

Perfect correspondences between dot-depth and polynomial-time hierarchies.
[BibTeX]
[DOI]
Christian Glaßer
,
Stephen D. Travers
,
Klaus W. Wagner
J. Comput. Syst. Sci., 2014

2011
The fault tolerance of NP-hard problems.
[BibTeX]
[DOI]
Christian Glaßer
,
Aduri Pavan
,
Stephen D. Travers
Inf. Comput., 2011

2010
Equivalence Problems for Circuits over Sets of Natural Numbers.
[BibTeX]
[DOI]
Christian Glaßer
,
Katrin Herr
,
Christian Reitwießner
,
Stephen D. Travers
,
Matthias Waldherr
Theory Comput. Syst., 2010

Satisfiability of algebraic circuits over sets of natural numbers.
[BibTeX]
[DOI]
Christian Glaßer
,
Christian Reitwießner
,
Stephen D. Travers
,
Matthias Waldherr
Discret. Appl. Math., 2010

2009
Non-mitotic sets.
[BibTeX]
[DOI]
Christian Glaßer
,
Alan L. Selman
,
Stephen D. Travers
,
Liyu Zhang
Theor. Comput. Sci., 2009

2008
The complexity of unions of disjoint sets.
[BibTeX]
[DOI]
Christian Glaßer
,
Alan L. Selman
,
Stephen D. Travers
,
Klaus W. Wagner
J. Comput. Syst. Sci., 2008

2007
Structural Properties of NP-Hard Sets and Uniform Characterisations of Complexity Classes (Strukturelle Eigenschaften NP-harter Mengen und uniforme Charakterisierungen von Komplexitätsklassen)
[BibTeX]
[DOI]
Stephen D. Travers
PhD thesis, 2007

2006
The complexity of membership problems for circuits over sets of integers.
[BibTeX]
[DOI]
Stephen D. Travers
Theor. Comput. Sci., 2006

Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy.
[BibTeX]
[DOI]
Christian Glaßer
,
Stephen D. Travers
,
Klaus W. Wagner
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Machines that can Output Empty Words
[BibTeX]
[DOI]
Christian Glaßer
,
Stephen D. Travers
Electron. Colloquium Comput. Complex., 2005

A Reducibility that Corresponds to Unbalanced Leaf-Language Classes
[BibTeX]
[DOI]
Christian Glaßer
,
Stephen D. Travers
,
Klaus W. Wagner
Electron. Colloquium Comput. Complex., 2005


  Loading...