Journal of the ACM -- 1975

• Leslie G. Valiant. Regularity and related problems for deterministic pushdown automata. Journal of the ACM, 22(1):1-10, January 1975. References, etc. [BibTeX entry]

• Harry T. Hsu. An algorithm for finding a minimal equivalent graph of a digraph. Journal of the ACM, 22(1):11-16, January 1975. References, Citations, etc. [BibTeX entry]

• Clement T. Yu. A formal construction of term classes. Journal of the ACM, 22(1):17-37, January 1975. References, etc. [BibTeX entry]

• E. Horowitz and S. Sahni. On computing the exact determinant of matrices with polynomial entries. Journal of the ACM, 22(1):38-50, January 1975. References, etc. [BibTeX entry]

• C. A. Micchelli and W. L. Miranker. High order search methods for finding roots. Journal of the ACM, 22(1):51-60, January 1975. Citations, etc. [BibTeX entry]

• John R. Rice. A metalgorithm for adaptive quadrature. Journal of the ACM, 22(1):61-82, January 1975. References, Citations, etc. [BibTeX entry]

• Samuel H. Fuller and Forest Baskett. An analysis of drum storage units. Journal of the ACM, 22(1):83-105, January 1975. References, etc. [BibTeX entry]

• Walter H. Kohler and Kenneth Steiglitz. Exact, approximate, and guaranteed accuracy algorithms for the flow-shop problem n/2/f/\bar{F}. Journal of the ACM, 22(1):106-114, January 1975. References, etc. [BibTeX entry]

• Sartaj Sahni. Approximate algorithms for the 0/1 knapsack problem. Journal of the ACM, 22(1):115-124, January 1975. References, Citations, etc. [BibTeX entry]

• J. W. Wright. The change-making problem. Journal of the ACM, 22(1):125-128, January 1975. References, etc. [BibTeX entry]

• Robert S. Boyer and J Strother Moore. Proving theorems about LISP functions. Journal of the ACM, 22(1):129-144, January 1975. Additional information. [BibTeX entry]

• Lawrence Yelowitz. Derivation of a path-connectivity matrix for tagged flowcharts. Journal of the ACM, 22(1):145-154, January 1975. Additional information. [BibTeX entry]

• Richard E. Ladner. On the structure of polynomial time reducibility. Journal of the ACM, 22(1):155-171, January 1975. References, Citations, etc. [BibTeX entry]

• C. C. Gotlieb and G. H. MacEwen. Errata: ``Performance of movable-head disk storage devices''. Journal of the ACM, 22(1):172, January 1975. References. [BibTeX entry]

Volume 22, Number 2, April 1975

• Roy Lowrance and Robert A. Wagner. An extension of the string-to-string correction problem. Journal of the ACM, 22(2):177-183, April 1975. Citations. [BibTeX entry]

• Jacques Morgenstern. The linear complexity of computation. Journal of the ACM, 22(2):184-194, April 1975. [BibTeX entry]

• David E. Muller and Franco P. Preparata. Bounds to complexities of networks for sorting and for switching. Journal of the ACM, 22(2):195-201, April 1975. Citations. [BibTeX entry]

• Y. Perl, M. R. Garey, and S. Even. Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters. Journal of the ACM, 22(2):202-214, April 1975. Citations. [BibTeX entry]

• Robert Endre Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):215-225, April 1975. Citations. [BibTeX entry]

• Bernd Knauer. A simple planarity criterion. Journal of the ACM, 22(2):226-230, April 1975. [BibTeX entry]

• Jair M. Babad. A generalized multi-entrance time-sharing priority queue. Journal of the ACM, 22(2):231-247, April 1975. [BibTeX entry]

• Forest Baskett, K. Mani Chandy, Richard R. Muntz, and Fernando G. Palacios. Open, closed, and mixed networks of queues with different classes of customers. Journal of the ACM, 22(2):248-260, April 1975. Citations. [BibTeX entry]

• Erol Gelenbe. On approximate computer system models. Journal of the ACM, 22(2):261-269, April 1975. [BibTeX entry]

• Micha Hofri and Micha Yadin. A processor in series with demand-interrupting devices -- a stochastic model. Journal of the ACM, 22(2):270-290, April 1975. [BibTeX entry]

• David R. Musser. Multivariate polynomial factorization. Journal of the ACM, 22(2):291-308, April 1975. [BibTeX entry]

• Arnold L. Rosenberg. Corrigendum: ``Allocating storage for extendible arrays''. Journal of the ACM, 22(2):308, April 1975. References. [BibTeX entry]

Volume 22, Number 3, July 1975

• Roger C. Schank, Neil M. Goldman, Charles J. Rieger III, and Christopher K. Rieseck. Inference and paraphrase by computer. Journal of the ACM, 22(3):309-328, July 1975. [BibTeX entry]

• Gregory J. Chaitin. A theory of program size formally identical to information theory. Journal of the ACM, 22(3):329-340, July 1975. Citations. [BibTeX entry]

• Nancy Lynch. On reducibility to complex or sparse sets. Journal of the ACM, 22(3):341-345, July 1975. Citations. [BibTeX entry]

• Glenn Manacher. A new linear-time ``on-line'' algorithm for finding the smallest initial palindrome of a string. Journal of the ACM, 22(3):346-351, July 1975. [BibTeX entry]

• S. E. Goodman, S. T. Hedetniemi, and P. J. Slater. Advances on the Hamiltonian completion problem. Journal of the ACM, 22(3):352-360, July 1975. [BibTeX entry]

• John L. Pfaltz. Representing graphs by Knuth trees. Journal of the ACM, 22(3):361-366, July 1975. [BibTeX entry]

• Peter Elias and Richard A. Flower. The complexity of some simple retrieval problems. Journal of the ACM, 22(3):367-379, July 1975. Citations. [BibTeX entry]

• Robert E. Dressler and S. Thomas Parker. Primes with a prime subscript. Journal of the ACM, 22(3):380-381, July 1975. [BibTeX entry]

• J. L. Bruno and T. Lassagne. The generation of optimal code for stack machines. Journal of the ACM, 22(3):382-396, July 1975. [BibTeX entry]

• Walter C. Oney. Queueing analysis of the scan policy for moving-head disks. Journal of the ACM, 22(3):397-412, July 1975. Citations. [BibTeX entry]

• G. Terry Ross, D. Klingman, and A. Napier. A computational study of the effects of problem dimensions on solution times for transportation problems. Journal of the ACM, 22(3):413-424, July 1975. [BibTeX entry]

• Antonin Svoboda. The concept of term exclusivenss and its effect on the theory of Boolean functions. Journal of the ACM, 22(3):425-440, July 1975. [BibTeX entry]

• Ravi Sethi. Errata: ``Testing for the Church-Rosser property''. Journal of the ACM, 22(3):424, July 1975. References. [BibTeX entry]

Volume 22, Number 4, October 1975

• M. C. Easton and C. K. Wong. The effect of a capacity constraint on the minimal cost of a partition. Journal of the ACM, 22(4):441-449, October 1975. [BibTeX entry]

• Ellis Horowitz. A sorting algorithm for polynomial multiplication. Journal of the ACM, 22(4):450-462, October 1975. [BibTeX entry]

• Oscar H. Ibarra and Chul E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM, 22(4):463-468, October 1975. Citations. [BibTeX entry]

• H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. Journal of the ACM, 22(4):469-476, October 1975. Citations. [BibTeX entry]

• S. Winograd. On the parallel evaluation of certain arithmetic expressions. Journal of the ACM, 22(4):477-492, October 1975. Citations. [BibTeX entry]

• Eberhard Bertsch. An observation on relative parsing time. Journal of the ACM, 22(4):493-498, October 1975. [BibTeX entry]

• I. H. Sudborough. A note on tape-bounded complexity classes and linear context-free grammars. Journal of the ACM, 22(4):499-500, October 1975. Citations. [BibTeX entry]

• Bal Kishan Dass. A sufficient bound for codes correcting bursts with weight constraint. Journal of the ACM, 22(4):501-503, October 1975. [BibTeX entry]

• J. R. Cash. A class of implicit Runge-Kutta methods for the numerical integration of stiff ordinary differential equations. Journal of the ACM, 22(4):504-511, October 1975. [BibTeX entry]

• Webb Miller. Computer search for numerical instability. Journal of the ACM, 22(4):512-521, October 1975. [BibTeX entry]

• K. L. Krause, V. Y. Shen, and H. D. Schwetman. Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM, 22(4):522-550, October 1975. [BibTeX entry]

• John P. Hayes. The fanout structure of switching functions. Journal of the ACM, 22(4):551-571, October 1975. [BibTeX entry]

• Robert Kowalski. A proof procedure using connection graphs. Journal of the ACM, 22(4):572-595, October 1975. Citations. [BibTeX entry]

• J. Robert Jump and P. S. Thiagarajan. On the interconnection of asynchronous control structures. Journal of the ACM, 22(4):596-612, October 1975. Citations. [BibTeX entry]

Shortcuts: