Journals in DBLP

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

1. Gerard Salton
   The Performance of Interactive Information Retrieval. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1971, v:1, n:2, pp:35-41 [Journal]
   
2. Dennis Tsichritzis
   A Note on Comparison of Subrecursive Hierarchies. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1971, v:1, n:2, pp:42-44 [Journal]
   
3. B. F. Caviness, P. L. Pollack, C. M. Rubald
   An Existence Lemma for Canonical Forms in Symbolic Mathematics. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1971, v:1, n:2, pp:45-46 [Journal]
   
4. David L. Milgram, Azriel Rosenfeld
   A Note on Scattered Context Grammars. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1971, v:1, n:2, pp:47-50 [Journal]
   
5. Derek G. Corneil
   An n² Algorithm for Determining the Bridges of a Graph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1971, v:1, n:2, pp:51-55 [Journal]
   
6. J. Ian Munro
   Efficient Determination of the Transitive Closure of a Directed Graph. [Citation Graph (2, 0)][DBLP]
   Inf. Process. Lett., 1971, v:1, n:2, pp:56-58 [Journal]
   
7. Erol Gelenbe
   The Two-Thirds Rule for Dynamic Storage Allocation Under Equilibrium. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1971, v:1, n:2, pp:59-60 [Journal]
   
8. H. Scheidig
   Representation and Equality of Modes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1971, v:1, n:2, pp:61-65 [Journal]
   
9. Allan Borodin, J. Ian Munro
   Evaluating Polynomials at Many Points. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1971, v:1, n:2, pp:66-68 [Journal]