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

Journals in DBLP

Theory Comput. Syst.
2000, volume: 33, number: 2

  1. David W. Juedes, Jack H. Lutz
    Modeling Time-Bounded Prefix Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:2, pp:111-123 [Journal]
  2. Bruno Courcelle, Johann A. Makowsky, Udi Rotics
    Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:2, pp:125-150 [Journal]
  3. Wolfgang Lindner, Rainer Schuler, Osamu Watanabe
    Resource-Bounded Measure and Learnability. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:2, pp:151-170 [Journal]
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