The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2005, volume: 93, number: 3

  1. Akio Fujiyoshi
    Linearity and nondeletion on monadic context-free tree grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:103-107 [Journal]
  2. Andrzej Pelc, David Peleg
    Broadcasting with locally bounded Byzantine faults. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:109-115 [Journal]
  3. Mirtha-Lina Fernández
    Relaxing monotonicity for innermost termination. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:117-123 [Journal]
  4. L. Sunil Chandran, Fabrizio Grandoni
    Refined memorization for vertex cover. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:123-131 [Journal]
  5. Jianxi Fan, Xiaola Lin, Xiaohua Jia
    Node-pancyclicity and edge-pancyclicity of crossed cubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:133-138 [Journal]
  6. Jouni K. Seppänen
    Upper bound for the approximation ratio of a class of hypercube segmentation algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:139-141 [Journal]
  7. Sudip Seal, Srikanth Komarina, Srinivas Aluru
    An optimal hierarchical clustering algorithm for gene expression data. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:143-147 [Journal]
  8. Ludwig Staiger
    Constructive dimension equals Kolmogorov complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:3, pp:149-153 [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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002