Search the dblp DataBase
Stephen D. Travers :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Christian Glaßer , Stephen D. Travers , Klaus W. Wagner Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2006, pp:408-419 [Conf ] Christian Glaßer , Stephen D. Travers Machines that Can Output Empty Words. [Citation Graph (0, 0)][DBLP ] MFCS, 2006, pp:436-446 [Conf ] Stephen D. Travers The Complexity of Membership Problems for Circuits over Sets of Integers. [Citation Graph (0, 0)][DBLP ] MFCS, 2004, pp:322-333 [Conf ] Christian Glaßer , Alan L. Selman , Stephen D. Travers , Klaus W. Wagner The Complexity of Unions of Disjoint Sets. [Citation Graph (0, 0)][DBLP ] STACS, 2007, pp:248-259 [Conf ] Christian Glaßer , Stephen D. Travers , Klaus W. Wagner A Reducibility that Corresponds to Unbalanced Leaf-Language Classes [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:035, pp:- [Journal ] Christian Glaßer , Stephen D. Travers Machines that can Output Empty Words [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:147, pp:- [Journal ] Stephen D. Travers The complexity of membership problems for circuits over sets of integers. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:369, n:1-3, pp:211-229 [Journal ] Christian Glaßer , Katrin Herr , Christian Reitwießner , Stephen D. Travers , Matthias Waldherr Equivalence Problems for Circuits over Sets of Natural Numbers. [Citation Graph (0, 0)][DBLP ] CSR, 2007, pp:127-138 [Conf ] Satisfiability of Algebraic Circuits over Sets of Natural Numbers. [Citation Graph (, )][DBLP ] Non-mitotic Sets. [Citation Graph (, )][DBLP ] The Fault Tolerance of NP-Hard Problems. [Citation Graph (, )][DBLP ] Satisfiability of algebraic circuits over sets of natural numbers. [Citation Graph (, )][DBLP ] Non-Mitotic Sets. [Citation Graph (, )][DBLP ] The Complexity of Unions of Disjoint Sets. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs