The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Elmar Böhler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Elmar Böhler, Christian Glaßer, Daniel Meister
    Error-Bounded Probabilistic Computations between MA and AM. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:249-258 [Conf]
  3. Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
    Generation Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:392-403 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Elmar Böhler, Christian Glaßer, Daniel Meister
    Small Bounded-Error Computations and Completeness [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:069, pp:- [Journal]
  8. Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
    Generation Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:037, pp:- [Journal]
  9. 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]
  10. Elmar Böhler
    On the Lattice of Clones Below the Polynomial Time Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:028, pp:- [Journal]
  11. 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]
  12. Elmar Böhler, Christian Glaßer, Daniel Meister
    Error-bounded probabilistic computations between MA and AM. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:6, pp:1043-1076 [Journal]
  13. Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
    Generation problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:260-295 [Journal]

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


Search in 0.031secs, Finished in 0.032secs
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