James C. Tiernan An efficient search algorithm to find the elementary circuits of a graph. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1970, v:13, n:12, pp:722-726 [Journal]
Howard L. Morgan An interrupt based organization for management information systems. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1970, v:13, n:12, pp:734-739 [Journal]
Arthur H. J. Sale Remark on algorithms 352: characteristic values and associated solutions of Mathieu's differential equation. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1970, v:13, n:12, pp:750- [Journal]
G. W. Stewart Remark on algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1970, v:13, n:12, pp:750- [Journal]
E. Fuchs, P. E. Jackson Estimates of distributions of random variables for certain computer communications traffic models. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1970, v:13, n:12, pp:752-757 [Journal]
Charles C. Pinter On decomposing a Boolean function and simplfying the components separately. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1970, v:13, n:12, pp:758- [Journal]
Robert A. Wagner Finiteness assumptions and intellectual isolation of computer scientists. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1970, v:13, n:12, pp:759-760 [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
