default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen D. Travers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j9]Christian Glaßer, Stephen D. Travers, Klaus W. Wagner:
Perfect correspondences between dot-depth and polynomial-time hierarchies. J. Comput. Syst. Sci. 80(7): 1359-1373 (2014)- [j8]Christian Glaßer, John M. Hitchcock
, Aduri Pavan, Stephen D. Travers:
Unions of Disjoint NP-Complete Sets. ACM Trans. Comput. Theory 6(1): 3:1-3:10 (2014) - 2011
- [j7]Christian Glaßer, Aduri Pavan, Stephen D. Travers:
The fault tolerance of NP-hard problems. Inf. Comput. 209(3): 443-455 (2011) - [c9]Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers:
Unions of Disjoint NP-Complete Sets. COCOON 2011: 240-251 - 2010
- [j6]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): 1394-1403 (2010) - [j5]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): 80-103 (2010)
2000 – 2009
- 2009
- [j4]Christian Glaßer, Stephen D. Travers:
Machines that Can Output Empty Words. Theory Comput. Syst. 44(3): 369-390 (2009) - [j3]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang:
Non-mitotic sets. Theor. Comput. Sci. 410(21-23): 2011-2023 (2009) - [c8]Christian Glaßer, Aduri Pavan, Stephen D. Travers:
The Fault Tolerance of NP-Hard Problems. LATA 2009: 374-385 - 2008
- [j2]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): 1173-1187 (2008) - 2007
- [b1]Stephen D. Travers:
Structural Properties of NP-Hard Sets and Uniform Characterisations of Complexity Classes (Strukturelle Eigenschaften NP-harter Mengen und uniforme Charakterisierungen von Komplexitätsklassen). Würzburg University, Germany, 2007 - [c7]Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr:
Equivalence Problems for Circuits over Sets of Natural Numbers. CSR 2007: 127-138 - [c6]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang:
Non-mitotic Sets. FSTTCS 2007: 146-157 - [c5]Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr:
Satisfiability of Algebraic Circuits over Sets of Natural Numbers. FSTTCS 2007: 253-264 - [c4]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner:
The Complexity of Unions of Disjoint Sets. STACS 2007: 248-259 - 2006
- [j1]Stephen D. Travers:
The complexity of membership problems for circuits over sets of integers. Theor. Comput. Sci. 369(1-3): 211-229 (2006) - [c3]Christian Glaßer, Stephen D. Travers, Klaus W. Wagner:
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. Developments in Language Theory 2006: 408-419 - [c2]Christian Glaßer, Stephen D. Travers:
Machines that Can Output Empty Words. MFCS 2006: 436-446 - [i4]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner:
The Complexity of Unions of Disjoint Sets. Electron. Colloquium Comput. Complex. TR06 (2006) - [i3]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang:
Non-Mitotic Sets. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [i2]Christian Glaßer, Stephen D. Travers, Klaus W. Wagner:
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Christian Glaßer, Stephen D. Travers:
Machines that can Output Empty Words. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c1]Stephen D. Travers:
The Complexity of Membership Problems for Circuits over Sets of Integers. MFCS 2004: 322-333
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
