Journal: Communications of the ACM

Volume 17, Issue 4

181 -- 186Jerome H. Saltzer. A Simple Linear Model of Demand Paging Performance
186 -- 191Mark A. Franklin, Ram K. Gupta. Computation of Page Fault Probability from Program Transition Diagram
192 -- 196John W. Boyse. Execution Characteristics of Programs in a Page-on-Demand System
196 -- 197Graham Smith, Ian M. Sefton. On Lions Counter Example for Gotlieb s Method for the Construction of School Timetables
198 -- 202Gary Lindstrom. Copying List Structures Using Bounded Workspace
202 -- 204Shimon Even. Parallelism in Tape-Sorting
205 -- 206Henry C. Lucas Jr., David B. Montgomery, Jean Claude Larreche. A Study of Computer Use in a Graduate School of Business
206 -- 207Peter Freeman, Michael A. Malcolm, William H. Payne. Graduate Education: The Ph.D. Glut: Response and Rebuttal
207 -- 208Theodor D. Sterling, Seymour V. Pollack. Ideal Teaching Machines-A Solution to the Pedagogic Language Problem
209 -- 210Paul W. Abrahams. Some Remarks on Lookup of Structured Variables
209 -- 0Grover C. Simmons. Addendum to M. L. Patrick Paper
210 -- 0A. Balfour. An Alternative Approach to Mutual Recursion in Algol 60 Using Restricted Compilers
211 -- 217Richard C. T. Lee, Chin-Liang Chang, Richard J. Waldinger. An Improved Program-Synthesizing Algorithm and Its Correctness
224 -- 225Gideon Ehrlich. Generator of Set-Partitions to Exactly R Subsets [G7] (Algorithm 477)
225 -- 0Bo Einarsson. Solution of the Transcendental Equation w*exp(x)=x (Remark on Algorithm 443)