Clement T. Yu, D. T. Johnson On the Complexity of Finding the Set of Candidate Keys for a Given Set of Functional Dependencies. [Citation Graph (2, 0)][DBLP] Inf. Process. Lett., 1976, v:5, n:4, pp:100-101 [Journal]
Harold N. Gabow Some Improved Bounds on the Number of 1-Factors of n-Connected Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1976, v:5, n:4, pp:113-115 [Journal]
Pierre Hansen Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1976, v:5, n:4, pp:124- [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