The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1975, volume: 4, number: 1

  1. Giorgio Germano, Andrea Maggiolo-Schettini
    Sequence-to-Sequence Recursiveness. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:1-6 [Journal]
  2. Keijo Ruohonen
    Three Results of Comparison Between L Languages with and without Interaction. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:7-10 [Journal]
  3. Martti Penttonen
    ET0L-Grammars and N-Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:11-13 [Journal]
  4. Juhani Nieminen
    On Homomorphic Images of Transition Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:14-15 [Journal]
  5. Juhani Nieminen
    Some Observations on the Determination of an Upper Bound for the Clique Number of a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:16-17 [Journal]
  6. Andy N. C. Kang, David A. Ault
    Some Properties of a Centroid of a Free Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:18-20 [Journal]
  7. Andrew Chi-Chih Yao
    An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:21-23 [Journal]
  8. Jayadev Misra, Robert Endre Tarjan
    Optimal Chain Partitions of Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:24-26 [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