Search the dblp DataBase

Publications of Author

1. 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]
   
2. Christian Glaßer, Stephen D. Travers
   Machines that Can Output Empty Words. [Citation Graph (0, 0)][DBLP]
   MFCS, 2006, pp:436-446 [Conf]
   
3. 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]
   
4. 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]
   
5. 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]
   
6. 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]
   
7. 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]
   
8. 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]
   
9. 
   Satisfiability of Algebraic Circuits over Sets of Natural Numbers. [Citation Graph (, )][DBLP]
   
   
10. 
    Non-mitotic Sets. [Citation Graph (, )][DBLP]
    
    
11. 
    The Fault Tolerance of NP-Hard Problems. [Citation Graph (, )][DBLP]
    
    
12. 
    Satisfiability of algebraic circuits over sets of natural numbers. [Citation Graph (, )][DBLP]
    
    
13. 
    Non-Mitotic Sets. [Citation Graph (, )][DBLP]
    
    
14. 
    The Complexity of Unions of Disjoint Sets. [Citation Graph (, )][DBLP]