The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Steffen Reith: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Steffen Reith, Klaus W. Wagner
    On Boolean Lowness and Boolean Highness. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:147-156 [Conf]
  2. Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    Equivalence and Isomorphism for Boolean Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:412-426 [Conf]
  3. Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer
    A polynomial-time approximation scheme for base station positioning in UMTS networks. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2001, pp:52-59 [Conf]
  4. Christian Glaßer, Steffen Reith, Heribert Vollmer
    The Complexity of Base Station Positioning in Cellular Networks. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:167-178 [Conf]
  5. Steffen Reith
    On the Complexity of Some Equivalence Problems for Propositional Calculi. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:632-641 [Conf]
  6. Steffen Reith, Heribert Vollmer
    Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:640-649 [Conf]
  7. Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    The Complexity of Boolean Constraint Isomorphism. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:164-175 [Conf]
  8. Elmar Boöler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    Equivalence and Isomorphism for Boolean Constraint Satisfaction [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  9. Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    The Complexity of Boolean Constraint Isomorphism [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  10. Steffen Reith, Heribert Vollmer
    The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  11. Christian Glaßer, Steffen Reith, Heribert Vollmer
    The complexity of base station positioning in cellular networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:148, n:1, pp:1-12 [Journal]
  12. Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
    Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:024, pp:- [Journal]
  13. Steffen Reith, Heribert Vollmer
    The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:22, pp:- [Journal]
  14. Steffen Reith, Heribert Vollmer
    Optimal satisfiability for propositional calculi and constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:1, pp:1-19 [Journal]
  15. Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer
    Bases for Boolean co-clones. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:2, pp:59-66 [Journal]
  16. Ulrich Hertrampf, Steffen Reith, Heribert Vollmer
    A note on closure properties of logspace MOD classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:3, pp:91-93 [Journal]
  17. Steffen Reith, Klaus W. Wagner
    On boolean lowness and boolean highness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:2, pp:305-321 [Journal]

  18. The Complexity of Problems for Quantified Constraints. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002