Steffen Reith

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

Coauthor Index

1	Michael Bauland	[16] [18]
2	Elmar Böhler	[9] [10] [12] [14] [15] [16] [18]
3	Nadia Creignou	[16] [18]
4	Matthias Galota	[8]
5	Christian Glaßer (Christian Glasser)	[6] [8] [17]
6	Edith Hemaspaandra (Edith Spaan)	[9] [10] [12] [14]
7	Ulrich Hertrampf	[4]
8	Henning Schnoor	[15] [16] [18]
9	Heribert Vollmer	[1] [2] [4] [5] [6] [8] [9] [10] [11] [12] [14] [15] [16] [17] [18]
10	Klaus W. Wagner	[3] [7]