Journals in DBLP

Commun. ACM
1967, volume: 10, number: 7

1. Robert W. Bemer
   Letter to the editor: on format effectors. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1967, v:10, n:7, pp:396- [Journal]
   
2. K. Wright
   Letters to the editor: on Bellman's method for unstable linear systems. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1967, v:10, n:7, pp:396- [Journal]
   
3. W. I. Givens
   Letter to the editor: a ``subprofessional'' comments. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1967, v:10, n:7, pp:396- [Journal]
   
4. Norman R. Nielsen
   The simulation of time sharing systems. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1967, v:10, n:7, pp:397-412 [Journal]
   
5. Laszlo Betyar
   A user-oriented time-shared online system. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1967, v:10, n:7, pp:413-419 [Journal]
   
6. Stuart E. Madnick
   String processing techniques. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1967, v:10, n:7, pp:420-424 [Journal]
   
7. Larry Irwin
   Implementing phrase-structure productions in PL/I. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1967, v:10, n:7, pp:424- [Journal]
   
8. Russell W. Stineman
   Plotting a function of three independent variables. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1967, v:10, n:7, pp:425-428 [Journal]
   
9. J. K. S. McKay
   On the representation of symmetric polynomials. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1967, v:10, n:7, pp:428-429 [Journal]
   
10. David G. Moursund
    Optimal starting values for Newton-Raphson calculation of x^{1 2}. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:430-432 [Journal]
    
11. William M. Waite
    A language independent macro processor. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:433-440 [Journal]
    
12. Michael D. Callahan, Anson E. Chapman
    Description of basic algorithm DETAB/65 preprocessor. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:441-446 [Journal]
    
13. Ira Pohl
    A method for finding Hamilton paths and Knight's tours. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:446-449 [Journal]
    
14. Paul Bratley, J. K. S. McKay
    Algorithm 305: symmetric polynomial. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:450- [Journal]
    
15. Paul Bratley
    Algorithm 306: permutations with repetitions. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:450-451 [Journal]
    
16. J. K. S. McKay
    Algorithms 307: Symmetric group characters. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:451-452 [Journal]
    
17. R. J. Ord-Smith
    Remarks on algorithm 87, 102, 130, 202: generation of permutations in lexicographical order. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:452-453 [Journal]
    
18. R. J. Ord-Smith
    Algorithm 308 Generation of the permutations in psedo-lexicographic order. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:452- [Journal]
    
19. Michael L. V. Pitteway
    Remark on algorithm 301: Airy function. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:453- [Journal]
    
20. Lee S. Sims
    Certification of algorithm 258: transport and algorithm 293: transportation problem. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:453- [Journal]
    
21. H. Späth
    Certification of algorithm 285: the mutual primal-dual method. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:453- [Journal]
    
22. James P. Titus
    Changes in government procurement policies. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:7, pp:454-455 [Journal]