Journals in DBLP

Commun. ACM
1969, volume: 12, number: 5

1. Derick Wood
   A few more trouble spots in ALGOL 60. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:5, pp:247-248 [Journal]
   
2. John R. B. Whittlesey
   Letters to the editor: on the multidimensional uniformity of pseudorandom generators. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:5, pp:247- [Journal]
   
3. Michael M. Gold
   Time-sharing and batch-processing: an experimental comparison of their values in a problem-solving situation. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:5, pp:249-259 [Journal]
   
4. Keith A. Bartlett, Roger A. Scantlebury, Peter T. Wilkinson
   A note on reliable full-duplex transmission over half-duplex links. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:5, pp:260-261 [Journal]
   
5. Stanley Lass
   Automated printed circuit routing with a stepping aperture. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:5, pp:262-265 [Journal]
   
6. Richard H. Bartels, Gene H. Golub
   The simplex method of linear programming using LU decomposition. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:5, pp:266-268 [Journal]
   
7. Philip Rabinowitz
   Rough and ready error estimates in Gaussian integration of analytic functions. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:5, pp:268-270 [Journal]
   
8. Herbert E. Salzer
   Chebyshev interpolation and quadrature formulas of very high degree. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:5, pp:271- [Journal]
   
9. Jan B. Hext, J. W. Winings
   An automatic grading scheme for simple programming exercises. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:5, pp:272-275 [Journal]
   
10. Richard H. Bartels, Gene H. Golub
    Algorithm 350: simplex method procedure employing Lu decomposition [H]. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:5, pp:275-278 [Journal]
    
11. K. S. Kölbig
    Certification of algorithm 292 [S22]: regular coulomb wave functions and of remark on algorithm 292 [S22]: regular coulomb wave functions. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:5, pp:278-279 [Journal]
    
12. K. S. Kölbig
    Certification of algorithm 300 [S22]: coulomb wave functions. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:5, pp:279-280 [Journal]
    
13. I. D. Hill
    Remark on algorithm 331: Gaussian quadrature formulas [D1]. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:5, pp:280-281 [Journal]
    
14. Walter Gautschi
    Remark on algorithm 292 [S22]: regular coulomb wave functions. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:5, pp:280- [Journal]
    
15. Albert Noltemeier
    Remark on algorithm 340 [C2]: roots of polynomials by a root-squaring and resultant routine. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:5, pp:281- [Journal]
    
16. Robert E. Knop
    Remark on algorithm 334 [G5]: normal random deviates. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:5, pp:281- [Journal]
    
17. Laszlo A. Belady, C. J. Kuehner
    Dynamic space-sharing in computer systems. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:5, pp:282-288 [Journal]