| 2008 |
|---|
| 13 | EE | Christian Glaßer,
Christian Reitwießner,
Heinz Schmitz:
Multiobjective Disk Cover Admits a PTAS.
ISAAC 2008: 40-51 |
| 12 | EE | Christian Glasser,
Heinz Schmitz,
Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.
STACS 2008: 337-348 |
| 11 | EE | Christian Glasser,
Heinz Schmitz,
Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
CoRR abs/0802.2868: (2008) |
| 10 | EE | Christian Glaßer,
Heinz Schmitz:
Languages of Dot-Depth 3/2.
Theory Comput. Syst. 42(2): 256-286 (2008) |
| 2007 |
|---|
| 9 | EE | Christian Glasser,
Heinz Schmitz,
Victor L. Selivanov:
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages.
Electronic Colloquium on Computational Complexity (ECCC) 14(094): (2007) |
| 2001 |
|---|
| 8 | EE | Christian Glaßer,
Heinz Schmitz:
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets.
Developments in Language Theory 2001: 251-261 |
| 7 | | Christian Glaßer,
Heinz Schmitz:
The Boolean Structure of Dot-Depth One.
Journal of Automata, Languages and Combinatorics 6(4): 437-452 (2001) |
| 2000 |
|---|
| 6 | EE | Christian Glaßer,
Heinz Schmitz:
Decidable Hierarchies of Starfree Languages.
FSTTCS 2000: 503-515 |
| 5 | EE | Christian Glaßer,
Heinz Schmitz:
Languages of Dot-Depth 3/2.
STACS 2000: 555-566 |
| 4 | | Sven Kosub,
Heinz Schmitz,
Heribert Vollmer:
Uniform Characterizations of Complexity Classes of Functions.
Int. J. Found. Comput. Sci. 11(4): 525-551 (2000) |
| 3 | | Heinz Schmitz:
Restricted Temporal Logic and Deterministic Languages.
Journal of Automata, Languages and Combinatorics 5(3): 325-342 (2000) |
| 1998 |
|---|
| 2 | | Sven Kosub,
Heinz Schmitz,
Heribert Vollmer:
Uniformly Defining Complexity Classes of Functions.
STACS 1998: 607-617 |
| 1 | EE | Heinz Schmitz,
Klaus W. Wagner:
The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy
CoRR cs.CC/9809118: (1998) |
