Journal of the ACM -- 1974

Volume 21, Number 1, January 1974

• David G. Herr. On a statistical model of Strand and Westwater for the numerical solution of a Fredholm integral equation of the first kind. Journal of the ACM, 21(1):1-5, January 1974. References, etc. [BibTeX entry]

• Nai-kuan Tsao. Some a posteriori error bounds in floating-point computations. Journal of the ACM, 21(1):6-17, January 1974. References, etc. [BibTeX entry]

• L. W. Cotten and A. M. Abd-Alla. Processing times for segmented jobs with I/O compute overlap. Journal of the ACM, 21(1):18-30, January 1974. Additional information. [BibTeX entry]

• P. A. Franaszek and T. J. Wagner. Some distribution-free aspects of paging algorithm performance. Journal of the ACM, 21(1):31-39, January 1974. References, Citations, etc. [BibTeX entry]

• Giorgio Ingargiola and James F. Korsh. Finding optimal demand paging algorithms. Journal of the ACM, 21(1):40-53, January 1974. References, etc. [BibTeX entry]

• Debasis Mitra. Some aspects of hierarchical memory systems. Journal of the ACM, 21(1):54-65, January 1974. References, etc. [BibTeX entry]

• Kenneth C. Sevcik. Scheduling for minimum total loss using service time distributions. Journal of the ACM, 21(1):66-75, January 1974. Additional information. [BibTeX entry]

• Christopher Earnest. Some topics in code optimization. Journal of the ACM, 21(1):76-102, January 1974. References, Citations, etc. [BibTeX entry]

• Michael A. Crane and Donald L. Iglehart. Simulating stable stochastic systems, I: General multiserver queues. Journal of the ACM, 21(1):103-113, January 1974. Citations, etc. [BibTeX entry]

• Michael A. Crane and Donald L. Iglehart. Simulating stable stochastic systems, II: Markov chains. Journal of the ACM, 21(1):114-123, January 1974. References, etc. [BibTeX entry]

• S. Fleisig, D. Loveland, A. K. Smiley III, and D. L. Yarmush. An implementation of the model elimination proof procedure. Journal of the ACM, 21(1):124-139, January 1974. References, etc. [BibTeX entry]

• Walter H. Kohler and Kenneth Steiglitz. Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems. Journal of the ACM, 21(1):140-156, January 1974. References, Citations, etc. [BibTeX entry]

• P. S. Kritzinger and J. W. Graham. A theorem in the theory of compromise merge methods. Journal of the ACM, 21(1):157-160, January 1974. Additional information. [BibTeX entry]

• Mary Shaw and J. F. Traub. On the number of multiplications for the evaluation of a polynomial and some of its derivatives. Journal of the ACM, 21(1):161-167, January 1974. References, etc. [BibTeX entry]

• Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168-173, January 1974. Citations, etc. [BibTeX entry]

• D. Michie and E. E. Sibert. Some binary derivation systems. Journal of the ACM, 21(2):175-190, April 1974. References, etc. [BibTeX entry]

• Ross A. Overbeek. A new class of automated theorem-proving algorithms. Journal of the ACM, 21(2):191-200, April 1974. References, etc. [BibTeX entry]

• Richard P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201-206, April 1974. References, Citations, etc. [BibTeX entry]

• David Pager. Further results on the problem of finding minimal length programs for decision tables. Journal of the ACM, 21(2):207-212, April 1974. References, etc. [BibTeX entry]

• Armin Gabrielian and Seymour Ginsburg. Grammar schemata. Journal of the ACM, 21(2):213-226, April 1974. References, etc. [BibTeX entry]

• G. Berman and A. W. Collin. A modified list technique allowing binary search. Journal of the ACM, 21(2):227-232, April 1974. Additional information. [BibTeX entry]

• R. T. Chien and E. A. Mark. A document storage method based on polarized distance. Journal of the ACM, 21(2):233-245, April 1974. References, etc. [BibTeX entry]

• Peter Elias. Efficient storage and retrieval by content and address of static files. Journal of the ACM, 21(2):246-260, April 1974. Citations, etc. [BibTeX entry]

• M. M. Blevins and G. W. Stewart. Calculating the eigenvalues of diagonally dominant matrices. Journal of the ACM, 21(2):261-271, April 1974. Additional information. [BibTeX entry]

• Shalhav Zohar. The solution of a Toeplitz set of linear equations. Journal of the ACM, 21(2):272-276, April 1974. References, etc. [BibTeX entry]

• Ellis Horowitz and Sartaj Sahni. Computing partitions with applications to the knapsack problem. Journal of the ACM, 21(2):277-292, April 1974. References, Citations, etc. [BibTeX entry]

• William J. Gordon and Richard F. Riesenfeld. Bernstein-Bézier methods for the computer-aided design of free-form curves and surfaces. Journal of the ACM, 21(2):293-310, April 1974. Additional information. [BibTeX entry]

• Charles B. Dunham. Efficiency of Chebyshev approximation on finite subsets. Journal of the ACM, 21(2):311-313, April 1974. Additional information. [BibTeX entry]

• E. Balkovich, W. Chiu, L. Presser, and R. Wood. Comments on a paper by Gaver. Journal of the ACM, 21(2):314-315, April 1974. References, etc. [BibTeX entry]

• Hisashi Kobayashi. Application of the diffusion approximation to queueing networks I: Equilibrium queue distributions. Journal of the ACM, 21(2):316-328, April 1974. References, Citations, etc. [BibTeX entry]

• J. A. Michel and E. G. Coffman, Jr.. Synthesis of a feedback queueing discipline for computer operation. Journal of the ACM, 21(2):329-339, April 1974. References, etc. [BibTeX entry]

• Steven Katz and Alan G. Konheim. Priority disciplines in a loop system. Journal of the ACM, 21(2):340-349, April 1974. References, etc. [BibTeX entry]

• Manfred H. Hueckel. Erratum: ``A local visual operator which recognizes edges and lines''. Journal of the ACM, 21(2):350, April 1974. References. [BibTeX entry]

• Christopher Earnest. Corrigendum: ``Some topics in code optimization''. Journal of the ACM, 21(2):350, April 1974. References. [BibTeX entry]

• Ramachendra P. Batni, Jeffrey D. Russell, and Charles R. Kime. An efficient algorithm for finding an irredundant set cover. Journal of the ACM, 21(3):351-355, July 1974. References, etc. [BibTeX entry]

• Robert M. Haralick. The diclique representation and decomposition of binary relations. Journal of the ACM, 21(3):356-366, July 1974. References, etc. [BibTeX entry]

• M. S. Hecht and J. D. Ullman. Characterizations of reducible flow graphs. Journal of the ACM, 21(3):367-375, July 1974. Citations, etc. [BibTeX entry]

• E. M. Palmer, M. A. Rahimi, and R. W. Robinson. Efficiency of a binary comparison storage technique. Journal of the ACM, 21(3):376-384, July 1974. References, etc. [BibTeX entry]

• Chung C. Wang. An algorithm for the chromatic number of a graph. Journal of the ACM, 21(3):385-391, July 1974. References, etc. [BibTeX entry]

• C. K. Wong and Don Coppersmith. A combinatorial problem related to multimodule memory organizations. Journal of the ACM, 21(3):392-402, July 1974. References, Citations, etc. [BibTeX entry]

• Gregory J. Chaitin. Information-theoretic limitations of formal systems. Journal of the ACM, 21(3):403-424, July 1974. References, etc. [BibTeX entry]

• John Gill and Manuel Blum. On almost everywhere complex recursive functions. Journal of the ACM, 21(3):425-435, July 1974. References, etc. [BibTeX entry]

• L. K. Schubert. Iterated limiting recursion and the program minimization problem. Journal of the ACM, 21(3):436-445, July 1974. References, etc. [BibTeX entry]

• Thomas N. Hibbard. Context-limited grammars. Journal of the ACM, 21(3):446-453, July 1974. References, etc. [BibTeX entry]

• Paul L. Richman. Computing a subinterval of the image. Journal of the ACM, 21(3):454-458, July 1974. References, etc. [BibTeX entry]

• Hisashi Kobayashi. Application of the diffusion approximation to queueing networks II: Nonequilibrium distributions and applications to computer modeling. Journal of the ACM, 21(3):459-469, July 1974. References, Citations, etc. [BibTeX entry]

• Alan G. Konheim and Bernd Meister. Waiting lines and times in a system with polling. Journal of the ACM, 21(3):470-490, July 1974. Additional information. [BibTeX entry]

• J. M. Robson. Bounds for some functions concerning dynamic storage allocation. Journal of the ACM, 21(3):491-499, July 1974. References, etc. [BibTeX entry]

• Mandell Bellmore and Saman Hong. Transformation of multisalesman problem to the standard traveling salesman problem. Journal of the ACM, 21(3):500-504, July 1974. References, etc. [BibTeX entry]

• L. E. Trotter, Jr. and C. M. Shetty. An algorithm for the bounded variable integer programming problem. Journal of the ACM, 21(3):505-513, July 1974. Additional information. [BibTeX entry]

• T. I. Fenner and G. Loizou. Some new bounds on the condition numbers of optimally scaled matrices. Journal of the ACM, 21(3):514-524, July 1974. References, etc. [BibTeX entry]

• Michael A. Harrison and Ivan M. Havel. On the parsing of deterministic languages. Journal of the ACM, 21(4):525-548, October 1974. References, Citations, etc. [BibTeX entry]

• John Hopcroft and Robert Tarjan. Efficient planarity testing. Journal of the ACM, 21(4):549-568, October 1974. References, Citations, etc. [BibTeX entry]

• Philippe G. H. Lehot. An optimal algorithm to detect a line graph and output its root graph. Journal of the ACM, 21(4):569-575, October 1974. Citations, etc. [BibTeX entry]

• Frank Rubin. A search procedure for Hamilton paths and circuits. Journal of the ACM, 21(4):576-580, October 1974. Additional information. [BibTeX entry]

• Robert J. Plemmons. Linear least squares by elimination and MGS. Journal of the ACM, 21(4):581-585, October 1974. References, etc. [BibTeX entry]

• Paul S. Wang. The undecidability of the existence of zeros of real elementary functions. Journal of the ACM, 21(4):586-589, October 1974. References, etc. [BibTeX entry]

• L. Henschen and L. Wos. Unit refutations and Horn sets. Journal of the ACM, 21(4):590-605, October 1974. References, Citations, etc. [BibTeX entry]

• Arthur J. Nevins. A human oriented logic for automatic theorem-proving. Journal of the ACM, 21(4):606-621, October 1974. References, etc. [BibTeX entry]

• James R. Slagle. Automated theorem-proving for theories with simplifiers, commutativity, and associativity. Journal of the ACM, 21(4):622-642, October 1974. References, Citations, etc. [BibTeX entry]

• H. T. Kung and J. F. Traub. Optimal order of one-point and multipoint iteration. Journal of the ACM, 21(4):643-651, October 1974. Citations, etc. [BibTeX entry]

• Arnold L. Rosenberg. Allocating storage for extendible arrays. Journal of the ACM, 21(4):652-670, October 1974. Citations, etc. [BibTeX entry]

• Ravi Sethi. Testing for the Church-Rosser property. Journal of the ACM, 21(4):671-679, October 1974. References, Citations, etc. [BibTeX entry]

• Anthony S. Wojcik and Gernot Metze. An analysis of some relationships between Post and Boolean algebras. Journal of the ACM, 21(4):680-696, October 1974. Additional information. [BibTeX entry]

Shortcuts: