Journal of the ACM -- 1965

Volume 12, Number 1, January 1965

• M. W. Curtis. A Turing machine simulator. Journal of the ACM, 12(1):1-13, January 1965. References and Citations. [BibTeX entry]

• Robert M. McClure. A programming language for simulating digital systems. Journal of the ACM, 12(1):14-22, January 1965. [BibTeX entry]

• J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, January 1965. References and Citations. [BibTeX entry]

• Sheila A. Greibach. A new normal-form theorem for context-free phrase structure grammars. Journal of the ACM, 12(1):42-52, January 1965. References and Citations. [BibTeX entry]

• Eric Wolman. A fixed optimum cell-size for records of various lengths. Journal of the ACM, 12(1):53-70, January 1965. [BibTeX entry]

• H. Glass and L. Cooper. Sequential search: A method for solving constrained optimization problems. Journal of the ACM, 12(1):71-82, January 1965. References and Citations. [BibTeX entry]

• M. Donald MacLaren and George Marsaglia. Uniform random number generators. Journal of the ACM, 12(1):83-89, January 1965. References and Citations. [BibTeX entry]

• Aaron Booker. Numerical evaluation of symmetric polynomials. Journal of the ACM, 12(1):90-94, January 1965. [BibTeX entry]

• R. W. Hockney. A fast direct solution of Poisson's equation using Fourier analysis. Journal of the ACM, 12(1):95-113, January 1965. Citations. [BibTeX entry]

• J. H. Bramble and B. E. Hubbard. Approximation of solutions of mixed boundary value problems for Poisson's equation by finite differences. Journal of the ACM, 12(1):114-123, January 1965. [BibTeX entry]

• J. C. Butcher. A modified multistep method for the numerical integration of ordinary differential equations. Journal of the ACM, 12(1):124-135, January 1965. References and Citations. [BibTeX entry]

• Edward B. Anders. An error bound for a numerical filtering technique. Journal of the ACM, 12(1):137-140, January 1965. References and Citations. [BibTeX entry]

• Arthur Gill. Analysis and synthesis of stable linear sequential circuits. Journal of the ACM, 12(1):141-149, January 1965. References and Citations. [BibTeX entry]

Volume 12, Number 2, April 1965

• Paul W. Broome. Discrete orthonormal sequences. Journal of the ACM, 12(2):151-168, April 1965. Citations. [BibTeX entry]

• David G. Moursund. Examination of multiple roots and root clusters of a polynomial using the Bernoulli procedure. Journal of the ACM, 12(2):169-174, April 1965. [BibTeX entry]

• R. D. Glauz. On the numerical solution of ordinary and partial differential equations using integral relations. Journal of the ACM, 12(2):175-180, April 1965. [BibTeX entry]

• Charles B. Dunham. Convergence problems in Maehly's second method. Journal of the ACM, 12(2):181-186, April 1965. References and Citations. [BibTeX entry]

• G. P. Weeg. The automorphism group of the direct product of strongly related automata. Journal of the ACM, 12(2):187-195, April 1965. References and Citations. [BibTeX entry]

• Shen Lin and Tibor Rado. Computer studies of Turing machine problems. Journal of the ACM, 12(2):196-212, April 1965. Citations. [BibTeX entry]

• J. T. Chu. Optimal decision functions for computer character recognition. Journal of the ACM, 12(2):213-226, April 1965. Citations. [BibTeX entry]

• R. L. Crane and R. W. Klopfenstein. A predictor-corrector algorithm with an increased range of absolute stability. Journal of the ACM, 12(2):227-241, April 1965. References and Citations. [BibTeX entry]

• Herbert Kanner. Number base conversion in a significant digit arithmetic. Journal of the ACM, 12(2):242-246, April 1965. [BibTeX entry]

• Walter Penney. A ``binary'' system for complex numbers. Journal of the ACM, 12(2):247-248, April 1965. Citations. [BibTeX entry]

• Jerry Sanders. Document association and classification based on L-languages. Journal of the ACM, 12(2):249-253, April 1965. [BibTeX entry]

• Stephen Glicksman. Concerning the merging of equal length tape files. Journal of the ACM, 12(2):254-258, April 1965. References. [BibTeX entry]

• W. J. Dixon and R. A. Kronmal. The choice of origin and scale for graphs. Journal of the ACM, 12(2):259-261, April 1965. References. [BibTeX entry]

• C. L. Sheng. Threshold logic elements used as a probability transformer. Journal of the ACM, 12(2):262-276, April 1965. References and Citations. [BibTeX entry]

• S. Winograd. On the time required to perform addition. Journal of the ACM, 12(2):277-285, April 1965. Citations. [BibTeX entry]

• R. W. Stineman. Digital time-domain analysis of systems with widely separated poles. Journal of the ACM, 12(2):286-293, April 1965. [BibTeX entry]

Volume 12, Number 3, July 1965

• W. Fraser. A survey of methods of computing minimax and near-minimax polynomial approximations for functions of a single independent variable. Journal of the ACM, 12(3):295-314, July 1965. Citations. [BibTeX entry]

• A. P. Yershóv. One view of man-machine interaction. Journal of the ACM, 12(3):315-325, July 1965. [BibTeX entry]

• Richard W. Conn and Richard E. von Holdt. An online display for the study of approximating functions. Journal of the ACM, 12(3):326-349, July 1965. [BibTeX entry]

• M. V. Vernon. On a problem concerning a central storage device served by multiple terminals. Journal of the ACM, 12(3):350-355, July 1965. Citations. [BibTeX entry]

• William K. Winters. A modified method of latent class analysis for file organization in information retrieval. Journal of the ACM, 12(3):356-363, July 1965. References. [BibTeX entry]

• Franco Mileto and Gianfranco Putzolu. Statistical complexity of algorithms for Boolean function minimization. Journal of the ACM, 12(3):364-375, July 1965. Citations. [BibTeX entry]

• J. M. S. Sim\~oes Pereira. On the Boolean matrix equation M' = \vee_{i=1} M^i. Journal of the ACM, 12(3):376-382, July 1965. References and Citations. [BibTeX entry]

• David Moursund. Chebyshev solution of n+1 linear equations in n unknowns. Journal of the ACM, 12(3):383-387, July 1965. [BibTeX entry]

• Patrick C. Fischer. Generation of primes by a one-dimensional real-time iterative array. Journal of the ACM, 12(3):388-394, July 1965. Citations. [BibTeX entry]

• D. J. Newman. Location of the maximum on unimodal surfaces. Journal of the ACM, 12(3):395-398, July 1965. Citations. [BibTeX entry]

• A. Paz and B. Peleg. Ultimate-definite and symmetric-definite events and automata. Journal of the ACM, 12(3):399-410, July 1965. References and Citations. [BibTeX entry]

• Michael Yoeli. Generalized cascade decompositions of automata. Journal of the ACM, 12(3):411-422, July 1965. References and Citations. [BibTeX entry]

• Seymour Ginsburg and Edwin H. Spanier. Mappings of languages by two-tape devices. Journal of the ACM, 12(3):423-434, July 1965. References. [BibTeX entry]

• C. L. Sheng. Correction. Journal of the ACM, 12(3):435, July 1965. References. [BibTeX entry]

Volume 12, Number 4, October 1965

• Leroy F. Meyers. Morphological classification in the national bureau of standards mechanical translation system. Journal of the ACM, 12(4):437-472, October 1965. [BibTeX entry]

• Lauren B. Doyle. Is automatic classification a reasonable application of statistical analysis of text? Journal of the ACM, 12(4):473-489, October 1965. References and Citations. [BibTeX entry]

• John O'Connor. Automatic subject recognition in scientific papers: An empirical study. Journal of the ACM, 12(4):490-515, October 1965. References. [BibTeX entry]

• Solomon W. Golomb and Leonard D. Baumert. Backtrack programming. Journal of the ACM, 12(4):516-524, October 1965. Citations. [BibTeX entry]

• A. V. Srinivasan. An investigation of some computational aspects of integer programming. Journal of the ACM, 12(4):525-535, October 1965. References. [BibTeX entry]

• Lawrence Wos, George A. Robinson, and Daniel F. Carson. Efficiency and completeness of the set of support strategy in theorem proving. Journal of the ACM, 12(4):536-541, October 1965. References and Citations. [BibTeX entry]

• T. R. N. Rao and N. Zierler. On mappings for modular arithmetic, I. Journal of the ACM, 12(4):542-544, October 1965. Citations. [BibTeX entry]

• S. Berkovits, M. Schlessinger, and N. Zierler. On mappings for modular arithmetic, II. Journal of the ACM, 12(4):545-546, October 1965. References. [BibTeX entry]

• Donald G. Anderson. Iterative procedures for nonlinear integral equations. Journal of the ACM, 12(4):547-560, October 1965. References. [BibTeX entry]

• Bruce Barnes. Groups of automorphisms and sets of equivalence classes of input for automata. Journal of the ACM, 12(4):561-565, October 1965. References and Citations. [BibTeX entry]

• A. C. Fleck. On the automorphism group of an automaton. Journal of the ACM, 12(4):566-569, October 1965. References and Citations. [BibTeX entry]

• Patrick C. Fischer. On formalisms for Turing machines. Journal of the ACM, 12(4):570-580, October 1965. Citations. [BibTeX entry]

• Wei Chang and Donald J. Wong. Analysis of real time multiprogramming. Journal of the ACM, 12(4):581-588, October 1965. Citations. [BibTeX entry]

• Jack B. Dennis. Segmentation and the design of multiprogrammed computer systems. Journal of the ACM, 12(4):589-602, October 1965. Citations. [BibTeX entry]

• G. B. Dantzig, R. P. Harvey, and R. D. McKnight. Updating the product form of the inverse for the revised simplex method. Journal of the ACM, 12(4):603, October 1965. [BibTeX entry]

Shortcuts: