Journal of the ACM -- 1970

Volume 17, Number 1, January 1970

• G. Salton. On the role of the ACM journal. Journal of the ACM, 17(1):1-2, January 1970. [BibTeX entry]

• Seymour Ginsburg and John Hopcroft. Two-way balloon automata and AFL. Journal of the ACM, 17(1):3-13, January 1970. References, etc. [BibTeX entry]

• Alain Colmerauer. Total precedence relations. Journal of the ACM, 17(1):14-30, January 1970. References, Citations, etc. [BibTeX entry]

• Dennis F. Cudia. General problems of formal grammars. Journal of the ACM, 17(1):31-43, January 1970. References, etc. [BibTeX entry]

• Arnold L. Rosenberg. A note on ambiguity of context-free languages and presentations of semilinear sets. Journal of the ACM, 17(1):44-50, January 1970. References, etc. [BibTeX entry]

• D. G. Corneil and C. C. Gotlieb. An efficient algorithm for graph isomorphism. Journal of the ACM, 17(1):51-64, January 1970. Citations, etc. [BibTeX entry]

• Herbert M. Gurk and Jack Minker. Storage requirements for information handling centers. Journal of the ACM, 17(1):65-77, January 1970. References, etc. [BibTeX entry]

• Donald R. Chand and Sham S. Kapur. An algorithm for convex polytopes. Journal of the ACM, 17(1):78-86, January 1970. Citations, etc. [BibTeX entry]

• F. G. Gustavson, W. Liniger, and R. Willoughby. Symbolic generation of an optimal Crout algorithm for sparse systems of linear equations. Journal of the ACM, 17(1):87-109, January 1970. Additional information. [BibTeX entry]

• C. D. Meyer and R. J. Painter. Note on a least squares inverse for a matrix. Journal of the ACM, 17(1):110-112, January 1970. Additional information. [BibTeX entry]

• S. K. Chang and A. Gill. Algorithmic solution of the change-making problem. Journal of the ACM, 17(1):113-122, January 1970. Citations, etc. [BibTeX entry]

• E. G. Coffman, Jr., R. R. Muntz, and H. Trotter. Waiting time distributions for processor-sharing systems. Journal of the ACM, 17(1):123-130, January 1970. References, Citations, etc. [BibTeX entry]

• Philip J. Rasch. A queueing theory study of round-robin scheduling of time-shared computer systems. Journal of the ACM, 17(1):131-145, January 1970. References, Citations, etc. [BibTeX entry]

• Azriel Rosenfeld. Connectivity in digital pictures. Journal of the ACM, 17(1):146-160, January 1970. References, Citations, etc. [BibTeX entry]

• J. Sklansky. Thresholded convolutions operations. Journal of the ACM, 17(1):161-165, January 1970. References, etc. [BibTeX entry]

• M. A. Breuer. Simplification of the covering problem with application to Boolean expressions. Journal of the ACM, 17(1):166-181, January 1970. References, etc. [BibTeX entry]

• Harold S. Stone. An algorithm for modular partitioning. Journal of the ACM, 17(1):182-195, January 1970. Additional information. [BibTeX entry]

Volume 17, Number 2, April 1970

• Marvin Minsky. Form and content in computer science. Journal of the ACM, 17(2):197-215, April 1970. Citations, etc. [BibTeX entry]

• Arthur J. Nevins. A programming language with automatic goal generation and selection. Journal of the ACM, 17(2):216-230, April 1970. Additional information. [BibTeX entry]

• Zamir Bavel and David E. Muller. Connectivity and reversibility in automata. Journal of the ACM, 17(2):231-240, April 1970. References, etc. [BibTeX entry]

• David G. Willis. Computational complexity and probability constructions. Journal of the ACM, 17(2):241-259, April 1970. References, Citations, etc. [BibTeX entry]

• H. C. Andrews and J. Kane. Kronecker matrices, computer implementation, and generalized spectra. Journal of the ACM, 17(2):260-268, April 1970. References, etc. [BibTeX entry]

• Seymour Haber. Sequences of numbers that are approximately completely equidistributed. Journal of the ACM, 17(2):269-272, April 1970. Additional information. [BibTeX entry]

• Peter Henrici. Methods of search for solving polynomial equations. Journal of the ACM, 17(2):273-283, April 1970. References, Citations, etc. [BibTeX entry]

• H. S. Rahme. Stability analysis of a new algorithm used for integrating a system of ordinary differential equations. Journal of the ACM, 17(2):284-293, April 1970. References, etc. [BibTeX entry]

• A. Zafarullah. Application of the method of lines to parabolic partial differential equations with error estimates. Journal of the ACM, 17(2):294-302, April 1970. References, etc. [BibTeX entry]

• Richard H. Roth. An approach to solving linear discrete optimization problems. Journal of the ACM, 17(2):303-313, April 1970. Citations, etc. [BibTeX entry]

• L. E. N. Delbrouck. A feedback queueing system with batch arrivals, bulk service, and queue-dependent service time. Journal of the ACM, 17(2):314-323, April 1970. References, Citations, etc. [BibTeX entry]

• R. R. Muntz and E. G. Coffman, Jr.. Preemptive scheduling of real-time tasks on multiprocessor systems. Journal of the ACM, 17(2):324-338, April 1970. References, Citations, etc. [BibTeX entry]

• Louis Hodes. The logical complexity of geometric properties in the plane. Journal of the ACM, 17(2):339-347, April 1970. Citations, etc. [BibTeX entry]

• G. Ugo Montanari. On limit properties in digitization schemes. Journal of the ACM, 17(2):348-360, April 1970. Citations, etc. [BibTeX entry]

• J. M. Boyle and A. A. Grau. An algorithmic semantics for ALGOL 60 identifier denotation. Journal of the ACM, 17(2):361-382, April 1970. Additional information. [BibTeX entry]

• B. L. Fox. Accelerating list processing in discrete programming. Journal of the ACM, 17(2):383-384, April 1970. Additional information. [BibTeX entry]

• B. F. Caviness. On canonical forms and simplification. Journal of the ACM, 17(2):385-396, April 1970. Citations, etc. [BibTeX entry]

Volume 17, Number 3, July 1970

• C. W. Cryer. On the approximate solution of free boundary problems using finite differences. Journal of the ACM, 17(3):397-411, July 1970. Additional information. [BibTeX entry]

• H. H. Kagiwada and R. Kalaba. An initial-value theory for Fredholm integral equations with semidegenerate kernels. Journal of the ACM, 17(3):412-419, July 1970. Additional information. [BibTeX entry]

• Takao Tsuda and Kozo Ichida. Nonlinear interpolation of multivariable functions by the Monte Carlo method. Journal of the ACM, 17(3):420-425, July 1970. References, etc. [BibTeX entry]

• C. V. Ramamoorthy and K. M. Chandy. Optimization of memory hierarchies in multiprogrammed systems. Journal of the ACM, 17(3):426-445, July 1970. References, Citations, etc. [BibTeX entry]

• Richard I. Shrager. Nonlinear regression with linear constraints: An extension of the magnified diagonal method. Journal of the ACM, 17(3):446-452, July 1970. Additional information. [BibTeX entry]

• Alan C. Shaw. Parsing of graph-representable pictures. Journal of the ACM, 17(3):453-481, July 1970. References, Citations, etc. [BibTeX entry]

• H. Lynn Beus. The use of information in sorting. Journal of the ACM, 17(3):482-495, July 1970. References, etc. [BibTeX entry]

• W. D. Frazer and A. C. McKellar. Samplesort: A sampling approach to minimal storage tree sorting. Journal of the ACM, 17(3):496-507, July 1970. References, Citations, etc. [BibTeX entry]

• L. E. Stanfel. Tree structures for optimal searching. Journal of the ACM, 17(3):508-517, July 1970. Citations, etc. [BibTeX entry]

• Frederic J. Mowle. Controllability of nonlinear sequential networks. Journal of the ACM, 17(3):518-524, July 1970. Citations, etc. [BibTeX entry]

• Robert Anderson and W. W. Bledsoe. A linear format for resolution with merging and a new technique for establishing completeness. Journal of the ACM, 17(3):525-534, July 1970. References, Citations, etc. [BibTeX entry]

• James R. Slagle. Interpolation theorems for resolution in lower predicate calculus. Journal of the ACM, 17(3):535-542, July 1970. References, Citations, etc. [BibTeX entry]

• J. L. Baer, D. P. Bovet, and G. Estrin. Legality and other properties of graph models of computations. Journal of the ACM, 17(3):543-554, July 1970. References, Citations, etc. [BibTeX entry]

• Zohar Manna and Amir Pnueli. Formalization of properties of functional programs. Journal of the ACM, 17(3):555-569, July 1970. References, etc. [BibTeX entry]

Volume 17, Number 4, October 1970

• J. Gary Augustson and Jack Minker. An analysis of some graph theoretical cluster techniques. Journal of the ACM, 17(4):571-588, October 1970. References, Citations, etc. [BibTeX entry]

• Hiroshi Akima. A new method of interpolation and smooth curve fitting based on local procedures. Journal of the ACM, 17(4):589-602, October 1970. Additional information. [BibTeX entry]

• Donald I. Good and Ralph L. London. Computer interval arithmetic: Definition and proof of correct implementation. Journal of the ACM, 17(4):603-612, October 1970. Additional information. [BibTeX entry]

• William B. Gruttke. Pseudo-Runge-Kutta methods of the fifth order. Journal of the ACM, 17(4):613-628, October 1970. References, etc. [BibTeX entry]

• Masahiro Hashimoto. A method for solving large matrix equations reduced from Fredholm integral equations of the second kind. Journal of the ACM, 17(4):629-636, October 1970. Additional information. [BibTeX entry]

• Toyohisa Kaneko and Bede Liu. Accumulation of round-off error in fast Fourier transforms. Journal of the ACM, 17(4):637-654, October 1970. Citations, etc. [BibTeX entry]

• L. F. Shampine. Efficiency of a procedure for near-minimax approximation. Journal of the ACM, 17(4):655-660, October 1970. References, etc. [BibTeX entry]

• Brian T. Smith. Error bounds for zeros of a polynomial based upon Gerschgorin's theorems. Journal of the ACM, 17(4):661-674, October 1970. Additional information. [BibTeX entry]

• P. Bonzon. Necessary and sufficient conditions for dynamic programming of combinatorial type. Journal of the ACM, 17(4):675-682, October 1970. Additional information. [BibTeX entry]

• Paul W. Purdom, Jr. and Stephen M. Stigler. Statistical properties of the buddy system. Journal of the ACM, 17(4):683-697, October 1970. Additional information. [BibTeX entry]

• C. L. Chang. The unit proof and the input proof in theorem proving. Journal of the ACM, 17(4):698-707, October 1970. References, Citations, etc. [BibTeX entry]

• David Pager. On the efficiency of algorithms. Journal of the ACM, 17(4):708-714, October 1970. References, Citations, etc. [BibTeX entry]

• Ravi Sethi and J. D. Ullman. The generation of optimal code for arithmetic expressions. Journal of the ACM, 17(4):715-728, October 1970. Citations, etc. [BibTeX entry]

• D. Tsichritzis. The equivalence problem of simple programs. Journal of the ACM, 17(4):729-738, October 1970. Additional information. [BibTeX entry]

• Jerzy W. Grzymala-Busse. Errata: ``On the periodic representations and the reducibility of periodic automata''. Journal of the ACM, 17(4):739, October 1970. References. [BibTeX entry]

Shortcuts: