The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Heinz Schmitz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christian Glaßer, Heinz Schmitz
    Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:251-261 [Conf]
  2. Christian Glaßer, Heinz Schmitz
    Decidable Hierarchies of Starfree Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:503-515 [Conf]
  3. Christian Glaßer, Heinz Schmitz
    Languages of Dot-Depth 3/2. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:555-566 [Conf]
  4. Sven Kosub, Heinz Schmitz, Heribert Vollmer
    Uniformly Defining Complexity Classes of Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:607-617 [Conf]
  5. Heinz Schmitz, Klaus W. Wagner
    The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  6. Sven Kosub, Heinz Schmitz, Heribert Vollmer
    Uniform Characterizations of Complexity Classes of Functions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:4, pp:525-551 [Journal]
  7. Christian Glaßer, Heinz Schmitz
    The Boolean Structure of Dot-Depth One. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:437-452 [Journal]
  8. Heinz Schmitz
    Restricted Temporal Logic and Deterministic Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2000, v:5, n:3, pp:325-342 [Journal]

  9. Approximability and Hardness in Multi-objective Optimization. [Citation Graph (, )][DBLP]


  10. Multiobjective Disk Cover Admits a PTAS. [Citation Graph (, )][DBLP]


  11. Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. [Citation Graph (, )][DBLP]


  12. Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages [Citation Graph (, )][DBLP]


  13. Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. [Citation Graph (, )][DBLP]


Search in 0.025secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002