The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1973, volume: 2, number: 1

  1. Naftaly H. Minsky
    Representation of Binary Trees on Associative Memories. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:1, pp:1-5 [Journal]
  2. Gerard Salton
    Experiments in Multi-Lingual Information Retrieval. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:1, pp:6-11 [Journal]
  3. J. M. Robson
    An Improved Algorithm for Traversing Binary Trees Without Auxiliary Stack. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:1, pp:12-14 [Journal]
  4. Edward G. Coffman Jr.
    A Note on the Relative Performance of Two Disk Scanning Policies. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:1, pp:15-17 [Journal]
  5. R. A. Jarvis
    On the Identification of the Convex Hull of a Finite Set of Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:1, pp:18-21 [Journal]
  6. Jaroslav Král, Jirí Demner
    A Note on the Number of States of the DeRemer's Recognizer. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:1, pp:22-23 [Journal]
  7. Gábor Várhegyi
    Numerical Differentiation of Experimental Data. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:1, pp:24-25 [Journal]
  8. Wolfgang Henhapl
    A Transformation of Marked Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:1, pp:26-29 [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