Prof. Dr. rer. nat. Heinz Schmitz
Informatik, Hochschule Trier
- 0651/8103-316
- 0651/8103-454
Schmitz, Heinz; Politz, Andreas; Dostert, Maria
A Complexity Analysis and an Algoritihmic Approach to Student Sectioning in Existing TimetablesJournal of Scheduling. Bd. 19. H. 3. Springer Science 2016 S. 285 - 293
Schmitz, Heinz; Lykourentzou, Ionna
An Online Approach to Task Assignment and Sequencing in Expert CrowdsourcingBd. http://www.humancomputation.com/2015/papers/46_Paper.pdf. San Diego. 2015
Glaßer, Christian; Schmitz, Heinz
Languages of Dot-Depth 3-2Theory of computing systems. Bd. 42. H. 2. New York, NY: Springer 2008
Glasser, C.; Schmitz, H.
Contributions - Level 5-2 of the Straubing-Thérien Hierarchy for Two-Letter AlphabetsLecture notes in computer science. Bd. 2295. Berlin: Springer 2002 S. 251 - 261
Glaßer, Christian; Schmitz, Heinz
The Boolean Structure of Dot-Depth OneJournal of Automata, Languages and Combinatorics. 4. Aufl. H. 6. 2001 S. 437 - 452
Glasser, Christian; Schmitz, Heinz
Contributions - Decidable Hierarchies of Starfree LanguagesLecture notes in computer science. Bd. 1974. Berlin: Springer 2000 S. 503 - 515
Schmitz, Heinz
Restricted Temporal Logic and Deterministic LanguagesJournal of Automata, Languages and Combinatorics. 3. Aufl. H. 5. 2000 S. 325 - 342
Kosub, S.; Schmitz, H.; Vollmer, H.
Uniform Characterizations of Complexity Classes of FunctionsInternational journal of foundations of computer science. Bd. 11. H. 4. Singapore [u.a.]: World Scient. 2000 S. 525 - 552
Schmitz, Heinz; Wagner, Klaus W.
The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy CoRR cs.CC/98091181998
Kosub, S.; Schmitz, H.; Vollmer, H.
Uniformly Defining Complexity Classes of FunctionsLecture notes in computer science. Bd. 1373. Berlin: Springer 1998 S. 607 - 617