Journal of the ACM, Volume 26, 1979

Volume 26, Number 1, January 1979

Rainer Parchmann:
Control System Model for Critically Timed Sources. 1-5
Electronic Edition (ACM DL) BibTeX
Alan Jay Smith:
Characterizing the Storage Process and Its Effect on the Update of Main Memory by Write Through. 6-27
Electronic Edition (ACM DL) BibTeX
Udaiprakash Gupta:
Bounds on Storage for Consecutive Retrieval. 28-36
Electronic Edition BibTeX
Alberto O. Mendelzon:
On Axiomatizing Multivalued Dependencies in Relational Databases. 37-44
Electronic Edition BibTeX
Steven P. Reiss:
Security in Databases: A Combinatorial Study. 45-57
Electronic Edition BibTeX
Zvi Galil, Nimrod Megiddo:
A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort. 58-64
Electronic Edition BibTeX
James M. Lemme, John R. Rice:
Speedup in Parallel Algorithms for Adaptive Quadrature. 65-71
Electronic Edition (ACM DL) BibTeX
Garry H. Rodrigue, Niel K. Madsen, Jack I. Karush:
Odd-Even Reduction for Banded Linear Equations. 72-81
Electronic Edition (ACM DL) BibTeX
George S. Fishman, Louis R. Moore:
Estimating the Mean of a Correlated Binary Sequence with an Application to Discrete Event Simulation. 82-94
Electronic Edition (ACM DL) BibTeX
Christos H. Papadimitriou:
Optimality of the Fast Fourier transform. 95-102
Electronic Edition (ACM DL) BibTeX
Walter J. Savitch, Michael J. Stimson:
Time Bounded Random Access Machines with Parallel Processing. 103-118
Electronic Edition (ACM DL) BibTeX
John C. Cherniavsky, Samuel N. Kamin:
A Complete and Consistent Hoare Axiomatics for a Simple Programming Language. 119-128
Electronic Edition (ACM DL) BibTeX
Edmund M. Clarke:
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems. 129-147
Electronic Edition BibTeX
Gérard Berry, Jean-Jacques Lévy:
Minimal and Optimal Computations of Recursive Programs. 148-175
Electronic Edition (ACM DL) BibTeX

Volume 26, Number 2, April 1979

Frank K. Hwang:
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees. 177-182
Electronic Edition (ACM DL) BibTeX
George S. Lueker, Kellogg S. Booth:
A Linear Time Algorithm for Deciding Interval Graph Isomorphism. 183-195
Electronic Edition (ACM DL) BibTeX
Azad Bolour:
Optimality Properties of Multiple-Key Hashing Functions. 196-210
Electronic Edition BibTeX
Mark R. Brown, Robert Endre Tarjan:
A Fast Merging Algorithm. 211-226
Electronic Edition BibTeX
Frank Fussenegger, Harold N. Gabow:
A Counting Approach to Lower Bounds for Selection Problems. 227-238
Electronic Edition (ACM DL) BibTeX
Boleslaw Z. Kacewicz:
Integrals with a Kernel in the Solution of Nonlinear Equations in N Dimensions. 239-249
Electronic Edition (ACM DL) BibTeX
Joseph F. Traub, Henryk Wozniakowski:
Convergence and Complexity of Newton Iteration for Operator Equations. 250-258
Electronic Edition (ACM DL) BibTeX
Erol Gelenbe:
On the Optimum Checkpoint Interval. 259-270
Electronic Edition BibTeX
Donald L. Iglehart, Peter A. W. Lewis:
Regenerative Simulation with Internal Controls. 271-282
Electronic Edition (ACM DL) BibTeX
Tomasz Kowaltowski:
Data Structures and Correctness of Programs. 283-301
Electronic Edition (ACM DL) BibTeX
George Milne, Robin Milner:
Concurrent Processes and Their Syntax. 302-321
Electronic Edition BibTeX
Barry K. Rosen:
Data Flow Analysis for Procedural Languages. 322-344
Electronic Edition (ACM DL) BibTeX
Karel Culik II:
A Purely Homomorphic Characterization of Recursively Enumerable Sets. 345-350
Electronic Edition (ACM DL) BibTeX
Robert E. Shostak:
A Practical Decision Procedure for Arithmetic with Function Symbols. 351-360
Electronic Edition (ACM DL) BibTeX
Nicholas Pippenger, Michael J. Fischer:
Relations Among Complexity Measures. 361-381
Electronic Edition (ACM DL) BibTeX

Volume 26, Number 3, July 1979

Lawrence J. Henschen:
Theorem Proving by Covering Expressions. 385-400
Electronic Edition (ACM DL) BibTeX
Jacques Cohen, Timothy J. Hickey:
Two Algorithms for Determining Volumes of Convex Polyhedra. 401-414
Electronic Edition (ACM DL) BibTeX
D. T. Lee, Franco P. Preparata:
An Optimal Algorithm for Finding the Kernel of a Polygon. 415-421
Electronic Edition (ACM DL) BibTeX
Kuo-Chung Tai:
The Tree-to-Tree Correction Problem. 422-433
Electronic Edition BibTeX
Glenn K. Manacher:
Significant Improvements to the Hwang-Lin Merging Algorithm. 434-440
Electronic Edition (ACM DL) BibTeX
Glenn K. Manacher:
The Ford-Johnson Sorting Algorithm Is Not Optimal. 441-456
Electronic Edition (ACM DL) BibTeX
H. Raymond Strong, George Markowsky, Ashok K. Chandra:
Search within a Page. 457-482
Electronic Edition BibTeX
T. D. Bui:
Some A-Stable and L-Stable Methods for the Numerical Integration of Stiff Ordinary Differential Equations. 483-493
Electronic Edition (ACM DL) BibTeX
Robert D. Skeel:
Scaling for Numerical Stability in Gaussian Elimination. 494-526
Electronic Edition (ACM DL) BibTeX
Arthur G. Werschulz:
Maximal Order and Order of Information for Numerical Quadrature. 527-537
Electronic Edition (ACM DL) BibTeX
Greg N. Frederickson:
Approximation Algorithms for Some Postman Problems. 538-554
Electronic Edition (ACM DL) BibTeX
Brenda S. Baker, S. Rao Kosaraju:
A Comparison of Multilevel break and next Statements. 555-566
Electronic Edition (ACM DL) BibTeX
Eitan M. Gurari, Oscar H. Ibarra:
An NP-Complete Number-Theoretic Problem. 567-581
Electronic Edition (ACM DL) BibTeX
Zvi M. Kedem:
Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications and Divisions. 582-601
Electronic Edition (ACM DL) BibTeX

Volume 26, Number 4, October 1979

Sandra L. Mitchell, Terry Beyer, W. Jones:
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs. 603-610
Electronic Edition (ACM DL) BibTeX
Jonathan L. Gross, Ronald H. Rosen:
A Linear Time Planarity Algorithm for 2-Complexes. 611-617
Electronic Edition (ACM DL) BibTeX
Mihalis Yannakakis:
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems. 618-630
Electronic Edition (ACM DL) BibTeX
Christos H. Papadimitriou:
The serializability of concurrent database updates. 631-653
Electronic Edition BibTeX
Haim Mendelson, Uri Yechiali:
Performance Measures for Ordered Lists in Random-Access Files. 654-667
Electronic Edition (ACM DL) BibTeX
Arnold L. Rosenberg:
Encoding Data Structures in Trees. 668-689
Electronic Edition BibTeX
Robert Endre Tarjan:
Applications of Path Compression on Balanced Trees. 690-715
Electronic Edition (ACM DL) BibTeX
Joaquín Bustoz, Alan Feldstein, Richard Goodman, Seppo Linnainmaa:
Improved Trailing Digits Estimates Applied to Optimal Computer Arithmetic. 716-730
Electronic Edition (ACM DL) BibTeX
John C. Butcher:
A Transformed implicit Runge-Kutta Method. 731-738
Electronic Edition (ACM DL) BibTeX
Donald B. Johnson, Webb Miller, Brian Minnihan, Celia Wrathall:
Reducibility Among Floating-Point Graphs. 739-760
Electronic Edition (ACM DL) BibTeX
U. Narayan Bhat, Richard E. Nance:
An Evaluation of CPU Efficiency Under Dynamic Quantum Allocation. 761-778
Electronic Edition (ACM DL) BibTeX
Andrew S. Noetzel:
A Generalized Queueing Discipline for Product Form Network Solutions. 779-793
Electronic Edition (ACM DL) BibTeX
Robin Milner:
Flowgraphs and Flow Algebras. 794-818
Electronic Edition BibTeX
Luigi Logrippo:
Renamings, Maximal Parallelism, and Space-Time Tradeoff in Program Schemata. 819-833
Electronic Edition (ACM DL) BibTeX