Journal of the ACM -- 1968

Volume 15, Number 1, January 1968

• Maurice V. Wilkes. Computers then and now. Journal of the ACM, 15(1):1-7, January 1968. [BibTeX entry]

• G. Salton and M. E. Lesk. Computer evaluation of indexing and text processing. Journal of the ACM, 15(1):8-36, January 1968. Citations. [BibTeX entry]

• Niklaus Wirth. PL360, a programming language for the 360 computers. Journal of the ACM, 15(1):37-74, January 1968. Citations. [BibTeX entry]

• Robert E. Echols and Leon Cooper. Solution of integer linear programming problems by direct search. Journal of the ACM, 15(1):75-84, January 1968. References. [BibTeX entry]

• James R. Slagle and Philip Bursky. Experiments with a multipurpose, theorem-proving heuristic program. Journal of the ACM, 15(1):85-99, January 1968. References and Citations. [BibTeX entry]

• Otto Neall Strand and Ed. R. Westwater. Statistical estimation of the numerical solution of a Fredholm integral equation of the first kind. Journal of the ACM, 15(1):100-114, January 1968. References and Citations. [BibTeX entry]

• H. Dubner and J. Abate. Numerical inversion of Laplace transforms by relating them to the finite Fourier cosine transform. Journal of the ACM, 15(1):115-123, January 1968. References and Citations. [BibTeX entry]

• Donald M. Kaplan. Some completeness results in the mathematical theory of computation. Journal of the ACM, 15(1):124-134, January 1968. [BibTeX entry]

• Zamir Bavel. Structure and transition-preserving functions of finite automata. Journal of the ACM, 15(1):135-158, January 1968. References and Citations. [BibTeX entry]

• Abraham Waksman. A permutation network. Journal of the ACM, 15(1):159-163, January 1968. Citations. [BibTeX entry]

Volume 15, Number 2, April 1968

• J. Sklansky, M. Finkelstein, and E. C. Russell. A formalism for program translation. Journal of the ACM, 15(2):165-175, April 1968. Citations. [BibTeX entry]

• P. A. Gilmore. Structuring of parallel algorithms. Journal of the ACM, 15(2):176-192, April 1968. [BibTeX entry]

• B. Kubert, J. Szabo, and S. Giulieri. The perspective representation of functions of two variables. Journal of the ACM, 15(2):193-204, April 1968. References. [BibTeX entry]

• Stephen P. Morse. A mathematical model for the analysis of contour-line data. Journal of the ACM, 15(2):205-220, April 1968. Citations. [BibTeX entry]

• A. Orden and V. Nalbandian. A bidirectional simplex algorithm. Journal of the ACM, 15(2):221-235, April 1968. [BibTeX entry]

• Donald W. Loveland. Mechanical theorem-proving by model elimination. Journal of the ACM, 15(2):236-251, April 1968. References and Citations. [BibTeX entry]

• Marshall C. Pease. An adaptation of the fast Fourier transform for parallel processing. Journal of the ACM, 15(2):252-264, April 1968. Citations. [BibTeX entry]

• Frank J. Zeleznik. Quasi-Newton methods for nonlinear equations. Journal of the ACM, 15(2):265-271, April 1968. References. [BibTeX entry]

• Gerald L. Morris and Patrick L. Odell. Common solutions for n matrix equations with applications. Journal of the ACM, 15(2):272-274, April 1968. [BibTeX entry]

• Oliver Aberth. Analysis in the computable number field. Journal of the ACM, 15(2):275-299, April 1968. Citations. [BibTeX entry]

• Marcel Paul Schützenberger. A remark on acceptable sets of numbers. Journal of the ACM, 15(2):300-303, April 1968. References and Citations. [BibTeX entry]

• Raymond T. Yeh. Generalized pair algebra with applications to automata theory. Journal of the ACM, 15(2):304-316, April 1968. References and Citations. [BibTeX entry]

• J. E. Hopcroft and J. D. Ullman. Decidable and undecidable questions about automata. Journal of the ACM, 15(2):317-324, April 1968. References and Citations. [BibTeX entry]

• J. Hartmanis. Computational complexity of one-tape Turing machine computations. Journal of the ACM, 15(2):325-339, April 1968. References and Citations. [BibTeX entry]

• Abraham Waksman. Corrigendum: ``A permutation network''. Journal of the ACM, 15(2):340, April 1968. References and Citations. [BibTeX entry]

Volume 15, Number 3, July 1968

• E. G. Coffman, Jr.. Analysis of two time-sharing algorithms designed for limited swapping. Journal of the ACM, 15(3):341-353, July 1968. References and Citations. [BibTeX entry]

• Paul G. Comba. A procedure for detecting intersections of three-dimensional objects. Journal of the ACM, 15(3):354-366, July 1968. References. [BibTeX entry]

• Peter B. Andrews. Resolution with merging. Journal of the ACM, 15(3):367-381, July 1968. References and Citations. [BibTeX entry]

• J. Hartmanis and H. Shank. On the recognition of primes by automata. Journal of the ACM, 15(3):382-389, July 1968. References. [BibTeX entry]

• J. J. Kohfeld and G. T. Thompson. A modification of Nordsieck's method using an ``off-step'' point. Journal of the ACM, 15(3):390-401, July 1968. References and Citations. [BibTeX entry]

• Gerhard Zielke. Inversion of modified symmetric matrices. Journal of the ACM, 15(3):402-408, July 1968. [BibTeX entry]

• T. V. Griffiths. The unsolvability of the equivalence problem for Lambda-free nondeterministic generalized machines. Journal of the ACM, 15(3):409-413, July 1968. Citations. [BibTeX entry]

• John E. Hopcroft and Jeffrey D. Ullman. Relations between time and tape complexities. Journal of the ACM, 15(3):414-427, July 1968. References and Citations. [BibTeX entry]

• Seymour Ginsburg and Michael A. Harrison. One-way nondeterministic real-time list-storage languages. Journal of the ACM, 15(3):428-446, July 1968. References and Citations. [BibTeX entry]

• B. A. Chartres and J. J. Florentin. A universal syntax-directed top-down analyzer. Journal of the ACM, 15(3):447-464, July 1968. [BibTeX entry]

• P. M. Lewis II and R. E. Stearns. Syntax-directed transduction. Journal of the ACM, 15(3):465-488, July 1968. References and Citations. [BibTeX entry]

• Niklaus Wirth. Corrigendum: ``PL360, a programming language for the 360 computers''. Journal of the ACM, 15(3):489, July 1968. References. [BibTeX entry]

Volume 15, Number 4, October 1968

• C. C. Gotlieb and S. Kumar. Semantic clustering of index terms. Journal of the ACM, 15(4):493-513, October 1968. References and Citations. [BibTeX entry]

• Donald R. Morrison. PATRICIA -- practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM, 15(4):514-534, October 1968. Citations. [BibTeX entry]

• Thomas C. Lowe. The influence of data base characteristics and usage on direct access file organization. Journal of the ACM, 15(4):535-548, October 1968. [BibTeX entry]

• Edward G. Coffman and Leonard Kleinrock. Feedback queueing models for time-shared systems. Journal of the ACM, 15(4):549-576, October 1968. References and Citations. [BibTeX entry]

• Joseph Abate, Harvey Dubner, and Sheldon B. Weinberg. Queueing analysis of the IBM 2314 disk storage facility. Journal of the ACM, 15(4):577-589, October 1968. References and Citations. [BibTeX entry]

• Raymond Reiter. Scheduling parallel computations. Journal of the ACM, 15(4):590-599, October 1968. References and Citations. [BibTeX entry]

• U. Montanari. A method for obtaining skeletons using a quasi-Euclidean distance. Journal of the ACM, 15(4):600-624, October 1968. References and Citations. [BibTeX entry]

• J. R. Quinlan and E. B. Hunt. A formal deductive problem-solving system. Journal of the ACM, 15(4):625-646, October 1968. References and Citations. [BibTeX entry]

• Alfred V. Aho. Indexed grammars -- an extension of context-free grammars. Journal of the ACM, 15(4):647-671, October 1968. References and Citations. [BibTeX entry]

• Arnold L. Rosenberg. On the independence of real-time definability and certain structural properties of context-free languages. Journal of the ACM, 15(4):672-679, October 1968. References and Citations. [BibTeX entry]

• Dennis F. Cudia and Wilson E. Singletary. Degrees of unsolvability in formal grammars. Journal of the ACM, 15(4):680-692, October 1968. References and Citations. [BibTeX entry]

• Amar Mukhopadhyay. Representation of events in the von Neumann cellular model. Journal of the ACM, 15(4):693-705, October 1968. [BibTeX entry]

• Abbas I. Abdel Karim. A theorem for the stability of general predictor-corrector methods for the solution of systems of differential equations. Journal of the ACM, 15(4):706-711, October 1968. References. [BibTeX entry]

• James Dyer. Generalized multistep methods in satellite orbit computation. Journal of the ACM, 15(4):712-719, October 1968. References. [BibTeX entry]

• Peter B. Andrews. A correction concerning resolution. Journal of the ACM, 15(4):720, October 1968. References. [BibTeX entry]

Shortcuts: