| 2005 |
|---|
| 17 | EE | 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 | EE | 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 | EE | Elmar Böhler,
Steffen Reith,
Henning Schnoor,
Heribert Vollmer:
Bases for Boolean co-clones.
Inf. Process. Lett. 96(2): 59-66 (2005) |
| 2004 |
|---|
| 14 | EE | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism.
STACS 2004: 164-175 |
| 2003 |
|---|
| 13 | EE | Steffen Reith:
On the Complexity of Some Equivalence Problems for Propositional Calculi.
MFCS 2003: 632-641 |
| 12 | EE | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism
CoRR cs.CC/0306134: (2003) |
| 11 | EE | Steffen Reith,
Heribert Vollmer:
Optimal satisfiability for propositional calculi and constraint satisfaction problems.
Inf. Comput. 186(1): 1-19 (2003) |
| 2002 |
|---|
| 10 | EE | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction.
CSL 2002: 412-426 |
| 9 | EE | Elmar Boöler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CoRR cs.CC/0202036: (2002) |
| 2001 |
|---|
| 8 | EE | 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 | EE | 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 | EE | Steffen Reith,
Heribert Vollmer:
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems.
MFCS 2000: 640-649 |
| 4 | EE | 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 | EE | Steffen Reith,
Klaus W. Wagner:
On Boolean Lowness and Boolean Highness.
COCOON 1998: 147-156 |
| 2 | EE | Steffen Reith,
Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
CoRR cs.CC/9809116: (1998) |
| 1 | EE | Steffen Reith,
Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
Electronic Colloquium on Computational Complexity (ECCC) 5(22): (1998) |
