Journals in DBLP

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

1. Bernard A. Galler
   ACM president's letter: and in the corner .... [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:12, pp:643- [Journal]
   
2. Jack L. Rosenfeld
   A case study in programming for parallel-processors. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:12, pp:645-655 [Journal]
   
3. D. Sayre
   Is automatic ``folding'' of programs efficient enough to displace manual? [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:12, pp:656-660 [Journal]
   
4. Seymour V. Parter
   Numerical analysis in a Ph.D. computer science program. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:12, pp:661-663 [Journal]
   
5. Dennie Van Tassel
   Advanced cryptographic techniques for computer. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:12, pp:664-665 [Journal]
   
6. Vincent A. Busam, Donald E. Englund
   Optimization of expressions in Fortran. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:12, pp:666-674 [Journal]
   
7. H. Bach
   On the downhill method. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:12, pp:675-677 [Journal]
   
8. Daniel J. Lasser
   Productivity of multiprogrammed computers--progress in developing an analytic prediction method. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:12, pp:678-684 [Journal]
   
9. Robert G. Herriot
   Algorithm 364: coloring polygonal regions [Z]. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1969, v:12, n:12, pp:685-686 [Journal]
   
10. H. Bach
    Algorithm 365: complex root finding [C5]. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:12, pp:686-687 [Journal]
    
11. P. J. Claringbold
    Algorithm 366: regression using certain direct product matrices [G2]. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:12, pp:687-688 [Journal]
    
12. P. J. Claringbold
    Algorithm 367: analysis of variance for balanced experiments [G2]. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:12, pp:688-691 [Journal]
    
13. Ronald G. Parson
    Certification of algorithm 147 [S14]: PSIF. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:12, pp:691-692 [Journal]
    
14. K. S. Kölbig
    Remark on algorithm 300 [S22]: Coulomb wave functions. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:12, pp:692- [Journal]
    
15. Les G. Proll
    Remark on algorithm 341 [H]: solution of linear programs in 0-1 variables by implicit enumeration. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:12, pp:692- [Journal]
    
16. T. A. Bray
    Certification of algorithm 229 [B1]: elementary functions by continued fractions. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:12, pp:692- [Journal]
    
17. Richard J. Fateman
    Optimal code for serial and parallel computation. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:12, pp:694-695 [Journal]
    
18. Dominic S. Seraphin
    A fast random number generator for IBM 360. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:12, pp:695- [Journal]
    
19. C. Kerpelman
    Presentation of alphameric characters for information processing. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:12, pp:696-698 [Journal]