Journal of the ACM -- 1979

Volume 26, Number 1, January 1979

• Rainer Parchmann. Control system model for critically timed success. Journal of the ACM, 26(1):1-5, January 1979. Citations. [BibTeX entry]

• Alan Jay Smith. Characterizing the storage process and its effect on the update of main memory by write through. Journal of the ACM, 26(1):6-27, January 1979. [BibTeX entry]

• Udaiprakash Gupta. Bounds on storage for consecutive retrieval. Journal of the ACM, 26(1):28-36, January 1979. Citations. [BibTeX entry]

• Alberto O. Mendelzon. On axiomatizing multivalued dependencies in relational databases. Journal of the ACM, 26(1):37-44, January 1979. [BibTeX entry]

• Steven P. Reiss. Security in databases: A combinatorial study. Journal of the ACM, 26(1):45-57, January 1979. [BibTeX entry]

• Zvi Galil and Nimrod Megiddo. A fast selection algorithm and the problem of optimum distribution of effort. Journal of the ACM, 26(1):58-64, January 1979. [BibTeX entry]

• James M. Lemme and John R. Rice. Speedup in parallel algorithms for adaptive quadrature. Journal of the ACM, 26(1):65-71, January 1979. [BibTeX entry]

• Garry H. Rodrigue, Niel K. Madsen, and Jack I. Karush. Odd-even reduction for banded linear equations. Journal of the ACM, 26(1):72-81, January 1979. [BibTeX entry]

• George S. Fishman and Louis R. Moore. Estimating the mean of a correlated binary sequence with an application to discrete event simulation. Journal of the ACM, 26(1):82-94, January 1979. [BibTeX entry]

• Christos H. Papadimitriou. Optimality of the fast Fourier transform. Journal of the ACM, 26(1):95-102, January 1979. [BibTeX entry]

• Walter J. Savitch and Michael J. Stimson. Time bounded random access machines with parallel processing. Journal of the ACM, 26(1):103-118, January 1979. [BibTeX entry]

• John C. Cherniavsky and Samuel N. Kamin. A complete and consistent Hoare axiomatics for a simple programming language. Journal of the ACM, 26(1):119-128, January 1979. [BibTeX entry]

• Edmund Melson Clarke Jr.. Programming language constructs for which it is impossible to obtain good Hoare axiom systems. Journal of the ACM, 26(1):129-147, January 1979. Citations. [BibTeX entry]

• Gérard Berry and Jean-Jacques Lévy. Minimal and optimal computations of recursive programs. Journal of the ACM, 26(1):148-175, January 1979. Citations. [BibTeX entry]

Volume 26, Number 2, April 1979

• F. K. Hwang. An O(n log n) algorithm for rectilinear minimal spanning trees. Journal of the ACM, 26(2):177-182, April 1979. Citations. [BibTeX entry]

• George S. Lueker and Kellogg S. Booth. A linear time algorithm for deciding interval graph isomorphism. Journal of the ACM, 26(2):183-195, April 1979. Citations. [BibTeX entry]

• Azad Bolour. Optimality properties of multiple-key hashing functions. Journal of the ACM, 26(2):196-210, April 1979. [BibTeX entry]

• Mark R. Brown and Robert E. Tarjan. A fast merging algorithm. Journal of the ACM, 26(2):211-226, April 1979. [BibTeX entry]

• Frank Fussenegger and Harold N. Gabow. A counting approach to lower bounds for selection problems. Journal of the ACM, 26(2):227-238, April 1979. Citations. [BibTeX entry]

• Boleslaw Kacewicz. Integrals with a kernel in the solution of nonlinear equations in N dimensions. Journal of the ACM, 26(2):239-249, April 1979. Citations. [BibTeX entry]

• J. F. Traub and H. Wo\'zniakowski. Convergence and complexity of Newton iteration for operator equations. Journal of the ACM, 26(2):250-258, April 1979. Citations. [BibTeX entry]

• Erol Gelenbe. On the optimum checkpoint interval. Journal of the ACM, 26(2):259-270, April 1979. Citations. [BibTeX entry]

• Donald L. Iglehart and Peter A. W. Lewis. Regenerative simulation with internal controls. Journal of the ACM, 26(2):271-282, April 1979. [BibTeX entry]

• Tomasz Kowaltowski. Data structures and correctness of programs. Journal of the ACM, 26(2):283-301, April 1979. [BibTeX entry]

• George Milne and Robin Milner. Concurrent processes and their syntax. Journal of the ACM, 26(2):302-321, April 1979. Citations. [BibTeX entry]

• Barry K. Rosen. Data flow analysis for procedural languages. Journal of the ACM, 26(2):322-344, April 1979. [BibTeX entry]

• K. Culik II. A purely homomorphic characterization of recursively enumerable sets. Journal of the ACM, 26(2):345-350, April 1979. Citations. [BibTeX entry]

• Robert E. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the ACM, 26(2):351-360, April 1979. Citations. [BibTeX entry]

• Nicholas Pippenger and Michael J. Fischer. Relations among complexity measures. Journal of the ACM, 26(2):361-381, April 1979. Citations. [BibTeX entry]

Volume 26, Number 3, July 1979

• L. J. Henschen. Theorem proving by covering expressions. Journal of the ACM, 26(3):385-400, July 1979. [BibTeX entry]

• Jacques Cohen and Timothy Hickey. Two algorithms for determining volumes of convex polyhedra. Journal of the ACM, 26(3):401-414, July 1979. Citations. [BibTeX entry]

• D. T. Lee and F. P. Preparata. An optimal algorithm for finding the kernel of a polygon. Journal of the ACM, 26(3):415-421, July 1979. Citations. [BibTeX entry]

• Kuo-Chung Tai. The tree-to-tree correction problem. Journal of the ACM, 26(3):422-433, July 1979. Citations. [BibTeX entry]

• Glenn K. Manacher. Significant improvements to the Hwang-Lin merging algorithms. Journal of the ACM, 26(3):434-440, July 1979. [BibTeX entry]

• Glenn K. Manacher. The Ford-Johnson sorting algorithm is not optimal. Journal of the ACM, 26(3):441-456, July 1979. [BibTeX entry]

• H. R. Strong, G. Markowsky, and A. K. Chandra. Search within a page. Journal of the ACM, 26(3):457-482, July 1979. [BibTeX entry]

• T. D. Bui. Some A-stable and L-stable methods for the numerical integration of stiff ordinary differential equations. Journal of the ACM, 26(3):483-493, July 1979. [BibTeX entry]

• Robert D. Skeel. Scaling for numerical stability in Gaussian elimination. Journal of the ACM, 26(3):494-526, July 1979. [BibTeX entry]

• Arthur G. Werschulz. Maximal order and order of information for numerical quadrature. Journal of the ACM, 26(3):527-537, July 1979. [BibTeX entry]

• Greg N. Frederickson. Approximation algorithms for some postman problems. Journal of the ACM, 26(3):538-554, July 1979. [BibTeX entry]

• Brenda S. Baker and S. Rao Kosaraju. A comparison of multilevel break and next statements. Journal of the ACM, 26(3):555-566, July 1979. [BibTeX entry]

• Eitan M. Gurari and Oscar H. Ibarra. An NP-complete number-theoretic problem. Journal of the ACM, 26(3):567-581, July 1979. [BibTeX entry]

• Zvi M. Kedem. Combining dimensionality and rate and growth arguments for establishing lower bounds on the number of multiplications and divisions. Journal of the ACM, 26(3):582-601, July 1979. [BibTeX entry]

Volume 26, Number 4, October 1979

• T. Beyer, W. Jones, and S. Mitchell. Linear algorithms for isomorphism of maximal outerplanar graphs. Journal of the ACM, 26(4):603-610, October 1979. Citations. [BibTeX entry]

• Jonathan L. Gross and Ronald H. Rosen. A linear time planarity algorithm for 2-complexes. Journal of the ACM, 26(4):611-617, October 1979. [BibTeX entry]

• Mihalis Yannakakis. The effect of a connectivity requirement on the complexity of maximum subgraph problems. Journal of the ACM, 26(4):618-630, October 1979. Citations. [BibTeX entry]

• Christos H. Papadimitriou. The serializability of concurrent database updates. Journal of the ACM, 26(4):631-653, October 1979. Citations. [BibTeX entry]

• Haim Mendelson and Uri Yechiali. Performance measures for ordered lists in random-access files. Journal of the ACM, 26(4):654-667, October 1979. [BibTeX entry]

• Arnold L. Rosenberg. Encoding data structures in trees. Journal of the ACM, 26(4):668-689, October 1979. Citations. [BibTeX entry]

• Robert Endre Tarjan. Applications of path compression on balanced trees. Journal of the ACM, 26(4):690-715, October 1979. Citations. [BibTeX entry]

• Joaquín Bustoz, Alan Feldstein, Richard Goodman, and Seppo Linnainmaa. Improved trailing digit estimates applied to optimal computer arithmetic. Journal of the ACM, 26(4):716-730, October 1979. [BibTeX entry]

• J. C. Butcher. A transformed Runge-Kutta method. Journal of the ACM, 26(4):731-738, October 1979. [BibTeX entry]

• Donald B. Johnson, Webb Miller, Brian Minnihan, and Celia Wrathall. Reducibility among floating-point graphs. Journal of the ACM, 26(4):739-760, October 1979. [BibTeX entry]

• U. Narayan Bhat and Richard E. Nance. An evaluation of CPU efficiency under dynamic quantum allocation. Journal of the ACM, 26(4):761-778, October 1979. [BibTeX entry]

• Andrew S. Noetzel. A generalized queueing discipline for product form network solutions. Journal of the ACM, 26(4):779-793, October 1979. [BibTeX entry]

• Robin Milner. Flowgraphs and flow algebras. Journal of the ACM, 26(4):794-818, October 1979. Citations. [BibTeX entry]

• Luigi Logrippo. Renamings, maximal parallelism, and space-time tradeoff in program schemata. Journal of the ACM, 26(4):819-833, October 1979. [BibTeX entry]

Shortcuts: