The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1997, volume: 64, number: 4

  1. Stephen Alstrup, Jens P. Secher, Maz Spork
    Optimal On-Line Decremental Connectivity in Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:4, pp:161-164 [Journal]
  2. Marco Cesati, Luca Trevisan
    On the Efficiency of Polynomial Time Approximation Schemes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:4, pp:165-171 [Journal]
  3. Santosh N. Kabadi, Yash P. Aneja
    An Efficient, Strongly Polynomial, epsilon-Approximation Schemes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:4, pp:173-177 [Journal]
  4. Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe
    Partial Occam's Razor and its Applications. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:4, pp:179-185 [Journal]
  5. Jerzy Tyszkiewicz
    A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:4, pp:187-195 [Journal]
  6. Abbas Edalat, David W. N. Sharp, R. Lyndon While
    Bounding the Attractor of an IFS. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:4, pp:197-202 [Journal]
  7. Anindo Bagchi
    Route Selection with Multiple Metrics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:4, pp:203-205 [Journal]
  8. Silvano Di Zenzo, Paolo Bottoni, Piero Mussio
    A Notion of Information Related to Computation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:4, pp:207-215 [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