The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1979, volume: 9, number: 2

  1. Mark R. Brown
    Some Observations on Random 2-3 Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:57-59 [Journal]
  2. Jan Grabowski
    The Unsolvability of Some Petri Net Language Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:60-63 [Journal]
  3. F. N. Teskey
    Document Retrieval Using Associative Processors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:64-67 [Journal]
  4. F. Frances Yao
    Graph 2-Isomorphism is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:68-72 [Journal]
  5. Akihiro Nozaki
    A Note on the Complexity of Approximative Evaluation of Polynomials. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:73-75 [Journal]
  6. Richard L. Schwartz
    Aliasing Among Pointers in EUCLID. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:76-79 [Journal]
  7. W. S. Luk
    `Possible' Membership of a Multivalued Dependency in a Relational Database. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:80-83 [Journal]
  8. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    An Observation on Scattered Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:84-85 [Journal]
  9. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    Finding a Homomorphism Between Two Words is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:86-88 [Journal]
  10. B. Srinivasan, V. Rajaraman
    On the Normalization of Relational Databases. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:89-92 [Journal]
  11. Abhijit Sengupta, Subir Bandyopadhyay, Pradip K. Srimani
    On Identification of CR Property in File Organisation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:93-96 [Journal]
  12. John Grant
    Partial Values in a Tabular Database Model. [Citation Graph (13, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:97-99 [Journal]
  13. Boguslaw L. Jackowski, Ryszard Kubiak, Stefan Sokolowski
    Complexity of Sorting by Distributive Partitioning. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:100- [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