The SCEAS System
Navigation Menu

Journals in DBLP

Commun. ACM
1961, volume: 4, number: 4

  1. Harry D. Huskey
    From the President of ACM. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:165- [Journal]

  2. Editor's note. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:166- [Journal]
  3. Daniel J. Lasser
    Topological ordering of a list of randomly-numbered elements of a network. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:167-168 [Journal]
  4. Oliver K. Smith
    Eigenvalues of a symmetric 3 × 3 matrix. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:168- [Journal]
  5. R. E. Nather
    On the compilation of subscripted variables. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:169-171 [Journal]
  6. Marion C. Gray
    Bessel functions of integral order and complex argument. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:169- [Journal]
  7. E. Karst
    An approximating transcendental numbers by continued fractions. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:171- [Journal]
  8. Philip M. Sherman
    Table look-at techniques. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:172-173 [Journal]
  9. Gerald M. Weinberg
    Programmed error correction on a decimal computer. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:174- [Journal]
  10. Henry C. Thacher Jr.
    Algorithm 43: CROUT with pivoting II. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:176-177 [Journal]
  11. T. C. Wood
    Algorithm 42: invert. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:176- [Journal]
  12. Josef G. Solomon
    Algorithms 41: Evaluation of determinant. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:176- [Journal]
  13. Maria E. Wojcicki
    Algorithm 44: Bessel Functions computed recursively. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:177-178 [Journal]
  14. Peter Zilahy Ingerman
    Algorithm 45: interest. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:178- [Journal]
  15. John R. Herndon
    Algorithm 46: exponential of a complex number. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:178- [Journal]
  16. John R. Herndon
    Algorithm 47: associated Legendre functions of the first kind for real or imaginary arguments. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:178-179 [Journal]
  17. John R. Herndon
    Algorithm 48: logarithm of a complex number. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:179- [Journal]
  18. John R. Herndon
    ACM Algorithm 49: Spherical Neumann Function. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:179- [Journal]
  19. John R. Herndon
    Algorithm 50: Inverse of a finite segment of the Hilbert matrix. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:179- [Journal]
  20. John R. Herndon
    Algorithm 53: Nth roots of a complex number. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:180- [Journal]
  21. John R. Herndon
    Algorithm 54: Gamma function for range 1 to 2. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:180- [Journal]
  22. John R. Herndon
    Algorithm 55: complete elliptic integral of the first kind. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:180- [Journal]
  23. John R. Herndon
    Algorithm 56: complete elliptic integral of the second kind. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:180-181 [Journal]
  24. John R. Herndon
    Algorithm 52: a set of test matrices. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:180- [Journal]
  25. John R. Herndon
    Algorithm 51: adjust inverse of a matrix when an element is perturbed. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:180- [Journal]
  26. John R. Herndon
    Certification of algorithm 3: solution of polynomial equation by Barstow-Hitchcock. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:181- [Journal]
  27. W. Börsch-Supan
    Remark: on frequently occurring errors in Algol-60 programs. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:181- [Journal]
  28. John R. Herndon
    Certification of algorithm 13: Legendre polynomial. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:181- [Journal]
  29. John R. Herndon
    Algorithm 57: BER or BEI function. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:181- [Journal]
  30. Henry C. Thacher Jr.
    Certification of algorithm 43: CROUT II. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:182- [Journal]
  31. William J. Alexander
    Certification of algorithm 20: real exponential integral. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:182- [Journal]
  32. H. McGregor Ross
    Further survey of punched card codes. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:182-183 [Journal]
  33. H. E. Kulsrud
    A practical technique for the determination of the optimum relaxation factor of the successive over-relaxation method. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:184-187 [Journal]
  34. Richard Bellman, Mario L. Juncosa, Robert Kalaba
    Some numerical experiments using Newton's method for nonlinear parabolic and elliptic boundary-value problems. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:187-191 [Journal]
  35. Morton Nadler
    Division and square root in the quarter-imaginary number system. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:192-193 [Journal]
  36. Sydney C. Rome
    Laviathan studies. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:194- [Journal]
  37. R. A. Brouse
    Advanced computers. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:194- [Journal]
  38. Seymour Ginsburg
    Theory of abstract machines. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:195- [Journal]
  39. Lauren B. Doyle
    Information retrieval. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:195- [Journal]
  40. Thomas N. Hibbard
    Theory of programmed processes. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:4, pp:195- [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