Equivalence and Isomorphism for Boolean Constraint Satisfaction. - Elmar Böhler; Edith Hemaspaandra; Steffen Reith; Heribert Vollmer (CSL, 2002)

Small Bounded-Error Computations and Completeness - Elmar Böhler; Christian Glaßer; Daniel Meister 001 (Electron. Colloquium Comput. Complex., 2003)

The Complexity of Boolean Constraint Isomorphism. - Elmar Böhler; Edith Hemaspaandra; Steffen Reith; Heribert Vollmer (STACS, 2004)

Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation - Michael Bauland; Elmar Böhler; Nadia Creignou; Steffen Reith; Henning Schnoor; Heribert Vollmer (Electron. Colloquium Comput. Complex., 2005)

On the Lattice of Clones Below the Polynomial Time Functions - Elmar Böhler (Electron. Colloquium Comput. Complex., 2005)

Bases for Boolean co-clones. - Elmar Böhler; Steffen Reith; Henning Schnoor; Heribert Vollmer (Inf. Process. Lett., 2005)

Generation problems. - Elmar Böhler; Christian Glaßer; Bernhard Schwarz; Klaus W. Wagner (Theor. Comput. Sci., 2005)

Algebraic closures in complexity theory. - Elmar Böhler (2005)

Error-bounded probabilistic computations between MA and AM. - Elmar Böhler; Christian Glaßer; Daniel Meister 001 (J. Comput. Syst. Sci., 2006)

The Complexity of Problems for Quantified Constraints. - Heribert Vollmer; Michael Bauland; Elmar Böhler; Nadia Creignou; Steffen Reith; Henning Schnoor (Electron. Colloquium Comput. Complex., 2007)

The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. - Elmar Böhler; Henning Schnoor (Theory Comput. Syst., 2007)

Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems - Elmar Böhler; Nadia Creignou; Matthias Galota; Steffen Reith; Henning Schnoor; Heribert Vollmer (Log. Methods Comput. Sci., 2010)