Elmar Böhler

	2010
18		Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer: Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems CoRR abs/1009.1208: (2010)
17		Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer: The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. 47(2): 454-490 (2010)
	2007
16		Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor: The Complexity of Problems for Quantified Constraints. Electronic Colloquium on Computational Complexity (ECCC) 14(023): (2007)
15		Elmar Böhler, Henning Schnoor: The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. Theory Comput. Syst. 41(4): 753-777 (2007)
	2006
14		Elmar Böhler, Christian Glaßer, Daniel Meister: Error-bounded probabilistic computations between MA and AM. J. Comput. Syst. Sci. 72(6): 1043-1076 (2006)
	2005
13		Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer: Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation Electronic Colloquium on Computational Complexity (ECCC)(024): (2005)
12		Elmar Böhler: On the Lattice of Clones Below the Polynomial Time Functions Electronic Colloquium on Computational Complexity (ECCC)(028): (2005)
11		Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer: Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005)
10		Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation problems. Theor. Comput. Sci. 345(2-3): 260-295 (2005)
9		Elmar Böhler: Algebraic closures in complexity theory. Julius Maximilian University of Würzburg 2005: 1-140
	2004
8		Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation Problems. MFCS 2004: 392-403
7		Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175
6		Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation Problems Electronic Colloquium on Computational Complexity (ECCC)(037): (2004)
	2003
5		Elmar Böhler, Christian Glaßer, Daniel Meister: Error-Bounded Probabilistic Computations between MA and AM. MFCS 2003: 249-258
4		Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism CoRR cs.CC/0306134: (2003)
3		Elmar Böhler, Christian Glaßer, Daniel Meister: Small Bounded-Error Computations and Completeness Electronic Colloquium on Computational Complexity (ECCC)(069): (2003)
	2002
2		Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426
1		Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction CoRR cs.CC/0202036: (2002)

Coauthor Index

1	Michael Bauland	[13] [16] [17]
2	Nadia Creignou	[13] [16] [17] [18]
3	Matthias Galota	[18]
4	Christian Glaßer (Christian Glasser)	[3] [5] [6] [8] [10] [14]
5	Edith Hemaspaandra (Edith Spaan)	[1] [2] [4] [7]
6	Daniel Meister	[3] [5] [14]
7	Steffen Reith	[1] [2] [4] [7] [11] [13] [16] [17] [18]
8	Henning Schnoor	[11] [13] [15] [16] [17] [18]
9	Bernhard Schwarz	[6] [8] [10]
10	Heribert Vollmer	[1] [2] [4] [7] [11] [13] [16] [17] [18]
11	Klaus W. Wagner	[6] [8] [10]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page