Journal of the ACM, Volume 18, 1971

Volume 18, Number 1, January 1971

• Gerard Salton:
  Some Thoughts on Scientific Information Dissemination. 1-3
  
• Stephen A. Cook:
  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers. 4-18
  
• William H. Kautz:
  An Augmented Content-Addressed Memory Array for Implementation With Large-Scale Integration. 19-33
  
• Brian W. Kernighan:
  Optimal Sequential Partitions of Graphs. 34-40
  
• Nabih N. Abdelmalek:
  Linear L₁ Approximation for a Discrete Point Set and L₁ Solutions of Overdetermined Linear Equations. 41-47
  
• N. F. Benschop, H. C. Ratz:
  A Mean Square Estimate of the Generated Roundoff Error in Constant Matrix Iterative Processes. 48-62
  
• Colin W. Cryer:
  Topological Problems Arising When Solving Boundary Value Problems for Elliptic Partial Differential Equations by the Method of Finite Differences. 63-74
  
• C. Dill, C. William Gear:
  A Graphical Search for Stiffly Stable Methods for Ordinary Differential Equations. 75-79
  
• Alfred V. Aho, Peter J. Denning, Jeffrey D. Ullman:
  Principles of Optimal Page Replacement. 80-93
  
• G. C. Philippatos, D. R. Moscato:
  Effects of Constrained Information on Player Decisions in Experimental Business Simulation: Some Empirical Evidence. 94-104
  
• J. C. Alexander, A. I. Thaler:
  The Boundary Count of Digital Pictures. 105-112
  
• Manfred H. Hueckel:
  An Operator Which Locates Edges in Digitized Pictures. 113-125
  
• Chin-Liang Chang, James R. Slagle:
  Completeness of Linear Refutation for Theories with Equality. 126-136
  

Volume 18, Number 2, April 1971

• James Hardy Wilkinson:
  Some Comments from a Numerical Analyst. 137-147
  
• Michael A. Harrison, Mario Schkolnick:
  A Grammatical Characterization of One-Way Nondeterministic Stack Languages. 148-172
  
• William Goffman:
  A Mathematical Method for Analyzing the Growth of a Scientific Discipline. 173-185
  
• Donald P. Gaver, Peter A. W. Lewis:
  Probability Models for Buffer Storage Allocation Problems. 186-198
  
• Peter A. W. Lewis, Gerald S. Shedler:
  A Cyclic-Queue Model of System Overhead in Multiprogrammed Computer Systems. 199-220
  
• U. Narayan Bhat, Richard E. Nance:
  Busy Period Analysis of a Time-Sharing System Modeled as a Semi-Markov Process. 221-238
  
• John Mylopoulos, Theodosios Pavlidis:
  On the Topological Properties of Quantized Spaces, I. The Notion of Dimension. 239-246
  
• John Mylopoulos, Theodosios Pavlidis:
  On the Topological Properties of Quantized Spaces, II. Connectivity and Order of Connectivity. 247-254
  
• Renato Stefanelli, Azriel Rosenfeld:
  Some Parallel Thinning Algorithms for Digital Pictures. 255-264
  
• Robert O. Winder:
  Chow Parameters in Threshold Logic. 265-289
  
• Manuel Blum:
  On Effective Procedures for Speeding Up Algorithms. 290-305
  
• Stephen N. Cole:
  Deterministic Pushdown Store Machines and Real-Time Computation. 306-328
  

Volume 18, Number 3, July 1971

• John Case:
  A Note on Degrees of Self-Describing Turing Machines. 329-338
  
• Alvy Ray Smith:
  Simple Computation-Universal Cellular Spaces. 339-353
  
• Richard Simon, Richard C. T. Lee:
  On the Optimal Solutions to AND/OR Series-Parallel Graphs. 354-372
  
• M. S. Mock:
  Numerical Analysis of a Nonlinear Diffusion Problem. 373-380
  
• J. P. R. Tootill, W. D. Robinson, A. G. Adams:
  The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators. 381-399
  
• William H. Burge, Alan G. Konheim:
  An Accessing Model. 400-404
  
• Donald P. Gaver:
  Analysis of Remote Terminal Backlogs under Heavy Demand Conditions. 405-415
  
• John Michael Robson:
  An Estimate of the Store Size Necessary for Dynamic Storage Allocation. 416-423
  
• John Lions:
  Some Results Concerning the Reduction of Binary Matrices. 424-430
  
• Ronald C. de Vries:
  Minimal Sets of Distinct Literals for a Logically Passive Function. 431-443
  
• Juris Hartmanis, John E. Hopcroft:
  An Overview of the Theory of Computational Complexity. 444-475
  

Volume 18, Number 4, October 1971

• Introduction. 477
  
• W. S. Brown:
  On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors. 478-504
  
• W. S. Brown, J. F. Traub:
  On Euclid's Algorithm and the Theory of Subresultants. 505-514
  
• George E. Collins:
  The Calculation of Multivariate Polynomial Resultants. 515-532
  
• Lee E. Heindel:
  Integer Arithmetic Algorithms for Polynomial Real Zero Determination. 533-548
  
• William A. Martin:
  Determining the Equivalence of Algebraic Expressions by Hash Coding. 549-558
  
• Stephen C. Johnson:
  On the Problem of Recognizing Zero. 559-565
  
• James R. Bunch:
  Equilibration of Symmetric Matrices in the Max-Norm. 566-572
  
• Donald J. Rose:
  A Note on Consistent Ordering and Zero Circulation. 573-575
  
• M. A. Kaplan, R. A. Papetti:
  A Note on Quadrilateral Interpolation. 576-585
  
• C. S. Smith:
  Multiplicative Pseudo-Random Number Generators with Prime Modulus. 586-593
  
• E. Wasserstrom:
  Solving Boundary-Value Problems by Imbedding. 594-602
  
• Igal Adiri:
  A Dynamic Time-Sharing Priority Queue. 603-610
  
• Igal Adiri:
  A Note on Some Mathematical Models of Time-Sharing Systems. 611-615
  
• Keki B. Irani, V. L. Wallace:
  On Network Linguistics and the Conversational Design of Queueing Networks. 616-629
  
• Raymond Reiter:
  Two Results on Ordering for Resolution with Merging and Linear Format. 630-646