Journal of the ACM -- 1961

Volume 8, Number 1, January 1961

• Herbert B. Keller. Finite automata, pattern recognition and perceptrons. Journal of the ACM, 8(1):1-20, January 1961. [BibTeX entry]

• Walter Gautschi. Recursive computation of certain integrals. Journal of the ACM, 8(1):21-40, January 1961. References. [BibTeX entry]

• Ivan Flores. Analysis of internal computer sorting. Journal of the ACM, 8(1):41-80, January 1961. Citations. [BibTeX entry]

• Seymour Ginsburg. Sets of tapes accepted by different types of automata. Journal of the ACM, 8(1):81-86, January 1961. References. [BibTeX entry]

• Aviezri S. Fraenkel. The use of index calculus and Mersenne primes for the design of a high-speed digital multiplier. Journal of the ACM, 8(1):87-96, January 1961. [BibTeX entry]

• A. L. Leiner and W. W. Youden. A system for generating ``pronounceable'' names using a computer. Journal of the ACM, 8(1):97-103, January 1961. [BibTeX entry]

• Harry H. Denman. Computer generation of optimized subroutines. Journal of the ACM, 8(1):104-116, January 1961. References and Citations. [BibTeX entry]

• H. Nagler. An answer to Mr. J. A. Lively's remarks on the paper ``Amphisbaenic sorting''. Journal of the ACM, 8(1):117, January 1961. References and Citations. [BibTeX entry]

• John G. Mackinney. More on ``Amphisbaenic sorting''. Journal of the ACM, 8(1):118, January 1961. References. [BibTeX entry]

Volume 8, Number 2, April 1961

• Donald E. Knuth. Minimizing drum latency time. Journal of the ACM, 8(2):119-150, April 1961. [BibTeX entry]

• D. H. Lehmer. A machine method for solving polynomial equations. Journal of the ACM, 8(2):151-162, April 1961. References and Citations. [BibTeX entry]

• Martin Greenberger. Notes on a new pseudo-random number generator. Journal of the ACM, 8(2):163-167, April 1961. References and Citations. [BibTeX entry]

• Lionello Lombardi. System handling of functional operators. Journal of the ACM, 8(2):168-185, April 1961. Citations. [BibTeX entry]

• Peter Calingaert. Two-dimensional parity checking. Journal of the ACM, 8(2):186-200, April 1961. References. [BibTeX entry]

• John E. Walsh. Computer-feasible method for handling incomplete data in regression analysis. Journal of the ACM, 8(2):201-211, April 1961. [BibTeX entry]

• Robert Hooke and T. A. Jeeves. ``Direct search'' solution of numerical and statistical problems. Journal of the ACM, 8(2):212-229, April 1961. Citations. [BibTeX entry]

• R. Totschek and R. C. Wood. An investigation of real-time solution of the transportation problem. Journal of the ACM, 8(2):230-239, April 1961. References and Citations. [BibTeX entry]

• L. L. Gutenmakher and G. E. Vleduts. The prospects for the utilization of informational-logical machines in chemistry (USSR). Journal of the ACM, 8(2):240-251, April 1961. [BibTeX entry]

• R. C. Brigham and P. D. Burgess. Generalized simulation of post office systems. Journal of the ACM, 8(2):252-259, April 1961. [BibTeX entry]

• Herbert M. Gurk and Jack Minker. The design and simulation of an information processing system. Journal of the ACM, 8(2):260-270, April 1961. [BibTeX entry]

• H. Edmund Stiles. The association factor in information retrieval. Journal of the ACM, 8(2):271-279, April 1961. Citations. [BibTeX entry]

Volume 8, Number 3, July 1961

• J. H. Wilkinson. Error analysis of direct methods of matrix inversion. Journal of the ACM, 8(3):281-330, July 1961. References and Citations. [BibTeX entry]

• Dnnald E. Johansen. A modified Givens method for the eigenvalue evaluation of large matrices. Journal of the ACM, 8(3):331-335, July 1961. References. [BibTeX entry]

• Tse-Sun Chow and Harold Willis Milnes. Numerical solution of the Neumann and mixed boundary value problems by boundary contraction. Journal of the ACM, 8(3):336-358, July 1961. References. [BibTeX entry]

• Seymour V. Parter. Some computational results on ``two-line'' iterative methods for the biharmonic difference equation. Journal of the ACM, 8(3):359-365, July 1961. [BibTeX entry]

• R. W. Klopfenstein. Zeros of nonlinear functions. Journal of the ACM, 8(3):366-373, July 1961. [BibTeX entry]

• Edwin S. Campbell, R. Buehler, J. O. Hirschfelder, and D. Hughes. Numerical construction of Taylor series approximations for a set of simultaneous first order differential equations. Journal of the ACM, 8(3):374-383, July 1961. [BibTeX entry]

• C. Y. Lee. Categorizing automata by W-machine programs. Journal of the ACM, 8(3):384-399, July 1961. References and Citations. [BibTeX entry]

• Seymour Ginsburg. Compatibility of states in input-independent machines. Journal of the ACM, 8(3):400-403, July 1961. References and Citations. [BibTeX entry]

• M. E. Maron. Automatic indexing: An experimental inquiry. Journal of the ACM, 8(3):404-417, July 1961. Citations. [BibTeX entry]

• E. J. Gauss. Locating the largest word in a file using a modified memory. Journal of the ACM, 8(3):418-425, July 1961. [BibTeX entry]

• J. Heller. Sequencing aspects of multiprogramming. Journal of the ACM, 8(3):426-439, July 1961. References and Citations. [BibTeX entry]

• Joseph F. A. Ormsby. Design of numerical filters with applications to missile data processing. Journal of the ACM, 8(3):440-466, July 1961. Citations. [BibTeX entry]

Volume 8, Number 4, October 1961

• Michael Arbib. Turing machines, finite automata and neural nets. Journal of the ACM, 8(4):467-475, October 1961. References. [BibTeX entry]

• Shigeru Watanabe. 5-symbol 8-state and 5-symbol 6-state universal Turing machines. Journal of the ACM, 8(4):476-483, October 1961. Citations. [BibTeX entry]

• H. Allen Curtis. A generalized tree circuit. Journal of the ACM, 8(4):484-496, October 1961. References and Citations. [BibTeX entry]

• J. T. Chu. Some methods for simplifying switching circuits using ``don't care'' conditions. Journal of the ACM, 8(4):497-512, October 1961. [BibTeX entry]

• Eugene S. Schwartz. An automatic sequencing procedure with application to parallel programming. Journal of the ACM, 8(4):513-537, October 1961. References and Citations. [BibTeX entry]

• Charles P. Bourne and Donald F. Ford. A study of methods for systematically abbreviating English words and names. Journal of the ACM, 8(4):538-552, October 1961. References. [BibTeX entry]

• Lauren B. Doyle. Semantic road maps for literature searchers. Journal of the ACM, 8(4):553-578, October 1961. Citations. [BibTeX entry]

• Robert W. Floyd. A descriptive language for symbol manipulation. Journal of the ACM, 8(4):579-584, October 1961. [BibTeX entry]

• Gene Ott and Neil H. Feinstein. Design of sequential machines from their regular expressions. Journal of the ACM, 8(4):585-600, October 1961. Citations. [BibTeX entry]

• Thomas N. Hibbard. Least upper bounds on minimal terminal state experiments for two classes of sequential machines. Journal of the ACM, 8(4):601-612, October 1961. References. [BibTeX entry]

• Kurt Spielberg. Representation of power series in terms of polynomials, rational approximations and continued fractions. Journal of the ACM, 8(4):613-627, October 1961. References and Citations. [BibTeX entry]

• E. E. Osborne. On least squares solutions of linear equations. Journal of the ACM, 8(4):628-636, October 1961. References. [BibTeX entry]

• Charlotte Froese. An evaluation of Runge-Kutta type methods for higher order differential equations. Journal of the ACM, 8(4):637-644, October 1961. References. [BibTeX entry]

• E. K. Blum and P. C. Curtis, Jr.. Asymptotic behavior of the best polynomial approximation. Journal of the ACM, 8(4):645-647, October 1961. [BibTeX entry]

• R. J. Gardner and T. H. Gossling. Letter to the editor: Optimized subroutines. Journal of the ACM, 8(4):648-649, October 1961. References. [BibTeX entry]

• Martin A. Goetz. Letter to the editor: Internal sorting and external merging. Journal of the ACM, 8(4):649-650, October 1961. References. [BibTeX entry]

Shortcuts: