The SCEAS System
Navigation Menu

Journals in DBLP

Commun. ACM
1965, volume: 8, number: 11

  1. Nahal Ben Yoash
    Letters to the editor: a two-tape-unit sort. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:649- [Journal]
  2. Ray Boche
    Letters to the editor: some observations on the economics of interval arithmetic. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:649- [Journal]
  3. David Owens
    Letters to the editor: Avoiding bit manipulation in FORTRAN. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:649- [Journal]
  4. Isaac L. Auerbach
    Guest editorial: just as bridges made of wood. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:656- [Journal]
  5. Kenneth Cohen, Joseph Henry Wegstein
    AXLE2: an axiomatic language for string transformations. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:657-661 [Journal]
  6. Saul Rosen, Robert A. Spurgeon, Joel K. Donnelly
    PUFFT - The Purdue University fast FORTRAN translator. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:661-666 [Journal]
  7. William M. McKeeman
    Algorithm 268: ALGOL 60 reference language editor [R2]. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:667-668 [Journal]
  8. Jaroslav Pfann, Josef Straka
    Algorithm 269: determinant evaluation [F3]. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:668- [Journal]
  9. Albert Newhouse
    Algorithm 270: finding eigenvectors by Gaussian elimination [F2]. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:668-669 [Journal]
  10. Roger S. Scowen
    Algorithm 271: quickersort. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:669-670 [Journal]
  11. C. W. Medlock
    Remark on algorithm 250 [G6]: inverse permutation. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:670- [Journal]
  12. Peter Naur
    The performance of a system for automatic segmentation of programs within an ALGOL compiler (GIER ALGOL). [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:671-676 [Journal]
  13. Solomon L. Pollack
    Conversion of limited-entry decision tables to computer programs. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:677-682 [Journal]
  14. R. K. Mueller, L. Cooper
    A comparison of the primal-simplex and primal-dual algorithms for linear programming. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:682-686 [Journal]
  15. Keren McConlogue, Robert F. Simmons
    Analyzing English syntax with a pattern-learning parser. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:687-698 [Journal]
  16. Tomaso Pomentale
    An algorithm for minimizing backboard wiring functions. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:699-703 [Journal]
  17. Anthony F. Oettinger
    A forum on centralization and documentation. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:704-710 [Journal]
  18. M. L. Ernst, Vincent E. Giuliano, Paul E. Jones
    "Centralization of document searching facilities". [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:704-706 [Journal]
  19. Roman C. Pucinksi, Allen Kent, Mortimer Taube, Harold Wooster, Gerard Salton
    Invited comments on "Centralization of document searching facilities". [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:706-707 [Journal]
  20. M. L. Ernst, Vincent E. Giuliano, Paul E. Jones
    Response by Ernst, Giuliano and Jones. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1965, v:8, n:11, pp:710- [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