1 2Communications of the ACM 3Volume 4, Number 4, April, 1961 4 5 J. R. Herndon ACM Algorithm 49: Spherical Neumann 6 Function . . . . . . . . . . . . . . . . 179 7 8Communications of the ACM 9Volume 5, Number 12, December, 1962 10 11 J. N. Merner ACM Algorithm 149: Complete Elliptic 12 Integral . . . . . . . . . . . . . . . . 605 13 14Communications of the ACM 15Volume 6, Number 6, June, 1963 16 17 O. G. Ludwig ACM Algorithm 179: Incomplete Beta Ratio 314 18 19Communications of the ACM 20Volume 6, Number 12, December, 1963 21 22 R. H. Kase ACM Algorithm 219: Topological Ordering 23 for Pert Networks . . . . . . . . . . . 738--739 24 25Communications of the ACM 26Volume 7, Number 8, August, 1964 27 28 W. Gautschi ACM Algorithm 236: Bessel Functions of 29 the First Kind . . . . . . . . . . . . . 479--480 30 31Communications of the ACM 32Volume 7, Number 12, December, 1964 33 34 J. Boothroyd ACM Algorithm 246: Graycode . . . . . . 701 35 36Communications of the ACM 37Volume 8, Number 8, August, 1965 38 39 W. Gautschi ACM Algorithm 259: Legendre Functions 40 for Arguments Larger than One . . . . . 488--492 41 42Communications of the ACM 43Volume 9, Number 5, May, 1966 44 45 W. Fletcher ACM Algorithm 284: Interchange of Two 46 Blocks of Data . . . . . . . . . . . . . 326 47 48Communications of the ACM 49Volume 10, Number 4, April, 1967 50 51 I. D. Hill and 52 M. C. Pike ACM Algorithm 299: Chi-Squared Integral 243--244 53 54Communications of the ACM 55Volume 11, Number 3, March, 1968 56 57 Edsger Wybe Dijkstra Go to statement considered harmful . . . 147--148 58 59Communications of the ACM 60Volume 12, Number 5, May, 1969 61 62 ANSI Subcommittee X3J3 Clarification of Fortran Standards --- 63 Initial Progress . . . . . . . . . . . . 289--294 64 65Communications of the ACM 66Volume 12, Number 9, September, 1969 67 68 N. Wirth On Multiprogramming, Machine Coding, and 69 Computer Organization . . . . . . . . . 489--498 70 71Communications of the ACM 72Volume 1, Number 11, November, 1970 73 74 V. Y. Lum Multi-Attribute Retrieval with Combined 75 Indexes . . . . . . . . . . . . . . . . 660--665 76 77Communications of the ACM 78Volume 13, Number 1, January, 1970 79 80 T. C. Lowe Automatic segmentation of cyclic program 81 structures based on connectivity and 82 processor timing . . . . . . . . . . . . 3--6 83 Walter Gautschi and 84 Bruce J. Klein Recursive computation of certain 85 derivatives --- A study of error 86 propagation . . . . . . . . . . . . . . 7--9 87 A. P. Mullery and 88 G. C. Driscoll A processor allocation method for 89 time-sharing . . . . . . . . . . . . . . 10--14 90 R. F. Simmons Natural Language Question-Answering 91 Systems: 1969 . . . . . . . . . . . . . 15--30 92 E. T. Irons Experience with an extensible language 31--40 93 U. Montanari A note on minimal length polygonal 94 approximation to a digitized contour . . 41--47 95 Harald Stehfest ACM Algorithm 368: Numerical Inversion 96 of Laplace Transforms . . . . . . . . . 47--49 97 H. E. Schaffer ACM Algorithm 369: Generator of Random 98 Numbers Satisfying the Poisson 99 Distribution . . . . . . . . . . . . . . 49--49 100 E. L. Butler ACM Algorithm 370: General Random Number 101 Generator . . . . . . . . . . . . . . . 49--52 102 J. K. S. McKay ACM Algorithm 371: Partitions in Natural 103 Order . . . . . . . . . . . . . . . . . 52--52 104 K. B. Dunham ACM Algorithm 372: An Algorithm to 105 Produce Complex Primes CSIEVE . . . . . 52--54 106 R. Griffin and 107 K. A. Redich Remark on ``Algorithm 347 [M1]: An 108 Efficient Algorithm for Sorting with 109 Minimal Storage'', by R. C. Singleton 54--54 110 Anonymous Representation for calendar date for 111 machine-to-machine data interchange . . 55--55 112 Anonymous Interchange rolls of perforated tape for 113 information interchange . . . . . . . . 56--56 114 W. H. Payne Fortran Tausworthe pseudorandom number 115 generator . . . . . . . . . . . . . . . 57--57 116 117Communications of the ACM 118Volume 13, Number 2, February, 1970 119 120 David K. Hsiao and 121 Frank D. Harary A Formal System for Information 122 Retrieval from Files . . . . . . . . . . 67--73 123 E. von Glaserfeld and 124 P. P. Pisani The multistore parser for hierarchical 125 syntactic structures . . . . . . . . . . 74--82 126 Steven Vere Translation equations . . . . . . . . . 83--89 127 H. L. Morgan Spelling correction in systems programs 90--94 128 J. Earley An Efficient Context-Free Parsing 129 Algorithm . . . . . . . . . . . . . . . 94--102 130 C. E. Radke The Use of Quadratic Residue Research 103--105 131 B. Jones A Variation on Sorting by Address 132 Calculation . . . . . . . . . . . . . . 105--107 133 James R. Bell The Quadratic Quotient Method: A Hash 134 Code Eliminating Secondary Clustering 107--109 135 D. N. Ness and 136 R. S. Green and 137 W. A. Martin and 138 G. A. Moulton Computer education in a graduate school 139 of management . . . . . . . . . . . . . 110--114, 19 140 M. F. Robbins and 141 J. D. Beyer An interactive computer system using 142 graphical flowchart input . . . . . . . 115--119 143 J. S. White ACM Algorithm 373: Number of Doubly 144 Restricted Partitions . . . . . . . . . 120--120 145 J. S. White ACM Algorithm 374: Restricted Partition 146 Generator . . . . . . . . . . . . . . . 120--120 147 H. Spath ACM Algorithm 375: Fitting Data to One 148 Exponential . . . . . . . . . . . . . . 120--121 149 H. Spath Fitting data to one exponential . . . . 120--121 150 H. Spath ACM Algorithm 376: Least Squares Fit by 151 $f(x)=A\cos(Bx+C)$ . . . . . . . . . . . 121--122 152 153Communications of the ACM 154Volume 13, Number 3, March, 1970 155 156 H. L. Morgan Spelling correction in systems programs 90--94 157 R. R. Fenichel and 158 J. Weizenbaum and 159 J. C. Yochelson A Program to Teach Programming . . . . . 141--146 160 J. R. Slagle and 161 J. K. Dixon Experiments with the M & N 162 Tree-Searching Program . . . . . . . . . 147--154, 159 163 A. Batson and 164 Shy-Ming M. Ju and 165 D. C. Wood Measurements of Segment Size . . . . . . 155--159 166 G. A. Watson On an Algorithm for Nonlinear Minimax 167 Approximation . . . . . . . . . . . . . 160--162 168 D. G. Schweikert A Comparison of Error Improvement 169 Estimates for Adaptive Trapezoid 170 Integration . . . . . . . . . . . . . . 163--166 171 Robert M. Schwarcz and 172 John F. Burger and 173 Robert F. Simmons A Deductive Question Answerer for 174 Natural Language Inference . . . . . . . 167--183 175 A. F. Cardenas and 176 W. J. Karplus PDEL, a Language for Partial 177 Differential Equations . . . . . . . . . 184--191 (or 184--190??) 178 M. J. Levine and 179 S. M. Swanson ACM Algorithm 377: Symbolic Expansion of 180 Algebraic Expressions . . . . . . . . . 191--192 181 M. V. Kailas Another method of converting from 182 hexadecimal to decimal . . . . . . . . . 193--193 183 D. Pager A number system for the permutations . . 193--193 184 J. R. H. Dempster Comment on a Paging Anomaly . . . . . . 193--194 185 H. A. Maurer A Note on the Complement of Inherently 186 Ambiguous Context-Free Languages . . . . 194--194 187 D. K. Hsiao and 188 F. D. Harary Corrigenda: ``A Formal System for 189 Information Retrieval from Files'' . . . 266--266 190 191Communications of the ACM 192Volume 13, Number 4, April, 1970 193 194 A. J. DeSalvio and 195 J. G. Purdy and 196 J. Rau Creation and Control of Internal Data 197 Bases Under a Fortran Programming 198 Environment . . . . . . . . . . . . . . 211--215 199 H. D. Mills Syntax-Directed Documentation for PL360 216--222 200 Rudolf Bayer and 201 Christoph Witzgall Some Complete Calculi for Matrices . . . 223--237 202 P. Brinch Hansen The Nucleus of a Multiprogramming System 238--241, 250 203 C. M. Eastman Representations for Space Planning . . . 242--250 204 J. E. Pomeranz and 205 R. L. Weil, Jr. The cyclical majority problem . . . . . 251--254 206 E. N. Nilson Cubic Splines on Uniform Meshes . . . . 255--258 207 W. Pankiewicz ACM Algorithm 378: Discretized 208 Newton-like Method for Solving a System 209 of Simultaneous Nonlinear Equations . . 259--260 210 J. N. Lyness ACM Algorithm 379: SQUANK (Simpson 211 Quadrature Used Adaptively-Noise Killed) 260--263 (or 260--262??) 212 W. F. Heess, Jr. Comments on a paper by Wallace and Mason 264--265 213 J. L. Smith Comment on multiprogramming under a page 214 on demand strategy . . . . . . . . . . . 265--265 215 Ronald C. de Vries Comment on Lawler's Multilevel Boolean 216 minimization . . . . . . . . . . . . . . 265--266 217 K. R. Knight An Algol construction for procedures as 218 parameters of procedures . . . . . . . . 266--266 219 N. Wirth Corrigenda: ``On Multiprogramming, 220 Machine Coding, and Computer 221 Organization'' . . . . . . . . . . . . . 266--266 222 223Communications of the ACM 224Volume 13, Number 5, May, 1970 225 226 L. Hodes Programming System for the On-Line 227 Analysis of Biomedical Images . . . . . 279--283, 286 228 G. A. Sitton Operations on Generalized Arrays with 229 the Genie Compiler . . . . . . . . . . . 284--286 230 S. Vere Translation Equations (Errata) . . . . . 286--286 231 W. E. Sasser and 232 D. S. Burdick and 233 D. A. Graham and 234 T. H. Naylor Application of Sequential Sampling to 235 Simulation. an Example Inventory Model 287--296 236 J. Loeckx Algorithm for the Construction of 237 Bounded-Context Parsers . . . . . . . . 297--307 238 John C. Reynolds GEDANKEN --- A Simple Typeless Language 239 Based on the Principle of Completeness 240 and the Reference Concept . . . . . . . 308--319 241 S. Crespi-Reghizzi and 242 R. Morpurgo A language for treating graphs . . . . . 319--323 243 S. Laflin and 244 M. A. Brebner ACM Algorithm 380: In-situ Transposition 245 of a Rectangular Matrix . . . . . . . . 324--326 (or 324--325??) 246 R. E. Knop ACM Algorithm 381: Random Vectors 247 Uniform In Solid Angle . . . . . . . . . 326--326 248 249Communications of the ACM 250Volume 13, Number 6, June, 1970 251 252 H. A. Elder On the Feasibility of Voice Input to an 253 On-Line Computer Processing System . . . 339--346 254 C. R. Muthukrishnan and 255 V. Rajaraman On the Conversion of Decision Tables to 256 Computer Programs . . . . . . . . . . . 347--351 257 J. E. Grimes Scheduling to Reduce Conflict in 258 Meetings . . . . . . . . . . . . . . . . 351--352 259 D. G. Frantz A PL\slash 1 program to assist the 260 comparative linguist . . . . . . . . . . 353--356 261 F. J. Damerau Automatic Parsing for Content Analysis 356--360 262 Peter Linz Accurate Floating-Point Summation . . . 361--362 263 K. E. Hillstrom Comparison of Several Adaptive 264 Newton-Cotes Quadrature Routines in 265 Evaluating Definite Integrals with 266 Peaked Integrands . . . . . . . . . . . 362--365 267 G. W. Stewart Incorporating Origin Shifts into the QR 268 Algorithm for Symmetric Tridiagonal 269 Matrices . . . . . . . . . . . . . . . . 365--367 270 P. J. Chase ACM Algorithm 382: Combinations of ${M}$ 271 Out of ${N}$ Objects . . . . . . . . . . 368--368 272 P. J. Chase ACM Algorithm 383: Permutations of a Set 273 with Repetitions . . . . . . . . . . . . 368--369 274 G. W. Stewart ACM Algorithm 384: Eigenvalues and 275 Eigenvectors of a Real Symmetric Matrix 276 [F2] . . . . . . . . . . . . . . . . . . 369--371 277 R. L. London Certification of Algorithm 245 (M1) 278 Treesort 3: Proof of Algorithms --- A 279 New Kind of Certification . . . . . . . 371--374 280 J. P. Chandler and 281 W. C. Harrison R201--SHELLSORT . . . . . . . . . . . . 373--374 282 E. F. Codd A Relational Model of Data for Large 283 Shared Data Banks . . . . . . . . . . . 377--387 284 285Communications of the ACM 286Volume 13, Number 7, July, 1970 287 288 C. A. Grant An interactive command generating 289 facility . . . . . . . . . . . . . . . . 403--406 290 M. A. Wilkes Conversational Access to a 2048-Word 291 Machine . . . . . . . . . . . . . . . . 407--414 292 W. M. Waite The mobile programming system: STAGE 2 415--421 293 Burton H. Bloom Space/Time Trade-offs in Hash Coding 294 with Allowable Errors . . . . . . . . . 422--426 295 E. G. Coffman, Jr. and 296 J. Eve File Structures Using Hashing Functions 427--432, 436 297 Gordon H. Bradley Algorithm and Bound for the Greatest 298 Common Divisor of $n$ Integers . . . . . 433--436 299 W. A. Woods Context-Sensitive Parsing . . . . . . . 437--445 300 K. A. Paciorek ACM Algorithm 385: Exponential Integral 301 ${E}_i(x)$ . . . . . . . . . . . . . . . 446--447 302 G. H. Bradley ACM Algorithm 386: Greatest Common 303 Divisor of $n$ Integers and Multipliers 447--448 304 K. Sattley and 305 R. Millstein Comments on a paper by Lowe . . . . . . 450--451 306 H. D. Baecker A note on data base deadlocks . . . . . 451--451 307 J. E. Pomeranz Note on an Anomaly in Paging . . . . . . 451--451 308 B. R. Hunt A Comment on Axiomatic Approaches to 309 Programming . . . . . . . . . . . . . . 452--452 310 311Communications of the ACM 312Volume 13, Number 8, August, 1970 313 314 N. R. Nielsen Allocation of Computer Resources. is 315 Pricing the Answer . . . . . . . . . . . 467--474 316 G. Nagy and 317 N. Tuong Normalization Techniques for Handprinted 318 Numerals . . . . . . . . . . . . . . . . 475--481 319 A. C. Day Full Table Quadratic Searching for 320 Scatter Storage . . . . . . . . . . . . 481--482 321 B. S. Brawn and 322 F. G. Gustavson and 323 E. S. Mankin Sorting in a Paging Environment . . . . 483--494 324 J. H. Saltzer and 325 J. W. Gintell The instrumentation of Multics . . . . . 495--500 326 J. D. Ichbiah and 327 S. P. Morse A technique for generating almost 328 optimal Floyd-Evans productions for 329 precedence grammars . . . . . . . . . . 501--508 330 K. Fielding ACM Algorithm 387: Function Minimization 331 and Linear Search . . . . . . . . . . . 509--510 332 H. Hubner and 333 H. Kremer and 334 K. O. Linn and 335 W. Schwering ACM Algorithm 388: Rademacher Function 510--511 336 H. Hubner and 337 H. Kremer and 338 K. O. Linn and 339 W. Schwering ACM Algorithm 389: Binary Ordered Walsh 340 Functions . . . . . . . . . . . . . . . 511--511 341 H. Hubner and 342 H. Kremer and 343 K. O. Linn and 344 W. Schwering ACM Algorithm 390: Sequency Ordered 345 Walsh Functions . . . . . . . . . . . . 511--512 (or 511--511??) 346 J. McKay ACM Algorithm 391: Unitary Symmetric 347 Polynomials . . . . . . . . . . . . . . 512--512 348 Anonymous Identification of States of the United 349 States (including the District of 350 Columbia) for information interchange 514--515 351 352Communications of the ACM 353Volume 13, Number 9, September, 1970 354 355 W. Jack Bouknight A Procedure for Generation of 356 Three-Dimensional Half-Toned Computer 357 Graphics Presentations . . . . . . . . . 527--536 358 G. Bracchi and 359 M. Somalvico Interactive Software System for 360 Computer-Aided Design. an Application to 361 Circuit Project . . . . . . . . . . . . 537--545 362 I. Hirschsohn AMESPLOT, a Higher Level Data Plotting 363 Software System . . . . . . . . . . . . 546--555 364 Cleve B. Moler and 365 Louis P. Solomon Integrating Square Roots . . . . . . . . 556--557 366 G. W. Kimble A Variation of the Goodman-Lance Method 367 for the Solution of Two-Point Boundary 368 Value Problems . . . . . . . . . . . . . 557--558 369 M. Wayne Wilson Optimal Starting Approximations for 370 Generating Square Root for Slow or No 371 Divide . . . . . . . . . . . . . . . . . 559--561 (or 559--560??) 372 L. W. Ehrlich Complex Matrix Inversion Versus Real . . 561--562 373 M. H. van Emden Increasing the Efficiency of Quicksort 563--567 (or 563--566??) 374 Robert R. Smith and 375 Dennis McCall ACM Algorithm 392: Systems of Hyperbolic 376 P.D.E. . . . . . . . . . . . . . . . . . 567--570 377 S. K. Abdali ACM Algorithm 393: Special Series 378 Summation with Arbitrary Precision . . . 570--570 379 R. B. Dial ACM Algorithm 394: Decision Table 380 Translation . . . . . . . . . . . . . . 571--573 (or 571--572??) 381 Leslie Lamport and 382 J. R. Bell Comment on Bell's Quadratic Quotient 383 Method for Hash Code Searching . . . . . 573--574 384 Z. Bavel On the Number of Automorphisms of a 385 Singly Generated Automaton . . . . . . . 574--575 386 387Communications of the ACM 388Volume 13, Number 10, October, 1970 389 390 W. A. Woods Transition Network Grammars for Natural 391 Language Analysis . . . . . . . . . . . 591--606 392 J. Earley and 393 H. Sturgis A formalism for translator interactions 607--617 394 G. W. Hill ACM Algorithm 395: Student's 395 $t$-Distribution . . . . . . . . . . . . 617--619 396 G. W. Hill ACM Algorithm 396: Student's 397 $t$-Quantiles . . . . . . . . . . . . . 619--620 398 S. K. Chang and 399 A. Gill ACM Algorithm 397: An Integer 400 Programming Problem . . . . . . . . . . 620--621 401 R. A. Stone ACM Algorithm 398: Tableless Date 402 Conversion . . . . . . . . . . . . . . . 621--621 403 J. J. Seppanen ACM Algorithm 399: Spanning Tree . . . . 621--622 404 G. C. Wallick ACM Algorithm 400: Modified Havie 405 Integration . . . . . . . . . . . . . . 622--624 406 R. Peto Remark on ``Algorithm 347 [M1]: An 407 Efficient Algorithm for Sorting with 408 Minimal Storage'' . . . . . . . . . . . 624 409 L. B. Smith The use of interactive graphics to solve 410 numerical problems . . . . . . . . . . . 625--634 411 412Communications of the ACM 413Volume 13, Number 11, November, 1970 414 415 P. LaFata and 416 J. B. Rosen An interactive display for approximation 417 by linear programming . . . . . . . . . 651--659 418 V. Y. Lum Multi-attribute retrieval with combined 419 indexes . . . . . . . . . . . . . . . . 660--665 420 C. J. Mifsud A multiple-precision division algorithm 666--668 421 K. Conrow and 422 R. G. Smith NEATER2: A PL/I Source Statement 423 Reformatter . . . . . . . . . . . . . . 669--675 424 James R. Bell and 425 Charles H. Kaman The Linear Quotient Hash Code . . . . . 675--677 426 C. J. Cheney A Nonrecursive List Compacting Algorithm 677--678 427 Anonymous Proposed American National Standard. 428 Recorded magnetic tape for information 429 interchange (1600 CPI, phase encoded) 679--685 430 Anonymous Proposed American National Standard. 431 Unrecorded magnetic tape for information 432 interchange (9 track-200 and 800 CPI, 433 NRZI and 1600 CPI, P.E.) . . . . . . . . 686--692 434 P. Bratley ACM Algorithm 401: An Improved Algorithm 435 to Produce Complex Primes . . . . . . . 693--693 436 M. H. van Emden ACM Algorithm 402: Increasing the 437 Efficiency of Quicksort . . . . . . . . 693--694 438 W. J. Wilson A generalized method for generating 439 argument/function values . . . . . . . . 696--697 440 J. R. Ehrman Correction to 'logical' arithmetic on 441 computers with two's complement binary 442 arithmetic . . . . . . . . . . . . . . . 697--698 443 A. Bernstein Comment on the working set model for 444 program behavior . . . . . . . . . . . . 698--699 445 J. Rokne Condition numbers of Pei matrices . . . 699--699 446 447Communications of the ACM 448Volume 13, Number 12, December, 1970 449 450 M. V. Mathews and 451 F. R. Moore GROOVE-A program to compose, store, and 452 edit functions of time . . . . . . . . . 715--721 453 James C. Tiernan An Efficient Search Algorithm to Find 454 the Elementary Circuits of a Graph . . . 722--726 455 C. Betourne and 456 J. Boulenger and 457 J. Ferrie and 458 C. Kaiser and 459 S. Krakowiak and 460 J. Mossiere Process management and resource sharing 461 in the multiaccess system ESOPE . . . . 727--733 462 H. L. Morgan An interrupt based organization for 463 management information systems . . . . . 734--739 464 R. J. Thompson Improving round-off in Runge-Kutta 465 computations with Gill's method . . . . 739--740 466 S. C. Shapiro The list set generator: a construct for 467 evaluating set expressions . . . . . . . 741--744 468 N. A. Black Optimum Merging from Mass Storage . . . 745--749 469 G. W. Stewart Errata: ACM Algorithm 384: Eigenvalues 470 and Eigenvectors of a Real Symmetric 471 Matrix [F2] . . . . . . . . . . . . . . 750--750 472 E. A. Fuchs and 473 P. E. Jackson Estimates of Distributions of Random 474 Variables for Certain Computer 475 Communications Traffic Models . . . . . 752--757 476 C. C. Pinter On decomposing a Boolean function and 477 simplifying the components separately 758--758 478 W. J. Raduchel Efficient handling of binary data . . . 758--759 479 Robert A. Wagner Finiteness Assumptions and Intellectual 480 Isolation of Computer Scientists . . . . 759--760 481 482Communications of the ACM 483Volume 12, Number 1, January, 1971 484 485 E. Lowry and 486 C. W. Medlock Object Code Optimization . . . . . . . . 13--22 487 Carl Hammer Signature Simulation and Certain 488 Cryptographic Codes . . . . . . . . . . 3--14 489 A. Klinger Pattern width at a given angle . . . . . 15--20 490 Shi-Kuo Chang The Reconstruction of Binary Patterns 491 from Their Projections . . . . . . . . . 21--25 492 G. Bracchi and 493 D. Ferrari Language for Treating Geometric Patterns 494 in a Two-Dimensional Space . . . . . . . 26--32 495 R. A. Broucke Construction of rational and negative 496 powers of a formal series . . . . . . . 32--35 497 R. C. Holt Comments on Prevention of System 498 Deadlocks . . . . . . . . . . . . . . . 36--38 499 C. A. R. Hoare Proof of a Program: FIND . . . . . . . . 39--45 500 L. G. Proll Further evidence for the analysis of 501 algorithms for the zero-one programming 502 problem . . . . . . . . . . . . . . . . 46--47 503 M. W. Coleman and 504 M. S. Taylor ACM Algorithm 403: Circular Integer 505 Partitioning . . . . . . . . . . . . . . 48--48 506 C. W. Lucas, Jr. and 507 C. W. Terrill ACM Algorithm 404: Complex Gamma 508 Function . . . . . . . . . . . . . . . . 48--49 (or 48--48??) 509 K. A. Redish Comment on London's Certification of 510 Algorithm 245 . . . . . . . . . . . . . 50--51 511 S. L. Pollack Comment on the conversion of decision 512 tables to computer programs . . . . . . 52--52 513 514Communications of the ACM 515Volume 14, Number 2, February, 1971 516 517 K. Schwayder Conversion of Limited-Entry Decision 518 Tables to Computer Programs. a Proposed 519 Modification to Pollack's Algorithm . . 69--73 520 K. Shwayder Conversion of limited-entry decision 521 tables to computer programs-a proposed 522 modification to Pollack's algorithm . . 69--73 523 A. J. Bernstein and 524 J. C. Sharp A policy-driven scheduler for a 525 time-sharing system . . . . . . . . . . 74--78 526 N. R. Nielsen An analysis of some time-sharing 527 techniques . . . . . . . . . . . . . . . 79--90 528 J. R. Slagle and 529 C. D. Farrell Experiments in Automatic Learning for a 530 Multipurpose Heuristic Program . . . . . 91--99 (or 91--98??) 531 H. Hurwitz, Jr. On the Probability Distribution of the 532 Values of Binary Trees . . . . . . . . . 99--102 533 J. R. Slagle and 534 R. C. T. Lee Application of Game Tree Searching 535 Techniques to Sequential Pattern 536 Recognition . . . . . . . . . . . . . . 103--110 537 J. Rokne and 538 P. Lancaster Complex Interval Arithmetic . . . . . . 111--112 539 A. M. Dell and 540 R. L. Weil and 541 G. L. Thompson ACM Algorithm 405: Roots of Matrix 542 Pencils: The Generalized Eigenvalue 543 Problem . . . . . . . . . . . . . . . . 113--117 544 545Communications of the ACM 546Volume 14, Number 3, March, 1971 547 548 A. M. Noll Scanned-Display Computer Graphics . . . 143--150 549 Z. Manna and 550 R. J. Waldinger Toward Automatic Program Synthesis . . . 151--165 551 W. K. Winters Scheduling Algorithm for a Computer 552 Assisted Registration System . . . . . . 166--171 553 J. G. Williams Storage Utilization in a Memory 554 Hierarchy When Storage Assignment is 555 Performed by a Hashing Algorithm . . . . 172--175 556 C. W. Gear The Automatic Integration of Ordinary 557 Differential Equations . . . . . . . . . 176--179 558 J. A. Howell ACM Algorithm 406: Exact Solution of 559 Linear Equations Using Residue 560 Arithmetic . . . . . . . . . . . . . . . 180--184 561 C. W. Gear ACM Algorithm 407: DIFSUB for Solution 562 of Ordinary Differential Equations . . . 185--190 563 564Communications of the ACM 565Volume 14, Number 4, April, 1971 566 567 N. Wirth Program Development by Stepwise 568 Refinement . . . . . . . . . . . . . . . 221--227 569 V. Y. Lum and 570 P. S. T. Yuen and 571 M. Dodd Key-to-Address Transform Techniques: A 572 Fundamental Performance Study on Large 573 Existing Formatted Files . . . . . . . . 228--239 574 A. B. Tucker and 575 M. J. Flynn Dynamic Microprogramming. Processor 576 Organization and Programming . . . . . . 240--250 577 P. A. Talbot and 578 J. W. Carr and 579 R. R. Coulter, Jr. and 580 R. C. Hwang Animator: an on-line two-dimensional 581 film animation system . . . . . . . . . 251--259 582 M. L. Stein and 583 W. D. Munro On Complement Division . . . . . . . . . 260--264 584 J. M. McNamee ACM Algorithm 408: A Sparse Matrix 585 Package (Part I) . . . . . . . . . . . . 265--273 586 587Communications of the ACM 588Volume 14, Number 5, May, 1971 589 590 T. William Olle (Chairman) and 591 Codasyl Systems Committee Introduction to `Feature analysis of 592 generalized data base management 593 systems' . . . . . . . . . . . . . . . . 308--318 594 N. R. Nielsen The merit of regional computing networks 319--326 595 P. Krolak and 596 W. Felts and 597 G. Marble A Man-Machine Approach Toward Solving 598 the Traveling Salesman Problem . . . . . 327--334 599 Ugo Montanari On the optimal detection of curves in 600 noisy pictures . . . . . . . . . . . . . 335--345 601 D. L. Richards How to Keep the Addresses Short . . . . 346--349 602 R. R. Fenichel On Implementation of Label Variables . . 349--350 603 James H. Morris, Jr. Another Recursion Induction Principle 351--354 604 H. Schmitt ACM Algorithm 409: Discrete Chebychev 605 Curve Fit . . . . . . . . . . . . . . . 355--356 606 J. M. Chambers ACM Algorithm 410: Partial Sorting [M1] 357--358 607 608Communications of the ACM 609Volume 14, Number 6, June, 1971 610 611 Kazuaki Harada Generation of rosary permutations 612 expressed in Hamiltonian circuits . . . 373--379 613 J. D. Foley An approach to the optimum design of 614 computer graphics systems . . . . . . . 380--390 615 S. Amarel Computer Science: A Conceptual Framework 616 for Curriculum Planning . . . . . . . . 391--401 617 W. E. Bosarge, Jr. and 618 O. G. Johnson Numerical properties of the Ritz-Trefftz 619 algorithm for optimal control . . . . . 402--406 620 H. Tim Gladwin A Note on Compiling Fixed Point Binary 621 Multiplications . . . . . . . . . . . . 407--408 622 A. G. Fraser On the Meaning of Names in Programming 623 Systems . . . . . . . . . . . . . . . . 409--416 624 R. J. Walker Binary summation . . . . . . . . . . . . 417--417 625 M. Zelkowitz Interrupt driven programming . . . . . . 417--418 626 627Communications of the ACM 628Volume 14, Number 7, July, 1971 629 630 J. L. McKenney and 631 F. M. Tonge The State of Computer-Oriented Curricula 632 in Business Schools 1970 . . . . . . . . 443--448 633 A. J. Bernstein A programmer training project . . . . . 449--452 634 Franklin L. DeRemer Simple LR(k) grammars . . . . . . . . . 453--460 635 Terrence W. Pratt and 636 Daniel P. Friedman A Language Extension for Graph 637 Processing, and Its Formal Semantics . . 460--467 (or 461--467??) 638 Keith Paton An algorithm for the blocks and cut 639 nodes of a graph . . . . . . . . . . . . 468--475 640 D. E. Ferguson Buffer Allocation in Merge-Sorting . . . 476--478 641 C. V. Ramamoorthy and 642 M. J. Gonzalez Subexpression ordering in the execution 643 of arithmetic expressions . . . . . . . 479--485 644 D. G. McVitie and 645 L. B. Wilson The Stable Marriage Problem . . . . . . 486--490 646 D. G. McVitie and 647 L. B. Wilson ACM Algorithm 411: Three Procedures for 648 the Stable Marriage Problem . . . . . . 491--492 649 J. \vCermak ACM Algorithm 412: Graph Plotter . . . . 492--493 650 651Communications of the ACM 652Volume 14, Number 8, August, 1971 653 654 Anonymous Papers from the 2nd symposium on 655 symbolic and algebraic manipulation . . ?? 656 Anthony C. Hearn Applications of Symbolic Manipulation in 657 Theoretical Physics . . . . . . . . . . 511--516 658 A. D. Hall, Jr. The Altran system for rational function 659 manipulation --- a survey . . . . . . . 517--521 660 Robert R. Fenichel List Tracing in Systems Allowing 661 Multiple Cell Types . . . . . . . . . . 522--526 662 J. Moses Algebraic Simplification: A Guide for 663 the Perplexed . . . . . . . . . . . . . 527--537 664 W. H. Jefferys Automatic algebraic manipulation in 665 celestial mechanics . . . . . . . . . . 538--541 666 D. Barton and 667 J. P. Fitch General relativity and the application 668 of algebraic manipulative systems . . . 542--547 669 Joel Moses Symbolic Integration: The Stormy Decade 548--560 670 671Communications of the ACM 672Volume 14, Number 9, September, 1971 673 674 Daniel Teichroew Education Related to the Use of 675 Computers in Organizations . . . . . . . 573--588 676 Sadahiro Isoda and 677 Eiichi Goto and 678 Izumi Kimura An Efficient Bit Table Technique for 679 Dynamic Storage Allocation of $2^n$-word 680 Blocks . . . . . . . . . . . . . . . . . 589--592 681 Keith Paton Corrigendum: ``An algorithm for the 682 blocks and cutnodes of a graph'' . . . . 592--592 683 Eugene Wong and 684 T. C. Chiang Canonical Structure in Attribute Based 685 File Organization . . . . . . . . . . . 593--597 686 David L. Phillips A note on best one-sided approximations 598--600 687 W. Liniger A stopping criterion for the 688 Newton-Raphson method in implicit 689 multistep integration algorithms for 690 nonlinear systems of ordinary 691 differential equations . . . . . . . . . 600--601 692 Ivan Flores and 693 George Madpis Average Binary Search Length for Dense 694 Ordered Lists . . . . . . . . . . . . . 602--603 695 R. R. Fenichel Comment on Cheney's List-Compaction 696 Algorithm . . . . . . . . . . . . . . . 603--604 697 698Communications of the ACM 699Volume 14, Number 10, October, 1971 700 701 Jay Earley Toward an Understanding of Data 702 Structures . . . . . . . . . . . . . . . 617--627 703 ANSI Subcommittee X3J3 Clarification of Fortran Standards --- 704 Second Report . . . . . . . . . . . . . 628--642 705 A. E. Oldehoeft and 706 S. D. Conte Experiments with an automated 707 instructional system for numerical 708 methods . . . . . . . . . . . . . . . . 643--650 709 W. M. Newman Display procedures . . . . . . . . . . . 651--660 710 A. G. Nemeth and 711 P. D. Rovner User program measurement in a 712 time-shared environment . . . . . . . . 661--666 713 P. J. Courtois and 714 F. Heymans and 715 D. L. Parnas Concurrent Control with `Readers' and 716 `Writers' . . . . . . . . . . . . . . . 667--668 717 J. N. Lyness and 718 G. Sande ACM Algorithm 413: ENTCAF and ENTCRE: 719 Evaluation of Normalized Taylor 720 Coefficients of an Analytic Function 721 (C5) . . . . . . . . . . . . . . . . . . 669--675 722 723Communications of the ACM 724Volume 14, Number 11, November, 1971 725 726 P. Branquart and 727 J. Lewi and 728 M. Sintzoff and 729 P. L. Wodon The composition of semantics in Algol 68 697--708 730 J. W. Hamblen Using computers in higher education: 731 past recommendations, status, and needs 709--712 732 D. L. Shell Optimizing the Polyphase Sort . . . . . 713--719 733 I. Aramaki and 734 T. Kawabata and 735 K. Arimoto Automation of etching-pattern layout . . 720--730 736 Michael A. Malcolm On Accurate Floating-Point Summation . . 731--736 737 G. H. Golub and 738 L. B. Smith ACM Algorithm 414: Chebyshev 739 Approximation of Continuous Functions by 740 a Chebyshev System of Functions . . . . 737--746 741 742Communications of the ACM 743Volume 14, Number 12, December, 1971 744 745 R. Gordon and 746 G. T. Herman Reconstruction of Pictures from Their 747 Projections . . . . . . . . . . . . . . 759--768 748 E. L. Amidon and 749 G. S. Akin Algorithmic Selection of the Best Method 750 for Compressing Map Data Strings . . . . 769--774 751 James K. Mullin Retrieval-Update Speed Trade-offs Using 752 Combined Indexes . . . . . . . . . . . . 775--776 753 M. C. Harrison Implementation of the Substring Test by 754 Hashing . . . . . . . . . . . . . . . . 777--779 755 W. A. Wulf and 756 D. B. Russell and 757 A. N. Habermann BLISS: A language for systems 758 programming . . . . . . . . . . . . . . 780--790 759 A. Rochfeld New LISP Techniques for a Paging 760 Environment . . . . . . . . . . . . . . 791--795 761 J. W. Blumberg and 762 C. R. Foulk A note on `a modification of Nordsieck's 763 method using an ``off-step'' point' . . 796--796 764 Sven-\AAke A. Gustafson Rapid Computation of General 765 Interpolation Formulas and Mechanical 766 Quadrature Rules . . . . . . . . . . . . 797--801 767 Fran\ccois Bourgeois and 768 Jean-Claude Lassalle An extension of the Munkres algorithm 769 for the assignment problem to 770 rectangular matrices . . . . . . . . . . 802--804 771 F. Bourgeois and 772 J. C. Lassalle ACM Algorithm 415: Algorithm for the 773 Assignment Problem (Rectangular 774 Matrices) . . . . . . . . . . . . . . . 805--806 775 Sven-\AAke Gustafson ACM Algorithm 416: Rapid Computation of 776 Coefficients of Interpolation Formulas 777 [E1] . . . . . . . . . . . . . . . . . . 806--807 778 Sven-\AAke Gustafson ACM Algorithm 417: Rapid Computation of 779 Weights of Interpolatory Quadrature 780 Rules [D1] . . . . . . . . . . . . . . . 807--807 781 782Communications of the ACM 783Volume 18, Number 1, January, 1971 784 785 A. V. Aho and 786 P. J. Denning and 787 J. D. Ullman Principles of optimal page replacement 80--93 788 789Communications of the ACM 790Volume 5, Number 6, June, 1972 791 792 S. C. Johnson and 793 B. W. Kernighan Remark on ``CACM Algorithm 397'' . . . . 469 794 795Communications of the ACM 796Volume 8, Number 9, September, 1972 797 798 R. H. Bartels and 799 G. W. Stewart Algorithm 432: The Solution of the 800 Matrix Equation $AX -+BX = C$ . . . . . 820--826 801 802Communications of the ACM 803Volume 15, Number 1, January, 1972 804 805 A. M. Lesk Pictorial pattern recognition and the 806 phase problem of X-ray crystallography 3--6 807 S. Levialdi On Shrinking Binary Picture Patterns . . 7--10 808 R. O. Duda and 809 P. E. Hart Use of the Hough transformation to 810 detect lines and curves in pictures . . 11--15 811 E. T. Irons and 812 F. M. Djorup A CRT editing system . . . . . . . . . . 16--20 813 T. A. Dwyer Teacher/student authored CAI using the 814 NEWBASIC system . . . . . . . . . . . . 21--28 815 Donald L. Shell Corrigendum: ``Optimizing the Polyphase 816 Sort'' . . . . . . . . . . . . . . . . . 28--28 817 G. I. McCalla and 818 J. R. Sampson MUSE: A Model to Understand Simple 819 English . . . . . . . . . . . . . . . . 29--40 820 R. I. Shrager Quadratic programming for nonlinear 821 regression . . . . . . . . . . . . . . . 41--45 822 H. E. Salzer Ordering 823 +or-f(+or-f(+or-f(\ldots+or-f(x)\ldots))) when f(x) is positive monotonic 45--46 824 B. Einarsson ACM Algorithm 418: Calculation of 825 Fourier Integrals . . . . . . . . . . . 47--48 826 827Communications of the ACM 828Volume 15, Number 2, February, 1972 829 830 David Pager A Proposal for a Computer-Based 831 Interactive Scientific Community . . . . 71--75 832 C. M. Eastman Preliminary report on a system for 833 general space planning . . . . . . . . . 76--87 834 W. A. Martin and 835 D. N. Ness Optimizing Binary Trees Grown with a 836 Storing Algorithm . . . . . . . . . . . 88--93 837 A. E. Oldehoeft and 838 M. H. Halstead Maximum computing power and cost factors 839 in the centralization problem . . . . . 94--96 840 M. A. Jenkins and 841 J. F. Traub ACM Algorithm 419: Zeros of a Complex 842 Polynomial . . . . . . . . . . . . . . . 97--99 843 H. Williamson ACM Algorithm 420: Hidden-Line Plotting 844 Program . . . . . . . . . . . . . . . . 100--103 845 J. A. Moorer Music and computer composition . . . . . 104--113 846 Ivan Flores and 847 George Madpis Corrigendum: ``Average Binary Search 848 Length for Dense Ordered Lists'' . . . . 113--113 849 Richard Gordon and 850 Gabor T. Herman Corrigendum: ``Reconstruction of 851 Pictures from Their Projections'' . . . 113--113 852 853Communications of the ACM 854Volume 15, Number 3, March, 1972 855 856 Anonymous Papers from the 3rd ACM symposium on 857 operating systems principles . . . . . . ?? 858 D. G. Bobrow and 859 J. D. Burchfiel and 860 D. L. Murphy and 861 R. S. Tomlinson TENEX, A Paged Time-Sharing System for 862 the PDP-10 . . . . . . . . . . . . . . . 135--143 863 B. H. Liskov The Design of the Venus Operating System 144--149 864 R. Stockton Gains An operating system based on the concept 865 of a supervisory computer . . . . . . . 150--156 866 Michael D. Schroeder and 867 Jerome H. Saltzer A Hardware Architecture for Implementing 868 Protection Rings . . . . . . . . . . . . 157--170 869 A. Nico Habermann Synchronization of Communicating 870 Processes . . . . . . . . . . . . . . . 171--176 871 Toby J. Teorey and 872 Tad B. Pinkerton A Comparative Analysis of Disk 873 Scheduling Policies . . . . . . . . . . 177--184 874 E. G. Coffman, Jr. and 875 T. A. Ryan, Jr. A study of storage partitioning using a 876 mathematical model of locality . . . . . 185--190 877 Peter J. Denning and 878 Stuart C. Schwartz Properties of the working-set model . . 191--198 879 880Communications of the ACM 881Volume 15, Number 4, April, 1972 882 883 R. W. Conway and 884 W. L. Maxwell and 885 H. L. Morgan On the Implementation of Security 886 Measures in Information Systems . . . . 211--220 887 D. C. Walden A system for interprocess communication 888 in a resource sharing computer network 221--230 889 N. M. Herbst and 890 P. M. Will An experimental laboratory for pattern 891 recognition and signal processing . . . 231--244 892 Yutaka Matsushita Hidden lines elimination for a rotating 893 object . . . . . . . . . . . . . . . . . 245--252 894 S. M. Chase An implemented graph algorithm for 895 winning Shannon Switching Games . . . . 253--256 896 E. Horowitz and 897 H. L. Morgan and 898 A. C. Shaw Computers and Society: A Proposed Course 899 for Computer Scientists . . . . . . . . 257--261 900 H. Kuki Complex gamma function with error 901 control . . . . . . . . . . . . . . . . 262--267 902 C. B. Moler Matrix Computations with Fortran and 903 Paging . . . . . . . . . . . . . . . . . 268--270 904 Hirondo Kuki ACM Algorithm 421: Complex Gamma 905 Function with Error Control . . . . . . 271--272 906 V. K. M. Whitney ACM Algorithm 422: Minimal Spanning Tree 273--274 907 C. B. Moler ACM Algorithm 423: Linear Equation 908 Solver . . . . . . . . . . . . . . . . . 274--274 909 D. C. Walden A Note on Cheney's Nonrecursive 910 List-Compacting Algorithm . . . . . . . 275--275 911 T. C. Hu A Comment on the Double-Chained Tree . . 276--276 912 913Communications of the ACM 914Volume 15, Number 5, May, 1972 915 916 James K. Mullin An Improved Indexed-Sequential Access 917 Method Using Hashed Overflow . . . . . . 301--307 918 A. Bensoussan and 919 C. T. Clingen and 920 R. C. Daley The Multics Virtual Memory: Concepts and 921 Design . . . . . . . . . . . . . . . . . 308--318 922 R. D. Christman MUX, a simple approach to on-line 923 computing . . . . . . . . . . . . . . . 319--329 924 David L. Parnas A technique for software module 925 specification with examples . . . . . . 330--336 926 W. Morven Gentleman Implementing Clenshaw-Curtis quadrature. 927 I. Methodology and experience . . . . . 337--342 928 W. Morvin Gentleman Implementing Clenshaw-Curtis quadrature. 929 II. Computing the cosine transformation 343--346 930 D. Greenspan and 931 D. Schultz Fast finite-difference solution of 932 biharmonic problems . . . . . . . . . . 347--350 933 C. B. Dunham Minimax nonlinear approximation by 934 approximation on subsets . . . . . . . . 351--351 935 Richard Harter The Optimality of Winograd's Formula . . 352--352 936 W. M. Gentleman ACM Algorithm 424: Clenshaw-Curtis 937 Quadrature . . . . . . . . . . . . . . . 353--355 938 R. L. Hurst and 939 R. E. Knop ACM Algorithm 425: Generation of Random 940 Correlated Normal Variables . . . . . . 355--357 941 C. Bron ACM Algorithm 426: Merge Sort Algorithm 357--358 942 P. Linz ACM Algorithm 427: Fourier Cosine 943 Integral . . . . . . . . . . . . . . . . 358--360 944 J. M. Yohe ACM Algorithm 428: Hu-Tucker Minimum 945 Redundancy Alphabetic Coding Method . . 360--362 946 R. L. Ashenhurst A report of the ACM curriculum committee 947 on computer education for management. 948 Curriculum recommendations for graduate 949 professional programs in information 950 systems . . . . . . . . . . . . . . . . 363--398 951 952Communications of the ACM 953Volume 15, Number 6, June, 1972 954 955 J. Blatny and 956 S. R. Clark and 957 T. A. Rourke On the optimization of performance of 958 time-sharing systems by simulation . . . 411--420 959 T. R. Spacek A proposal to establish a pseudo virtual 960 memory via writable overlays . . . . . . 421--426 961 P. Gilbert and 962 W. J. Chandler Interference between Communicating 963 Parallel Processes . . . . . . . . . . . 427--437 964 J. F. Gimpel Blocks-a new datatype for SNOBOL 4 . . . 438--447 965 David F. Martin A Boolean matrix method for the 966 computation of linear precedence 967 functions . . . . . . . . . . . . . . . 448--454 968 Robert T. O'Reagan Computer Assigned Codes from Verbal 969 Responses . . . . . . . . . . . . . . . 455--459 970 K. Iguchi A starting method for solving nonlinear 971 Volterra integral equations of the 972 second kind . . . . . . . . . . . . . . 460--461 973 I. Pohl A Sorting Problem and Its Complexity . . 462--464 974 K. S. Kolbig Certification of algorithm 363 (complex 975 error function) . . . . . . . . . . . . 465--466 976 H. Niessner Remark on algorithm 343 (Eigenvalues and 977 eigenvectors of a real general matrix) 466--466 978 L. G. Proll Remark on ``ACM Algorithm 370 (General 979 random number generator) [G5]'' . . . . 467--468 980 G. F. Schrack Remark on algorithm 381 (Random vectors 981 uniform in solid angle) . . . . . . . . 468--468 982 A. H. J. Sale Remark on algorithm 393 (Special series 983 summation with arbitrary precision) . . 468--469 984 B. Einarsson Remark on algorithm 418 (Calculation of 985 Fourier integrals) . . . . . . . . . . . 469--469 986 S. C. Johnson and 987 B. W. Kernighan Remark on algorithm 397 (An integer 988 programming problem) . . . . . . . . . . 469--469 989 Abraham Kandel Computer Science --- A Vicious Circle 470--471 990 E. B. Koffman Individualizing instruction in a 991 generative CAI tutor . . . . . . . . . . 472--473 992 E. N. Houstis and 993 W. F. Mitchell and 994 J. R. Rice ACM Algorithm 438: Product Type 995 Two-point Gauss-Legendre-Simpson's 996 Integration . . . . . . . . . . . . . . 1071 997 998Communications of the ACM 999Volume 15, Number 7, July, 1972 1000 1001 Lee Revens The first twenty-five years ACM 1002 1947--1962 . . . . . . . . . . . . . . . 485--490 1003 Eric A. Weiss Publications in computing: an informal 1004 review . . . . . . . . . . . . . . . . . 491--497 1005 A. P. Ershov Aesthetics and the Human Factor in 1006 Programming . . . . . . . . . . . . . . 501--505 1007 Anonymous As the industry sees it . . . . . . . . 506--517 1008 Michael A. Arbib Toward an Automata Theory of Brains . . 521--527 1009 Zohar Manna and 1010 Jean Vuillemin Fixpoint Approach to the Theory of 1011 Computation . . . . . . . . . . . . . . 528--536 1012 J. F. Traub Numerical Mathematics and Computer 1013 Science . . . . . . . . . . . . . . . . 537--541 1014 David F. Shanno and 1015 Roman L. Weil Management science: a view from 1016 nonlinear programming . . . . . . . . . 542--549 1017 Joel Moses Toward a General Theory of Special 1018 Functions . . . . . . . . . . . . . . . 550--556 (or 550--554??) 1019 C. C. Foster A view of computer architecture . . . . 557--565 1020 A. G. Fraser On the interface between computers and 1021 data communications systems . . . . . . 566--573 1022 Per Brinch Hansen Structured Multiprogramming . . . . . . 574--578 1023 W. C. Lynch Operating system performance . . . . . . 579--585 1024 S. R. Kimbleton The role of computer system models in 1025 performance evaluation . . . . . . . . . 586--590 1026 Saul Rosen Programming Systems and Languages 1027 (1965--1975) . . . . . . . . . . . . . . 591--600 1028 Jean E. Sammet Programming Languages: History and 1029 Future . . . . . . . . . . . . . . . . . 601--610 1030 L. D. Fosdick The production of better mathematical 1031 software . . . . . . . . . . . . . . . . 611--617 1032 D. G. Bobrow Requirements for Advanced Programming 1033 Systems for List Processing . . . . . . 618--627 1034 Charles W. Bachman The Evolution of Storage Structures . . 628--634 1035 J. R. Rice On the present and future of scientific 1036 computation . . . . . . . . . . . . . . 637--639 1037 Robert I. Benjamin A generational perspective of 1038 information system development . . . . . 640--643 1039 S. Y. Sedelow Language analysis in the humanities . . 644--647 1040 K. L. Zinn Computers in the instructional process: 1041 directions for research and development 648--651 1042 G. M. Sturman Computers and urban society . . . . . . 652--657 1043 G. Salton Dynamic document processing . . . . . . 658--668 1044 Donald E. Knuth Ancient Babylonian algorithms . . . . . 671--677 1045 F. L. Bauer and 1046 H. Wossner and 1047 Konrad Zuse The ``Plankalkul'' of Konrad Zuse: a 1048 forerunner of today's programming 1049 languages. . . . . . . . . . . . . . . . 678--685 1050 Richard E. Sprague A Western View of Computer History . . . 686--692 1051 Franz L. Alt Archaeology of computers --- 1052 reminiscences, 1945--1947 . . . . . . . 693--694 1053 A. Borodin and 1054 C. C. Gotlieb Computers and employment . . . . . . . . 695--702 1055 1056Communications of the ACM 1057Volume 15, Number 8, August, 1972 1058 1059 John G. Herriot In memory of George E. Forsythe . . . . 719--720 1060 Donald E. Knuth George Forsythe and the development of 1061 Computer Science . . . . . . . . . . . . 721--726 1062 David Crowe Generating parsers for affix grammars. 1063 Collection of articles in honor of 1064 George E. Forsythe (ACM Student 1065 Competition Award Papers) . . . . . . . 728--734 1066 Robert E. Helbig and 1067 Patrick K. Orr and 1068 Robert R. Roediger Political Redistricting by Computer . . 735--741 1069 Arthur J. Benjamin Extensible Editor for a Small Machine 1070 with Disk Storage . . . . . . . . . . . 742--747 1071 Robert F. Rosin and 1072 Gideon Frieder and 1073 Richard H. Eckhouse, Jr. Environment for Research in 1074 Microprogramming and Emulation . . . . . 748--760 1075 P. H. Oden and 1076 G. S. Shedler A Model of Memory Contention in a Paging 1077 Machine . . . . . . . . . . . . . . . . 761--771 1078 H. J. Bernstein and 1079 H. T. Gladwin Compiling fixed-point multiplications 772--772 1080 W. L. van der Poel Comment on the composition of semantics 1081 in Algol 68 . . . . . . . . . . . . . . 772--772 1082 James H. Morris, Jr. A Bonus from van Wijngaarden's Device 773--773 1083 P. R. Jones Comment on average binary search length 774--774 1084 Ronald C. Read and 1085 K. Harada A note on the generation of rosary 1086 permutations. With a response by K. 1087 Harada . . . . . . . . . . . . . . . . . 775--775 1088 W. Squire ACM Algorithm 429: Localization of the 1089 Roots of a Polynomial . . . . . . . . . 776--777 1090 P. W. Purdom Jr. and 1091 E. F. Moore ACM Algorithm 430: Immediate 1092 Predominators in a Directed Graph . . . 777--778 1093 1094Communications of the ACM 1095Volume 15, Number 9, September, 1972 1096 1097 K. N. Levitt and 1098 W. H. Kautz Cellular Arrays for the Solution of 1099 Graph Problems . . . . . . . . . . . . . 789--801 1100 Sakti P. Ghosh File Organization --- The Consecutive 1101 Retrieval Property . . . . . . . . . . . 802--808 1102 M. Mor and 1103 T. Lamdan A New Approach to Automatic Scanning of 1104 Contour Maps . . . . . . . . . . . . . . 809--812 1105 Paul L. Richman Automatic Error Analysis for Determining 1106 Precision . . . . . . . . . . . . . . . 813--817 1107 A. Ravindran ACM Algorithm 431: A Computer Routine 1108 for Quadratic and Linear Programming 1109 Problems . . . . . . . . . . . . . . . . 818--820 1110 R. H. Bartels and 1111 G. W. Stewart ACM Algorithm 432: Solution of the 1112 Matrix Equation 1113 ${\bf{A}}x+x{\bf{B}}={\bf{C}}$ . . . . . 820--826 1114 E. S. Deutsch Thinning Algorithms on Rectangular, 1115 Hexagonal, and Triangular Arrays . . . . 827--837 1116 J. Gregory A Comparison of Floating Point Summation 1117 Methods . . . . . . . . . . . . . . . . 838--838 1118 Hatem M. Khalil The eigenproblem of block tridiagonal 1119 matrices . . . . . . . . . . . . . . . . 839--839 1120 D. L. Parnas and 1121 A. N. Habermann and 1122 R. C. Holt Comment on Deadlock Prevention Method 840--841 1123 R. Rubinstein and 1124 J. Feldman A controller for a Braille terminal . . 841--842 1125 K. C. Tan On Foster's Information Storage and 1126 Retrieval Using AVL Trees . . . . . . . 843--843 1127 1128Communications of the ACM 1129Volume 15, Number 10, October, 1972 1130 1131 E. W. Dijkstra The Humble Programmer . . . . . . . . . 859--866 1132 James B. Morris Demand Paging Through Utilization of 1133 Working Sets on the Maniac II . . . . . 867--872 1134 J. H. Ahrens and 1135 U. Dieter Computer Methods for Sampling from the 1136 Exponential and Normal Distributions . . 873--882 1137 Richard J. Hanson Integral Equations of Immunology . . . . 883--890 1138 Robert F. Simmons and 1139 Jonathan Slocum Generating English Discourse from 1140 Semantic Networks . . . . . . . . . . . 891--905 1141 Gert Dathe Conversion of Decision Tables by Rule 1142 Mask Method without Rule Mask . . . . . 906--909 1143 W. D. Frazer and 1144 C. K. Wong Sorting by Natural Selection . . . . . . 910--913 1145 A. P. Ershov Corrigendum: ``Aesthetics and the Human 1146 Factor in Programming'' . . . . . . . . 913--913 1147 H. Akima ACM Algorithm 433: Interpolation and 1148 Smooth Curve Fitting Based on Local 1149 Procedures . . . . . . . . . . . . . . . 914--918 1150 1151Communications of the ACM 1152Volume 15, Number 11, November, 1972 1153 1154 Phyllis Fox Comparative Study of Computer Programs 1155 for Integrating Differential Equations 941--948 1156 Michael A. Malcolm Algorithms to Reveal Properties of 1157 Floating-Point Arithmetic . . . . . . . 949--951 1158 Merrell L. Patrick A Highly Parallel Algorithm for 1159 Approximating All Zeros of a Polynomial 1160 with Only Real Zeros . . . . . . . . . . 952--955 1161 Henry F. Ledgard Model for Type Checking --- with an 1162 Application to Algol 60 . . . . . . . . 956--966 1163 Peter Henderson Derived Semantics for Some Programming 1164 Language Constructs . . . . . . . . . . 967--973 1165 M. Verhelst Conversion of Limited-Entry Decision 1166 Tables to Optimal and Near-Optimal 1167 Flowcharts: Two New Algorithms . . . . . 974--980 1168 H. D. Baecker Garbage Collection for Virtual Memory 1169 Computer Systems . . . . . . . . . . . . 981--986 1170 John S. Ramberg and 1171 Bruce W. Schmeiser Approximate Method for Generating 1172 Symmetric Random Variables . . . . . . . 987--990 1173 D. L. March ACM Algorithm 434: Exact Probabilities 1174 for ${R\times{C}}$ Contingency Tables 991--992 1175 W. Fullerton ACM Algorithm 435: Modified Incomplete 1176 Gamma Function . . . . . . . . . . . . . 993--995 1177 V. Y. Lum and 1178 P. S. T. Yuen Additional results on key-to-address 1179 transform techniques: a fundamental 1180 performance study on large existing 1181 formatted files . . . . . . . . . . . . 996--997 1182 S. Kennedy A note on optimal doubly-chained trees 997--998 1183 Murray A. Eisenberg and 1184 Michael R. McGuire Further comments on Dijkstra's 1185 concurrent programming control problem 999--999 1186 S. W. Smoliar Comments on Moorer's Music and computer 1187 composition . . . . . . . . . . . . . . 1000--1001 1188 1189Communications of the ACM 1190Volume 15, Number 12, December, 1972 1191 1192 J. Richard Phillips and 1193 H. C. Adams Dynamic Partitioning for Array Languages 1023--1032 1194 R. Bayer and 1195 C. Witzgall Index Ranges for Matrix Calculi . . . . 1033--1039 1196 Jay Earley and 1197 Paul Caizergues Method for Incrementally Compiling 1198 Languages with Nested Statement 1199 Structure . . . . . . . . . . . . . . . 1040--1044 1200 Fabrizio Luccio Weighted Increment Linear Search for 1201 Scatter Tables . . . . . . . . . . . . . 1045--1047 1202 D. R. Barr and 1203 N. L. Slezak A comparison of multivariate normal 1204 generators . . . . . . . . . . . . . . . 1048--1049 1205 John Moore and 1206 Prentiss Robinson New Method for the Solution of the 1207 Cauchy Problem for Parabolic Equations 1050--1052 1208 D. L. Parnas On the Criteria to Be Used in 1209 Decomposing Systems into Modules . . . . 1053--1058 1210 P. J. Brown Levels of Language for Portable Software 1059--1062 1211 Stephen Sherman and 1212 Forest Baskett, III and 1213 J. C. Browne Trace-Driven Modeling and Analysis of 1214 CPU Scheduling in a Multiprogramming 1215 System . . . . . . . . . . . . . . . . . 1063--1069 1216 W. R. Boland ACM Algorithm 436: Product Type 1217 Trapezoidal Integration . . . . . . . . 1070--1070 1218 W. R. Boland ACM Algorithm 437: Product Type 1219 Simpson's Integration . . . . . . . . . 1070--1071 1220 W. R. Boland ACM Algorithm 439: Product Type 1221 Three-point Gauss-Legendre-Simpson's 1222 Integration . . . . . . . . . . . . . . 1072 1223 1224Communications of the ACM 1225Volume 15, Number 2, February, 1973 1226 1227 Peter J. Denning and 1228 Stuart C. Schwartz Corrigendum: ``Properties of the 1229 working-set model'' . . . . . . . . . . 191--198 1230 1231Communications of the ACM 1232Volume 16, Number 1, January, 1973 1233 1234 G. S. Shedler A Queuing Model of a Multiprogrammed 1235 Computer with a Two-Level Storage System 3--10 1236 Carter Bays The Reallocation of Hash-Coded Tables 11--14 1237 James H. Morris, Jr. Protection in Programming Languages . . 15--21 1238 Yoichi Muraoka and 1239 David J. Kuck On the Time Required for a Sequence of 1240 Matrix Products . . . . . . . . . . . . 22--26 1241 E. B. James and 1242 D. P. Partridge Adaptive Correction of Program 1243 Statements . . . . . . . . . . . . . . . 27--37 1244 P. L. Richman Variable-Precision Exponentiation . . . 38--40 1245 C. R. Crawford Reduction of a Band-Symmetric 1246 Generalized Eigenvalue Problem . . . . . 41--44 1247 S. E. Blount and 1248 L. Fein The practical aspect of computer science 1249 education --- discussion . . . . . . . . 45--46 1250 C. Bays A note on when to chain overflow items 1251 within a direct-access table . . . . . . 46--47 1252 M. S. Atkins Mutual recursion in Algol 60 using 1253 restricted compilers . . . . . . . . . . 47--48 1254 L. J. Gallaher ACM Algorithm 440: A Multidimensional 1255 Monte Carlo Quadrature with Adaptive 1256 Stratified Sampling . . . . . . . . . . 49--50 1257 R. E. Knop ACM Algorithm 441: Random samples from 1258 the dipole distribution [G5] . . . . . . 51--51 1259 G. W. Hill and 1260 A. W. Davis ACM Algorithm 442: Normal deviate [S14] 51--52 1261 1262Communications of the ACM 1263Volume 16, Number 2, February, 1973 1264 1265 R. D. Merrill Representation of Contours and Regions 1266 for Efficient Computer Search . . . . . 69--82 1267 S. Crespi-Reghizzi and 1268 M. A. Melkanoff and 1269 L. Lichten The Use of Grammatical Inference for 1270 Designing Programming Languages . . . . 83--90 1271 J. F. Gimpel A Theory of Discrete Patterns and Their 1272 Implementation in SNOBOL4 . . . . . . . 91--100 1273 J. Rokne Automatic Errorbounds for Simple Zeros 1274 of Analytic Functions . . . . . . . . . 101--104 1275 Richard P. Brent Reducing the Retrieval Time of Scatter 1276 Storage Techniques . . . . . . . . . . . 105--109 1277 Robert M. Graham and 1278 Gerald J. Clancy, Jr. and 1279 David B. DeVaney A software design and evaluation system 110--116 1280 R. M. Balzer An overview of the ISPL computer system 1281 design . . . . . . . . . . . . . . . . . 117--122 1282 F. N. Fritsch and 1283 R. E. Shafer and 1284 W. P. Crowley ACM Algorithm 443: Solution of the 1285 Transcendental Equation $w e^w = x$ . . 123--124 1286 1287Communications of the ACM 1288Volume 16, Number 3, March, 1973 1289 1290 Richard H. Austing and 1291 Gerald L. Engel A Computer Science Course Program for 1292 Small Colleges . . . . . . . . . . . . . 139--147 1293 Robert A. Wagner Common Phrases and Minimum-Space Text 1294 Storage . . . . . . . . . . . . . . . . 148--152 1295 Y. Feinroth and 1296 E. Franceschini and 1297 M. Goldstein Telecommunications Using a Front-End 1298 Minicomputer . . . . . . . . . . . . . . 153--160 1299 Charles D. Pack The Effects of Multiplexing on a 1300 Computer-Communications System . . . . . 161--168 1301 Richard W. Conway and 1302 Thomas R. Wilcox Design and Implementation of Diagnostic 1303 Compiler for PL/I . . . . . . . . . . . 169--179 1304 H. E. Salzer Gray code and the +or-sign sequence when 1305 +or-f(+or-f(+or-f( . . +or-f(x) . . .))) 1306 is ordered . . . . . . . . . . . . . . . 180--180 1307 Abraham Bookstein On Harrison's Substring Testing 1308 Technique . . . . . . . . . . . . . . . 180--181 1309 W. H. Payne Graduate Education: The Ph.D. Glut . . . 181--182 1310 R. A. Wagner ACM Algorithm 444: An Algorithm for 1311 Extracting Phrases in a Space-Optimal 1312 Fashion . . . . . . . . . . . . . . . . 183--185 1313 Shi-Kuo Chang ACM Algorithm 445: Binary Pattern 1314 Reconstruction from Projections . . . . 185--186 1315 J. Lau Binary pattern reconstruction from 1316 projections . . . . . . . . . . . . . . 186--186 1317 1318Communications of the ACM 1319Volume 16, Number 4, April, 1973 1320 1321 A. Hassitt and 1322 J. W. Lageschulte and 1323 L. E. Lyon Implementation of a High Level Language 1324 Machine . . . . . . . . . . . . . . . . 199--212 1325 John G. Williams Asymmetric Memory Hierarchies . . . . . 213--222 1326 H. Kuki and 1327 W. J. Cody A Statistical Study of the Accuracy of 1328 Floating Point Number Systems . . . . . 223--230 1329 W. A. Burkhard and 1330 R. M. Keller Some Approaches to Best-Match File 1331 Searching . . . . . . . . . . . . . . . 230--236 1332 James P. Strong, III and 1333 Azriel Rosenfeld A region coloring technique for scene 1334 analysis . . . . . . . . . . . . . . . . 237--246 1335 Juan Rodriguez-Rosell and 1336 Jean-Pierre Dupuy The design, implementation, and 1337 evaluation of a working set dispatcher 247--253 1338 R. Broucke ACM Algorithm 446: Ten Subroutines for 1339 the Manipulation of Chebyshev Series . . 254--256 1340 L. C. Ragland and 1341 D. I. Good Greatest common divisor of $n$ integers 1342 and multipliers . . . . . . . . . . . . 257--257 1343 1344Communications of the ACM 1345Volume 16, Number 5, May, 1973 1346 1347 David Pager On the Problem of Communicating Complex 1348 Information . . . . . . . . . . . . . . 275--281 1349 David W. Low Programming by Questionnaire: an 1350 Effective Way to Use Decision Tables . . 282--286 1351 P. J. H. King and 1352 R. G. Johnson Some Comments on the Use of Ambiguous 1353 Decision Tables and Their Conversion to 1354 Computer Programs . . . . . . . . . . . 287--290 1355 John Salasin Hierarchical Storage in Information 1356 Retrieval . . . . . . . . . . . . . . . 291--295 1357 D. G. Corneil and 1358 C. C. Gotlieb and 1359 Y. M. Lee Minimal Event-Node Network of Project 1360 Precedence Relations . . . . . . . . . . 296--298 1361 Andrew Mercer and 1362 Azriel Rosenfeld An array grammar programming system . . 299--305 1363 Edward M. Reingold A Nonrecursive List Moving Algorithm . . 305--307 1364 H. Vos Coulomb wave functions . . . . . . . . . 308--309 1365 G. Bayer Maxflow . . . . . . . . . . . . . . . . 309--309 1366 B. Holmgren and 1367 A. Kolm and 1368 D. Obradovic Minit algorithm for linear programming 310--310 1369 D. Obradovic Minit algorithm for linear programming 310--310 1370 J. A. Howell Exact solution of linear equations using 1371 residue arithmetic . . . . . . . . . . . 311--311 1372 A. H. J. Sale A sparse matrix package . . . . . . . . 311--311 1373 R. E. Wheeler Increasing the efficiency of quicksort 311--311 1374 M. K. Roy Reflection-free permutations, rosary 1375 permutations and adjacent transposition 1376 algorithms . . . . . . . . . . . . . . . 312--312 1377 C. H. McMorrow Concerning music and computer 1378 composition in computational linguistics 313--313 1379 R. L. Wexelblat Another comment on computer music . . . 313--314 1380 R. G. Estell A comment on the practical aspects of 1381 computer science education . . . . . . . 314--315 1382 Roger Fajman and 1383 John Borgelt WYLBUR, An Interactive Text Editing and 1384 Remote Job Entry System . . . . . . . . 314--322 1385 Dennis J. Frailey A Practical Approach to Managing 1386 Resources and Avoiding Deadlocks . . . . 323--329 1387 1388Communications of the ACM 1389Volume 16, Number 6, June, 1973 1390 1391 R. G. Hamlet Efficient multiprogramming resource 1392 allocation and accounting . . . . . . . 337--342 1393 E. Gelenbe and 1394 J. C. A. Boekhorst and 1395 J. L. W. Kessels Minimizing wasted space in partitioned 1396 segmentation . . . . . . . . . . . . . . 343--349 1397 J. C. Hill Synchronizing processors with 1398 memory-content-generated interrupts . . 350--351 1399 Harold S. Stone and 1400 Samuel F. Fuller On the Near-Optimality of the 1401 Shortest-Latency-Time-First Drum 1402 Scheduling Discipline . . . . . . . . . 352--353 1403 P. F. Stockhausen Adapting optimal code generation for 1404 arithmetic expressions to the 1405 instruction sets available on 1406 present-day computers . . . . . . . . . 353--354 1407 R. F. Ling A computer generated aid for cluster 1408 analysis . . . . . . . . . . . . . . . . 355--361 1409 Ben Shneiderman Optimum Data Base Reorganization Points 362--365 1410 H. Strunz The development of decision tables via 1411 parsing of complex decision situations 366--369 1412 James R. Bell Threaded Code . . . . . . . . . . . . . 370--372 1413 J. Hopcroft and 1414 R. Tarjan ACM Algorithm 447: Efficient Algorithms 1415 for Graph Manipulation . . . . . . . . . 372--378 1416 T. Beyer and 1417 D. F. Swinehart ACM Algorithm 448: Number of 1418 Multiply-Restricted Partitions . . . . . 379--379 1419 J. Ferguson and 1420 P. A. Staley Least squares piecewise cubic curve 1421 fitting . . . . . . . . . . . . . . . . 380--382 1422 W. D. Hoskins Cubic spline solutions to fourth-order 1423 boundary value problems . . . . . . . . 382--385 1424 Franz L. Alt and 1425 Judith Yuni Kirk Computer Photocomposition of Technical 1426 Text . . . . . . . . . . . . . . . . . . 386--391 1427 1428Communications of the ACM 1429Volume 16, Number 7, July, 1973 1430 1431 Richard L. Nolan Managing the Computer Resource: Stage 1432 Hypothesis . . . . . . . . . . . . . . . 399--405 1433 J. C. Huang A Note on Information Organization and 1434 Storage . . . . . . . . . . . . . . . . 406--410 1435 Edward W. Kozdrowicki and 1436 Dennis W. Cooper COKO III: the Cooper-Koz Chess Program 411--427 (or 411--426??) 1437 John H. Howard, Jr. Mixed Solutions for the Deadlock Problem 427--430 1438 Erol Gelenbe Distribution of a Program in Primary and 1439 Fast Buffer Storage . . . . . . . . . . 431--434 1440 Robert F. Rosin Teaching ``About Programming'' . . . . . 435--439 1441 F. Warren McFarlan and 1442 Richard L. Nolan Curriculum Recommendations for Graduate 1443 Professional Programs in Information 1444 Systems: Recommended Addendum on 1445 Information Systems Administration . . . 439--442 (or 439--441??) 1446 A. Kandel Computer Science --- Seminars for 1447 Undergraduates . . . . . . . . . . . . . 442--442 1448 G. V. Bochmann Multiple Exits from a Loop Without the 1449 GOTO . . . . . . . . . . . . . . . . . . 443--444 1450 Patrick A. V. Hall Equivalence Between AND/OR Graphs and 1451 Context-Free Grammars . . . . . . . . . 444--445 1452 F. Fiala ACM Algorithm 449: Solution of Linear 1453 Programming Problems in 0-1 Variables 445--448 (or 445--447??) 1454 B. W. Kernighan Remark on ``Algorithm 422: Minimal 1455 Spanning Tree'' . . . . . . . . . . . . 448--448 1456 I. D. G. Macleod and 1457 A. M. Collins Hidden-line plotting program . . . . . . 448--448 1458 P. J. Nikolai DIFSUB for solution of ordinary 1459 differential equations . . . . . . . . . 448--448 1460 1461Communications of the ACM 1462Volume 16, Number 8, August, 1973 1463 1464 Michael H. Smith A learning program which plays 1465 partnership dominoes . . . . . . . . . . 462--467 1466 B. J. MacLennan Fen --- an Axiomatic Basis for Program 1467 Semantics . . . . . . . . . . . . . . . 468--474 1468 David Misunas Petri Nets and Speed Independent Design 474--482 (or 474--481??) 1469 M. MacHura and 1470 A. Mulawa ACM Algorithm 450: Rosenbrock Function 1471 Minimization . . . . . . . . . . . . . . 482--483 1472 R. B. Goldstein ACM Algorithm 451: Chi-Square Quantiles 483--485 1473 C. N. Liu and 1474 D. T. Tang ACM Algorithm 452: Enumerating 1475 Combinations of $m$ Out of $n$ Objects 485--485 1476 Robert Piessens ACM Algorithm 453: Gaussian Quadrature 1477 Formulas for Bromwich's Integral . . . . 486--487 1478 J. A. Richardson and 1479 J. L. Kuester ACM Algorithm 454: The Complex Method 1480 for Constrained Optimization . . . . . . 487--489 1481 G. Andrejkova and 1482 J. Vinar Complex gamma function . . . . . . . . . 489--489 1483 R. M. De Morgan Remark on ``Algorithm 357 [A1]: An 1484 Efficient Prime Number Generator'' . . . 489--489 1485 R. P. Watkins Graph plotter . . . . . . . . . . . . . 489--490 1486 J. G. Byrne Hu-Tucker minimum redundancy alphabetic 1487 coding method . . . . . . . . . . . . . 490--490 1488 A. J. Good Clenshaw-Curtis quadrature . . . . . . . 490--490 1489 E. J. Williams Localization of the roots of a 1490 polynomial . . . . . . . . . . . . . . . 490--490 1491 Zohar Manna and 1492 Stephen Ness and 1493 Jean Vuillemin Inductive Methods for Proving Properties 1494 of Programs . . . . . . . . . . . . . . 491--502 1495 W. W. Peterson and 1496 T. Kasami and 1497 N. Tokura On the Capabilities of While, Repeat, 1498 and Exit Statements . . . . . . . . . . 503--512 1499 Caxton C. Foster A Generalization of AVL Trees . . . . . 513--517 1500 1501Communications of the ACM 1502Volume 16, Number 9, September, 1973 1503 1504 Jeffrey P. Buzen Computational Algorithms for Closed 1505 Queueing Networks with Exponential 1506 Servers . . . . . . . . . . . . . . . . 527--531 1507 S. Ganapathy and 1508 V. Rajaraman Information Theory Applied to the 1509 Conversion of Decision Tables to 1510 Computer Programs . . . . . . . . . . . 532--539 1511 Alfonso F. Cardenas Evaluation and Selection of File 1512 Organization --- A Model and a System 540--548 1513 R. G. Casey Design of Tree Structures for Efficient 1514 Querying . . . . . . . . . . . . . . . . 549--556 1515 Juan Rodriguez-Rosell Empirical Working Set Behavior . . . . . 556--560 1516 Geoffrey W. Gates and 1517 David A. Poplawski A simple technique for structured 1518 variable lookup . . . . . . . . . . . . 561--565 1519 M. V. Zelkowitz Reversible Execution . . . . . . . . . . 566--566 1520 Robert E. Barnhill and 1521 David T. Pilcher Sard kernels for certain bivariate 1522 cubatures . . . . . . . . . . . . . . . 567--571 (or 567--570??) 1523 D. B. Hunter and 1524 J. M. Williams ACM Algorithm 455: Analysis of Skew 1525 Representations of the Symmetric Group 571--572 1526 Zden\vek Fencl ACM Algorithm 456: Routing Problem . . . 572--574 1527 Coen Bron and 1528 Joep Kerbosch ACM Algorithm 457: Finding All Cliques 1529 of an Undirected Graph . . . . . . . . . 575--577 1530 M. K. Roy Remark on ``Algorithm 323 [G6]: 1531 Generation of Permutations in 1532 Lexicographic Order'' . . . . . . . . . 577--578 1533 Mohit Kumar Roy Remark on ``Algorithm 323 [G6]: 1534 Generation of Permutations in 1535 Lexicographic Order'' . . . . . . . . . 577--578 1536 E. E. Lawrence A sparse matrix package. I . . . . . . . 578--578 1537 H. Williamson Hidden-line plotting program . . . . . . 578--579 1538 H. B. Driessen and 1539 E. W. LeM. Hunt Localization of the roots of a 1540 polynomial . . . . . . . . . . . . . . . 579--579 1541 1542Communications of the ACM 1543Volume 16, Number 10, October, 1973 1544 1545 John S. McGeachie Multiple Terminals Under User Program 1546 Control in a Time-Sharing Environment 587--590 1547 Daniel G. Bobrow and 1548 Ben Wegbreit A Model and Stack Implementation of 1549 Multiple Environments . . . . . . . . . 591--603 1550 Vincent Y. Lum General Performance Analysis of 1551 Key-to-Address Transformation Methods 1552 Using an Abstract File Concept . . . . . 603--612 1553 Butler W. Lampson A Note on the Confinement Problem . . . 613--615 1554 Daniel S. Hirschberg A Class of Dynamic Memory Allocation 1555 Algorithms . . . . . . . . . . . . . . . 615--618 1556 Barton G. Prieve Using Page Residency to Select the 1557 Working Set Parameter . . . . . . . . . 619--620 1558 Robert E. Millstein Control Structures in Illiac IV Fortran 621--627 1559 P. D. Robers and 1560 S. S. Robers ACM Algorithm 458: Discrete Linear 1561 ${L}_1$ Approximation by Interval Linear 1562 Programming . . . . . . . . . . . . . . 629--631 1563 M. M. Syslo ACM Algorithm 459: The Elementary 1564 Circuits of a Graph . . . . . . . . . . 632--633 1565 Paul E. Saylor and 1566 James D. Sebastian ACM Algorithm 460: Calculation of 1567 Optimum Parameters for Alternating 1568 Direction Implicit Procedures . . . . . 633--635 1569 F. J. Burkowski and 1570 W. D. Hoskins ACM Algorithm 461: Cubic Spline 1571 Solutions to a Class of Functional 1572 Differential Equations . . . . . . . . . 635--637 1573 T. G. Donnelly ACM Algorithm 462: Bivariate Normal 1574 Distribution . . . . . . . . . . . . . . 638--638 1575 C. R. Lewart ACM Algorithm 463: Algorithms SCALE1, 1576 SCALE2, and SCALE3 for Determination of 1577 Scales on Computer Generated Plots . . . 639--640 1578 1579Communications of the ACM 1580Volume 16, Number 11, November, 1973 1581 1582 Charles W. Bachman The Programmer as Navigator . . . . . . 653--658 1583 R. S. Fabry Dynamic Verification of Operating System 1584 Decisions . . . . . . . . . . . . . . . 659--668 1585 M. D. Mickunas and 1586 V. B. Schneider Parser-Generating System for 1587 Constructing Compressed Compilers . . . 669--676 1588 B. W. Jordan, Jr. and 1589 R. C. Barrett Scan Conversion Algorithm with Reduced 1590 Storage Requirements . . . . . . . . . . 676--682 1591 James R. Slagle and 1592 Lewis M. Norton Experiments with an Automatic 1593 Theorem-Prover Having Partial Ordering 1594 Inference Rules . . . . . . . . . . . . 682--688 1595 C. H. Reinsch ACM Algorithm 464: Eigenvalues of a Real 1596 Symmetric Tridiagonal Matrix . . . . . . 689--689 1597 G. W. Hill ACM Algorithm 465: Student's $t$ 1598 Frequency . . . . . . . . . . . . . . . 690--690 1599 G. Ehrlich ACM Algorithm 466: Four Combinatorial 1600 Algorithms . . . . . . . . . . . . . . . 690--691 1601 N. Brenner ACM Algorithm 467: Matrix Transposition 1602 in Place . . . . . . . . . . . . . . . . 692--694 1603 T. N. L. Patterson ACM Algorithm 468: Algorithm for 1604 Automatic Numerical Integration Over a 1605 Finite Interval . . . . . . . . . . . . 694--699 1606 C. Lam and 1607 J. McKay ACM Algorithm 469: Arithmetic Over a 1608 Finite Field . . . . . . . . . . . . . . 699--699 1609 Peter J. Denning and 1610 G. Scott Graham A Note on Subexpression Ordering in the 1611 Execution of Arithmetic Expressions . . 700--702 1612 Jerome A. Feldman and 1613 James R. Low and 1614 R. P. Brent Comment on Brent's scatter storage 1615 algorithm (and author's reply) . . . . . 703--703 1616 E. Wegner Tree-structured programs . . . . . . . . 704--705 1617 Herbert E. Salzer A recurrence scheme for converting from 1618 one orthogonal expansion into another 705--707 1619 F. Stenger An algorithm for the approximate 1620 solution of Wiener-Hopf integral 1621 equations . . . . . . . . . . . . . . . 708--710 1622 L. W. Ehrlich Solving the Biharmonic Equation in a 1623 Square: a Direct Versus a Semidirect 1624 Method . . . . . . . . . . . . . . . . . 711--714 1625 1626Communications of the ACM 1627Volume 16, Number 12, December, 1973 1628 1629 J. Daniel Couger Curriculum Recommendations for 1630 Undergraduate Programs in Information 1631 Systems . . . . . . . . . . . . . . . . 727--749 1632 Edgar H. Sibley and 1633 Robert W. Taylor A Data Definition and Mapping Language 750--759 1634 M. Kubicek ACM Algorithm 470: Linear Systems with 1635 Almost Tridiagonal Matrix . . . . . . . 760--761 1636 W. Gautschi ACM Algorithm 471: Exponential Integrals 761--763 1637 J. G. Herriot and 1638 C. H. Reinsch ACM Algorithm 472: Procedures for 1639 Natural Spline Interpolation . . . . . . 763--768 1640 1641Communications of the ACM 1642Volume 17, Number 1, January, 1974 1643 1644 G. Lyon Syntax-directed least-errors analysis 1645 for context-free languages: a practical 1646 approach . . . . . . . . . . . . . . . . 3--14 1647 Michael A. Malcolm and 1648 John Palmer A Fast Method For Solving a Class of 1649 Tridiagonal Systems of Linear Equations 14--17 1650 H. Akima A method of bivariate interpolation and 1651 smooth surface fitting based on local 1652 procedures . . . . . . . . . . . . . . . 18--20 1653 Norman E. Gibbs and 1654 William G. Poole, Jr. Tridiagonalization by Permutations . . . 20--24 1655 R. Piessens ACM Algorithm 473: Computation of 1656 Legendre Series Coefficients . . . . . . 25--25 1657 H. Akima ACM Algorithm 474: Bivariate 1658 Interpolation and Smooth Surface Fitting 1659 Based on Local Procedures . . . . . . . 26--31 1660 Ivan E. Sutherland and 1661 Gary W. Hodgman Reentrant Polygon Clipping . . . . . . . 32--42 1662 P. J. H. King and 1663 R. G. Johnson Comments on the algorithms of Verhelst 1664 for the conversion of limited-entry 1665 decision tables to flowcharts (and 1666 author's reply) . . . . . . . . . . . . 43--45 1667 Gary D. Knott A Numbering System for Combinations . . 45--46 1668 H. C. Lucas, Jr. A CRT report generating system . . . . . 47--48 1669 1670Communications of the ACM 1671Volume 17, Number 2, February, 1974 1672 1673 James B. Rothnie, Jr. and 1674 Tomas Lozano Attribute Based File Organization in a 1675 Paged Memory Environment . . . . . . . . 63--69 1676 B. W. Jordan, Jr. and 1677 R. C. Barrett A cell organized raster display for line 1678 drawings . . . . . . . . . . . . . . . . 70--77 1679 John S. Ramberg and 1680 Bruce W. Schmeiser An Approximate Method for Generating 1681 Asymmetric Random Variables . . . . . . 78--82 1682 Leslie Lamport The Parallel Execution of DO Loops . . . 83--93 1683 Henry F. Ledgard Production Systems: or can we do better 1684 than BNF? . . . . . . . . . . . . . . . 94--102 1685 Ben Wegbreit The Synthesis of Loop Predicates . . . . 102--112 1686 1687Communications of the ACM 1688Volume 17, Number 3, March, 1974 1689 1690 K. Sreenivasan and 1691 A. J. Kleinman On the Construction of a Representative 1692 Synthetic Workload . . . . . . . . . . . 127--133 1693 E. Balkovich and 1694 W. Chiu and 1695 L. Presser and 1696 R. Wood Dynamic Memory Repacking . . . . . . . . 133--138 1697 Howard Lee Morgan Optimal Space Allocation on Disk Storage 1698 Devices . . . . . . . . . . . . . . . . 139--142 1699 Rudolf Loeser Some Performance Tests of ``Quicksort'' 1700 and Descendants . . . . . . . . . . . . 143--152 1701 T. Wright Visible surface plotting program . . . . 152--157 (or 152--155??) 1702 N. E. Bosten and 1703 E. L. Battiste Incomplete beta ratio . . . . . . . . . 156--157 1704 R. C. Barrett and 1705 B. W. Jordan, Jr. Scan Conversion Algorithms for a Cell 1706 Organized Raster Display . . . . . . . . 157--163 1707 A. Frank Ackerman Quadratic Search for Hash Tables of Size 1708 $p^n$ . . . . . . . . . . . . . . . . . 164--164 1709 Harold S. Stone A note on a combinatorial problem of 1710 Burnett and Coffman . . . . . . . . . . 165--166 1711 Fred T. Krogh Efficient Implementation of a Variable 1712 Projection Algorithm for Nonlinear Least 1713 Squares Problems . . . . . . . . . . . . 167--169 1714 1715Communications of the ACM 1716Volume 17, Number 4, April, 1974 1717 1718 Jerome H. Saltzer A Simple Linear Model of Demand Paging 1719 Performance . . . . . . . . . . . . . . 181--186 1720 M. A. Franklin and 1721 R. K. Gupta Computation of Page Fault Probability 1722 from Program Transition Diagram . . . . 186--191 1723 John W. Boyse Execution Characteristics of Programs in 1724 a Page-On-Demand System . . . . . . . . 192--196 1725 Graham Smith and 1726 Ian M. Sefton On Lions' Counter Example for Gotlieb's 1727 Method for the Construction of School 1728 Timetables . . . . . . . . . . . . . . . 196--197 1729 Gary Lindstrom Copying List Structures Using Bounded 1730 Workspace . . . . . . . . . . . . . . . 198--202 1731 Shimon Even Parallelism in Tape-Sorting . . . . . . 202--204 1732 H. C. Lucas, Jr. and 1733 D. B. Montgomery and 1734 J. C. Larreche A study of computer use in a graduate 1735 school of business . . . . . . . . . . . 205--206 1736 Peter Freeman and 1737 Michael A. Malcolm and 1738 William H. Payne Graduate Education: The Ph.D. Glut: 1739 Response and Rebuttal . . . . . . . . . 206--207 1740 T. D. Sterling and 1741 S. V. Pollack Ideal teaching machines --- a solution 1742 to the pedagogic language problem . . . 207--208 1743 P. W. Abrahams Some remarks on lookup of structured 1744 variables . . . . . . . . . . . . . . . 209--210 1745 A. Balfour An alternative approach to mutual 1746 recursion in Algol 60 using restricted 1747 compilers . . . . . . . . . . . . . . . 210--210 1748 R. C. T. Lee and 1749 C. L. Chang and 1750 R. J. Waldinger An Improved Program-Synthesizing 1751 Algorithm and its Correctness . . . . . 211--217 1752 A. K. Cline Scalar- and planar-valued curve fitting 1753 using splines under tension. I . . . . . 218--220 1754 A. K. Cline ACM Algorithm 476: Six Subprograms for 1755 Curve Fitting Using Splines Under 1756 Tension . . . . . . . . . . . . . . . . 220--223 (or 220--221??) 1757 G. Ehrlich ACM Algorithm 477: Generator of 1758 Set-Partitions to Exactly ${R}$ Subsets 224--225 1759 B. Einarsson Solution of the transcendental equation 1760 we/sup w/=x . . . . . . . . . . . . . . 225--225 1761 1762Communications of the ACM 1763Volume 17, Number 5, May, 1974 1764 1765 Mary Shaw Reduction of Compilation Costs Through 1766 Language Contraction . . . . . . . . . . 245--250 1767 Ben Wegbreit The treatment of data types in EL1 . . . 251--264 1768 Robert A. Wagner Order-$n$ Correction for Regular 1769 Languages . . . . . . . . . . . . . . . 265--268 1770 Nai Kuan Tsao On the Distributions of Significant 1771 Digits and Roundoff Errors . . . . . . . 269--271 1772 M. C. Wunderlich and 1773 J. L. Selfridge Design for a Number Theory Package with 1774 an Optimized Trial Division Routine . . 272--276 1775 W. M. Gentleman and 1776 S. B. Marovich More on Algorithms that Reveal 1777 Properties of Floating Point Arithmetic 1778 Units . . . . . . . . . . . . . . . . . 276--277 1779 D. E. Gold and 1780 D. J. Kuck A Model for Masking Rotational Latency 1781 by Dynamic Disk Allocation . . . . . . . 278--288 1782 1783Communications of the ACM 1784Volume 17, Number 6, June, 1974 1785 1786 Jacques Cohen and 1787 Carl Zuckerman Two Languages for Estimating Program 1788 Efficiency . . . . . . . . . . . . . . . 301--308 1789 L. Henschen and 1790 Ross A. Overbeek and 1791 L. Wos A Theorem-Proving Language for 1792 Experimentation . . . . . . . . . . . . 308--314 1793 James F. Gimpel The minimization of 1794 spatially-multiplexed character sets . . 315--318 1795 I. Barrodale and 1796 F. D. K. Roberts ACM Algorithm 478: Solution of an 1797 Overdetermined System of Equations in 1798 the ${L_1}$ Norm . . . . . . . . . . . . 319--320 1799 R. L. Page ACM Algorithm 479: A Minimal Spanning 1800 Tree Clustering Method . . . . . . . . . 321--323 1801 B. Gaither Hidden-line plotting program . . . . . . 324--324 1802 R. Piessens Calculation of Fourier integrals . . . . 324--324 1803 R. Piessens Modified Havie integration . . . . . . . 324--324 1804 T. M. R. Ellis Hidden-line plotting program . . . . . . 324--325 1805 R. L. Page Generation of random correlated normal 1806 variables . . . . . . . . . . . . . . . 325--325 1807 D. M. Boulton Exact probabilities for R*C contingency 1808 tables . . . . . . . . . . . . . . . . . 326--326 1809 W. D. Slysz An evaluation of software in the social 1810 sciences . . . . . . . . . . . . . . . . 326--332 1811 John Adams and 1812 John Gary Compact Representation of Contour Plots 1813 for Phone Line Transmission . . . . . . 333--336 1814 W. Wulf and 1815 E. Cohen and 1816 W. Corwin and 1817 A. Jones and 1818 R. Levin and 1819 C. Pierson and 1820 F. Pollack HYDRA: The Kernel of a Multiprocessor 1821 Operating System . . . . . . . . . . . . 337--345 1822 Ian J. Barton and 1823 Susan E. Creasey and 1824 Michael F. Lynch and 1825 Michael J. Snell An Information-Theoretic Approach to 1826 Text Searching in Direct Access Systems 345--350 1827 Edward Minieka On Computing Sets of Shortest Paths in a 1828 Graph . . . . . . . . . . . . . . . . . 351--353 1829 1830Communications of the ACM 1831Volume 17, Number 7, July, 1974 1832 1833 Dennis M. Ritchie and 1834 Ken Thompson The UNIX Time-Sharing System . . . . . . 365--375 1835 Samuel H. Fuller Minimal-Total-Processing Time Drum and 1836 Disk Scheduling Disciplines . . . . . . 376--381 1837 J. Bruno and 1838 E. G. Coffman, Jr. and 1839 R. Sethi Scheduling Independent Tasks To Reduce 1840 Mean Finishing Time . . . . . . . . . . 382--387 1841 Jerome H. Saltzer Protection and the Control of 1842 Information Sharing in Multics . . . . . 388--402 1843 R. S. Fabry Capability-Based Addressing . . . . . . 403--412 1844 Gerald J. Popek and 1845 Robert P. Goldberg Formal Requirements for Virtualizable 1846 Third Generation Architectures . . . . . 412--421 1847 1848Communications of the ACM 1849Volume 17, Number 8, August, 1974 1850 1851 Bruce Hahn A New Technique for Compression and 1852 Storage of Data . . . . . . . . . . . . 434--436 1853 Arthur Evans, Jr. and 1854 William Kantrowitz and 1855 Edwin Weiss A User Authentication Scheme Not 1856 Requiring Secrecy in the Computer . . . 437--442 1857 George B. Purdy A High Security Log-in Procedure . . . . 442--445 1858 Theodore D. Friedman and 1859 Lance J. Hoffman Execution Time Requirements for 1860 Encipherment Programs . . . . . . . . . 445--449 1861 G. A. Neufeld and 1862 J. Tartar Graph Coloring Conditions for the 1863 Existence of Solutions to the Timetable 1864 Problem . . . . . . . . . . . . . . . . 450--453 1865 Leslie Lamport A New Solution of Dijkstra's Concurrent 1866 Programming Problem . . . . . . . . . . 453--455 1867 John C. Cavouras On the Conversion of Programs to 1868 Decision Tables: Method and Objectives 456--462 1869 T. Lyche and 1870 L. L. Schumaker ACM Algorithm 480: Procedures for 1871 Computing Smoothing and Interpolating 1872 Natural Splines . . . . . . . . . . . . 463--467 1873 K. C. Crandall ACM Algorithm 481: Arrow to Precedence 1874 Network Transformation . . . . . . . . . 467--469 1875 John McKay and 1876 E. Regener ACM Algorithm 482: Transitivity Sets 1877 [G7] . . . . . . . . . . . . . . . . . . 470--470 1878 A. H. Stroud Gauss Harmonic Interpolation Formulas 471--475 1879 Rolf O. E. Lagerloef Interpolation with Rounded Ramp 1880 Functions . . . . . . . . . . . . . . . 476--479 1881 Forman S. Acton Recurrence Relations for the Fresnel 1882 Integral 1883 $\int_0^\infty[\exp(-ct)dt/(t)^{1/2}(1+t^2)]$ and Similar Integrals 480--481 1884 1885Communications of the ACM 1886Volume 17, Number 9, September, 1974 1887 1888 I. M. Willers A New Integration Algorithm for Ordinary 1889 Differential Equations Based on 1890 Continued Fraction Approximations . . . 504--508 1891 Oliver Aberth A Precise Numerical Analysis Program . . 509--513 1892 To-yat. Cheung Interactive Graphic Display for Region 1893 Partitioning by Linear Programming . . . 513--516 1894 Mario Schkolnick The Equivalence of Reducing Transition 1895 Languages and Deterministic Languages 517--519 1896 S. L. Watkins ACM Algorithm 483: Masked 1897 Three-Dimensional Plot Program with 1898 Rotations . . . . . . . . . . . . . . . 520--523 1899 K. H. Burrell ACM Algorithm 484: Evaluation of the 1900 Modified Bessel Functions ${K}_0(z)$ and 1901 ${K}_1(z)$ for Complex Arguments . . . . 524--526 1902 H. D. Eidson and 1903 L. L. Schumaker ACM Algorithm 485: Computation of 1904 $g$-Splines via a Factorization Method 526--530 1905 John W. Young A First Order Approximation to the 1906 Optimum Checkpoint Interval . . . . . . 530--531 1907 Keith Shwayder Extending the Information Theory 1908 Approach to Converting Limited-Entry 1909 Decision Tables to Computer Programs . . 532--537 1910 1911Communications of the ACM 1912Volume 17, Number 10, October, 1974 1913 1914 C. A. R. Hoare Monitors: An Operating System 1915 Structuring Concept . . . . . . . . . . 549--557 1916 Kenneth K. Shen and 1917 James L. Peterson A Weighted Buddy Method for Dynamic 1918 Storage Allocation . . . . . . . . . . . 558--568 (or 558--562??) 1919 D. R. Slutz and 1920 I. L. Traiger A note on the calculation of average 1921 working set size . . . . . . . . . . . . 563--565 1922 Ben Shneiderman and 1923 Peter Scheuermann Structured Data Structures . . . . . . . 566--574 1924 R. H. Canaday and 1925 R. D. Harrison and 1926 E. L. Ivie and 1927 J. L. Ryder and 1928 L. A. Wehr A Back-end Computer for Data Base 1929 Management . . . . . . . . . . . . . . . 575--583 (or 575--582??) 1930 A. Charnes and 1931 W. M. Raike and 1932 J. D. Stutz and 1933 A. S. Walters On Generation of Test Problems for 1934 Linear Programming Codes . . . . . . . . 583--587 (or 583--586??) 1935 F. Veillon ACM Algorithm 486: Numerical Inversion 1936 of Laplace Transform . . . . . . . . . . 587--589 (or 587--588??) 1937 H. Koppelaar Certification and remark on algorithm 1938 191 . . . . . . . . . . . . . . . . . . 589--590 1939 L. G. Proll A computer routine for quadratic and 1940 linear programming problems . . . . . . 590--590 1941 J. Klemes and 1942 J. Klemsa Rosenbrock function minimization . . . . 590--591 1943 Fred T. Krogh Errata: ``Efficient Implementation of a 1944 Variable Projection Algorithm for 1945 Nonlinear Least Squares'' . . . . . . . 591--591 1946 Bruce Gilchrist and 1947 Richard E. Weber Enumerating Full-Time Programmers . . . 592--593 1948 1949Communications of the ACM 1950Volume 17, Number 11, November, 1974 1951 1952 Theodor D. Sterling Guidelines for Humanizing Computerized 1953 Information Systems, A Report from 1954 Stanley House . . . . . . . . . . . . . 609--613 1955 Domenico Ferrari Improving Locality by Critical Working 1956 Sets . . . . . . . . . . . . . . . . . . 614--620 1957 Perry Lowell Miller A locally-organized parser for spoken 1958 input . . . . . . . . . . . . . . . . . 621--630 1959 Gary M. Rader Method for Composing Simple Traditional 1960 Music by Computer . . . . . . . . . . . 631--638 1961 R. A. Freiburghouse Register Allocation via Usage Counts . . 638--642 1962 E. W. Dijkstra Self-stabilizing Systems in Spite of 1963 Distributed Control . . . . . . . . . . 643--644 1964 J. A. Brown and 1965 B. Werner An on-site data management system 1966 application in field archaeology . . . . 644--646 1967 D. R. Hanson A simple technique for representing 1968 strings in Fortran IV . . . . . . . . . 646--647 1969 C. J. Van Rijsbergen The best-match problem in document 1970 retrieval . . . . . . . . . . . . . . . 648--649 1971 R. V. Evans Multiple exits from a loop using neither 1972 GO TO nor labels . . . . . . . . . . . . 650--650 1973 1974Communications of the ACM 1975Volume 17, Number 12, December, 1974 1976 1977 Donald E. Knuth Computer Programming as an Art . . . . . 667--673 1978 Laurance I. Press Arguments for a Moratorium on the 1979 Construction of a Community Information 1980 Utility . . . . . . . . . . . . . . . . 674--678 1981 J. C. Strauss An analytic model of the Hasp execution 1982 task monitor . . . . . . . . . . . . . . 679--685 1983 Thomas L. Adam and 1984 K. M. Chandy and 1985 J. R. Dickson A Comparison of List Schedules for 1986 Parallel Processing Systems . . . . . . 685--690 1987 N. D. Wallace Computer Generation of Gamma Random 1988 Variates with Non-Integral Shape 1989 Parameters . . . . . . . . . . . . . . . 691--695 1990 A. Salazar and 1991 R. V. Oakford A Graph Formulation of a School 1992 Scheduling Algorithm . . . . . . . . . . 696--698 1993 Sherwood C. Chu and 1994 Mones Berman An Exponential Method for the Solution 1995 of Systems of Ordinary Differential 1996 Equations . . . . . . . . . . . . . . . 699--702 1997 J. Pomeranz ACM Algorithm 487: Exact Cumulative 1998 Distribution of the Kolmogorov-Smirnov 1999 Statistic for Small Samples . . . . . . 703--704 2000 R. P. Brent ACM Algorithm 488: A Gaussian 2001 pseudo-random number generator [G5] . . 704--706 (or 704--705??) 2002 C. William Skinner Heuristic Approach to Inductive 2003 Inference in Fact Retrieval Systems . . 707--712 2004 2005Communications of the ACM 2006Volume 21, Number 1, January, 1974 2007 2008 D. Mitra Some Aspects of Hierarchical Memory 2009 Systems . . . . . . . . . . . . . . . . 54--65 2010 2011Communications of the ACM 2012Volume 6, Number 10, October, 1975 2013 2014 R. E. Millstein Control Structures in Illiac IV Fortran 157--164 2015 T. Sterling and 2016 V. Lum and 2017 N. Shu and 2018 B. Housel CONVERT: A High Level Translation 2019 Definition Language for Data Conversion 557--567 2020 2021Communications of the ACM 2022Volume 18, Number 1, January, 1975 2023 2024 Aaron Finerman Professionalism in the Computing Field 4--9 2025 F. L. Bauer Positivity and Norms . . . . . . . . . . 9--13 2026 John Todd The Lemniscate Constants . . . . . . . . 14--19 2027 G. Peters and 2028 J. H. Wilkinson On the Stability of Gauss-Jordan 2029 Elimination with Pivoting . . . . . . . 20--24 2030 Garrett Birkhoff Two Hadamard Numbers for Matrices . . . 25--29 2031 A. van der Sluis Perturbations of Eigenvalues of 2032 Non-Normal Matrices . . . . . . . . . . 30--36 2033 Marvin Marcus and 2034 Herbert Robinson Elementary Divisors of Tensor Products 36--39 2035 Magnus R. Hestenes Pseudoinverses and Conjugate Gradients 40--43 2036 Harlan D. Mills The New Math of Computer Programming . . 43--48 2037 Tien Chi Chen and 2038 Irving T. Ho Storage-Efficient Representation of 2039 Decimal Data . . . . . . . . . . . . . . 49--52 2040 Werner Liniger Connections Between Accuracy and 2041 Stability Properties of Linear Multistep 2042 Formulas . . . . . . . . . . . . . . . . 53--56 2043 Richard J. Hanson Stably Updating Mean and Standard 2044 Deviation of Data . . . . . . . . . . . 57--58 2045 2046Communications of the ACM 2047Volume 18, Number 2, February, 1975 2048 2049 John McCarthy Proposed Criterion for a Cipher to be 2050 Probable-Word Proof . . . . . . . . . . ?? 2051 G. J. Burnett and 2052 E. G. Coffman, Jr. Analysis of Interleaved Memory Systems 2053 Using Blockage Buffers . . . . . . . . . 91--95 2054 Neil M. Goldman Sentence Paraphrasing from a Conceptual 2055 Base . . . . . . . . . . . . . . . . . . 96--106 2056 Gordon J. VanderBrug and 2057 Jack Minker State-Space, Problem-Reduction, and 2058 Theorem Proving --- Some Relationships 107--115 2059 Carolyn Kimme and 2060 Dana Ballard and 2061 Jack Sklansky Finding Circles by an Array of 2062 Accumulators . . . . . . . . . . . . . . 120--122 2063 2064Communications of the ACM 2065Volume 18, Number 3, March, 1975 2066 2067 H. C. Johnston and 2068 C. A. R. Hoare Matrix Reduction --- an Efficient Method 2069 (school timetables) . . . . . . . . . . 141--150 2070 Brian W. Kernighan and 2071 Lorinda L. Cherry A System for Typesetting Mathematics . . 151--157 2072 D. H. Lawrie and 2073 T. Layman and 2074 D. Baer and 2075 J. M. Randal GLYPNIR --- A programming language for 2076 Illiac IV . . . . . . . . . . . . . . . 157--164 2077 Robert W. Floyd and 2078 Ronald L. Rivest Expected Time Bounds for Selection . . . 165--172 2079 R. W. Floyd and 2080 R. L. Rivest ACM Algorithm 489: The Algorithm SELECT 2081 -- for Finding the $i$th Smallest of $n$ 2082 Elements . . . . . . . . . . . . . . . . 173--173 2083 A. M. Erisman and 2084 W. F. Tinney On Computing Certain Elements of the 2085 Inverse of a Sparse Matrix . . . . . . . 177--179 2086 L. F. Shampine Discrete Least Squares Polynomial Fits 179--180 2087 A. van der Sluis Corrigendum: ``Perturbations of 2088 eigenvalues of non-normal matrices'' . . 180 2089 D. L. Parnas On a Solution to the Cigarette Smoker's 2090 Problem (Without Conditional Statements) 181--183 2091 2092Communications of the ACM 2093Volume 18, Number 4, April, 1975 2094 2095 Jack A. Chambers and 2096 Ray V. Poore Computer Networks in Higher Education: 2097 Socio-Economic-Political Factors . . . . 193--199 2098 E. S. Ginsberg and 2099 D. Zaborowski ACM Algorithm 490: The Dilogarithm 2100 Function of a Real Argument . . . . . . 200--202 2101 K. K. Shen and 2102 J. L. Peterson Corrigendum: ``A Weighted Buddy Method 2103 for Dynamic Storage Allocation'' . . . . 202--202 2104 Graham Smith On Maintenance of the Opportunity List 2105 for Class-Teacher Timetable Problems . . 203--208 2106 I. C. Braid The Synthesis of Solids Bounded by Many 2107 Faces . . . . . . . . . . . . . . . . . 209--216 2108 Vladimir Batagelj Quadratic Hash Method When the Table 2109 Size is not a Prime Number . . . . . . . 216--217 2110 Henry S. Warren, Jr. A Modification of Warshall's Algorithm 2111 for the Transitive Closure of Binary 2112 Relations . . . . . . . . . . . . . . . 218--220 2113 James A. Hinds Algorithm for Locating Adjacent Storage 2114 Blocks in the Buddy System . . . . . . . 221--222 2115 Jean G. Vaucher and 2116 Pierre Duval A Comparison of Simulation Event List 2117 Algorithms . . . . . . . . . . . . . . . 223--230 2118 Robert R. Korfhage and 2119 David W. Matula On Salazar and Oakford . . . . . . . . . 240--240 2120 Michael R. Garey and 2121 David S. Johnson On Salazar and Oakford . . . . . . . . . 240--241 2122 2123Communications of the ACM 2124Volume 18, Number 5, May, 1975 2125 2126 David A. Fisher Copying Cyclic List Structures in Linear 2127 Time Using Bounded Workspace . . . . . . 251--252 2128 Alfonso F. Cardenas Analysis and Performance of Inverted 2129 Data Base Structures . . . . . . . . . . 253--263 2130 Yorick Wilks An intelligent analyzer and understander 2131 of English . . . . . . . . . . . . . . . 264--274 2132 N. E. Gibbs ACM Algorithm 491: Basic Cycle 2133 Generation . . . . . . . . . . . . . . . 275--276 (or 275--275??) 2134 D. J. Evans and 2135 M. Hatzopoulos A note on the LU factorization of a 2136 symmetric matrix . . . . . . . . . . . . 278--279 2137 B. L. Fox More on $k$th Shortest Paths . . . . . . 279--279 2138 A. I. Wasserman A problem-list of public policy issues 2139 concerning computers and health care . . 279--280 2140 Harlan D. Mills Corrigendum: ``The New Math of Computer 2141 Programming'' . . . . . . . . . . . . . 280--280 2142 Steven L. Horowitz Syntactic Algorithm for Peak Detection 2143 in Waveforms with Applications to 2144 Cardiography . . . . . . . . . . . . . . 281--285 2145 Charles E. Pfefferkorn Heuristic Problem Solving Design System 2146 for Equipment or Furniture Layouts . . . 286--297 2147 Robert R. Korfhage and 2148 David W. Matula More on the Salazar and Oakford Paper 303--303 2149 2150Communications of the ACM 2151Volume 18, Number 6, June, 1975 2152 2153 N. E. Gibbs ACM Algorithm 492: Generation of All the 2154 Cycles of a Graph from a Set of Basic 2155 Cycles . . . . . . . . . . . . . . . . . 310--310 2156 Bui Tuong Phong Illumination for Computer Generated 2157 Pictures . . . . . . . . . . . . . . . . 311--317 2158 V. Y. Lum and 2159 M. E. Senko and 2160 C. P. Wang and 2161 H. Ling A Cost Oriented Algorithm for Data Set 2162 Allocation in Storage Hierarchies . . . 318--322 2163 Alan F. Babich and 2164 John Grason and 2165 David L. Parnas Significant Event Simulation . . . . . . 323--329 2166 Robert B. K. Dewar Indirect Threaded Code . . . . . . . . . 330--331 2167 Ben Cranston and 2168 Rick Thomas Simplified Recombination Scheme for the 2169 Fibonacci Buddy System . . . . . . . . . 331--332 2170 Alfred V. Aho and 2171 Margaret J. Corasick Efficient String Matching: an Aid to 2172 Bibliographic Search . . . . . . . . . . 333--340 2173 D. S. Hirschberg A Linear Space Algorithm for Computing 2174 Maximal Common Subsequences . . . . . . 341--343 2175 Stephen Soule Addition in an Arbitrary Base Without 2176 Radix Conversion . . . . . . . . . . . . 344--346 2177 L. H. Harper and 2178 T. H. Payne and 2179 J. E. Savage and 2180 E. Straus Sorting $X + Y$ . . . . . . . . . . . . 347--350 (or 347--349??) 2181 F. Paul Wyman Improved Event-Scanning Mechanisms for 2182 Discrete Event Simulation . . . . . . . 350--353 2183 Donald E. Knuth and 2184 Charles T. Zahn, Jr. Ill-Chosen Use of ``Event'' . . . . . . 360--360 2185 2186Communications of the ACM 2187Volume 18, Number 7, July, 1975 2188 2189 P. J. Courtois Decomposability, Instabilities, and 2190 Saturation in Multiprogramming Systems 371--377 2191 Soren Lauesen A large semaphore based operating system 377--389 2192 Naomi Sager and 2193 Ralph Grishman Restriction Language for Computer 2194 Grammars of Natural Language . . . . . . 390--400 2195 D. L. Parnas and 2196 D. P. Siewiorek Use of the Concept of Transparency in 2197 the Design of Hierarchically Structured 2198 Systems . . . . . . . . . . . . . . . . 401--408 2199 H. Freeman and 2200 R. Shapira Determining the Minimum-Area Encasing 2201 Rectangle for an Arbitrary Closed Curve 409--413 2202 Daniel G. Bobrow A Note on Hash Linking . . . . . . . . . 413--415 2203 R. E. Weber and 2204 B. Gilchrist Discrimination in the employment of 2205 women in the computer industry . . . . . 416--418 2206 2207Communications of the ACM 2208Volume 18, Number 8, August, 1975 2209 2210 John E. Shore On the External Storage Fragmentation 2211 Produced by First-Fit and Best-Fit 2212 Allocation Strategies . . . . . . . . . 433--440 2213 A. V. Aho and 2214 S. C. Johnson and 2215 J. D. Ullman Deterministic Parsing of Ambiguous 2216 Grammars . . . . . . . . . . . . . . . . 441--452 2217 Edsger W. Dijkstra Guarded Commands, Nondeterminacy and 2218 Formal Derivation of Programs . . . . . 453--457 2219 L. W. Cotton Remark on stably updating mean and 2220 standard deviation of data . . . . . . . 458--458 2221 Stuart C. Shapiro and 2222 Stanley C. Kwasny Interactive Consulting via Natural 2223 Language . . . . . . . . . . . . . . . . 459--462 2224 John Todd Corrigendum: ``The Lemniscate 2225 Constants'' . . . . . . . . . . . . . . 462--462 2226 J. G. Vaucher and 2227 P. Duval Corrigendum: ``A comparison of 2228 simulation event list algorithms'' . . . 462--462 2229 A. J. Smith Comments on a paper by T. C. Chen and I. 2230 T. Ho . . . . . . . . . . . . . . . . . 463--463 2231 Sakti P. Ghosh Consecutive Storage of Relevant Records 2232 with Redundancy . . . . . . . . . . . . 464--471 2233 Leslie Lamport Multiple Byte Processing with Full-Word 2234 Instructions . . . . . . . . . . . . . . 471--475 2235 Keith Shwayder Combining Decision Rules in a Decision 2236 Table . . . . . . . . . . . . . . . . . 476--480 2237 2238Communications of the ACM 2239Volume 18, Number 9, September, 1975 2240 2241 Guy L. Steele, Jr. Multiprocessing Compactifying Garbage 2242 Collection . . . . . . . . . . . . . . . 495--508 2243 Jon Louis Bentley Multidimensional Binary Search Trees 2244 Used for Associative Searching . . . . . 509--517 2245 R. Mark Claudson Digital Simulation of River Plankton 2246 Population Dynamics . . . . . . . . . . 517--523 2247 William F. Piepmeier Optimal Balancing of I/O Requests to 2248 Disks . . . . . . . . . . . . . . . . . 524--527 2249 Ben Wegbreit Mechanical Program Analysis . . . . . . 528--539 2250 2251Communications of the ACM 2252Volume 18, Number 10, October, 1975 2253 2254 Rob Gerritsen A Preliminary System for the Design of 2255 DBTG Data Structures . . . . . . . . . . 551--557 2256 Nan C. Shu and 2257 Barron C. Housel and 2258 Vincent Y. Lum CONVERT: A High Level Translation 2259 Definition Language for Data Conversion 557--567 2260 John Miles Smith and 2261 Philip Yen-Tang Chang Optimizing the Performance of a 2262 Relational Algebra Data Base Interface 568--579 2263 M. M. Astrahan and 2264 D. D. Chamberlin Implementation of a Structured English 2265 Query Language . . . . . . . . . . . . . 580--588 2266 Fanica Gavril Merging with Parallel Processors . . . . 588--591 2267 M. Reiser and 2268 H. Kobayashi Horner's Rule for the Evaluation of 2269 General Closed Queueing Networks . . . . 592--593 2270 2271Communications of the ACM 2272Volume 18, Number 11, November, 1975 2273 2274 G. Salton and 2275 A. Wong and 2276 C. S. Yang A Vector Space Model for Automatic 2277 Indexing . . . . . . . . . . . . . . . . 613--620 2278 Raymond F. Boyce and 2279 Donald D. Chamberlin and 2280 W. Frank King, III and 2281 Michael M. Hammer Specifying Queries as Relational 2282 Expressions: The Square Data Sublanguage 621--628 2283 Henry F. Ledgard and 2284 Michael Marcotty A genealogy of control structures . . . 629--639 2285 Susan L. Graham and 2286 Steven P. Rhodes Practical Syntactic Error Recovery . . . 639--650 (or 639--649??) 2287 James R. Bitner and 2288 Edward M. Reingold Backtrack Programming Techniques . . . . 651--656 2289 Lawrence T. Kou and 2290 C. K. Wong A Note on the Set Basis Problem Related 2291 to the Compaction of Character Sets . . 656--657 2292 2293Communications of the ACM 2294Volume 18, Number 12, December, 1975 2295 2296 Peter Naur Programming Languages, Natural 2297 Languages, and Mathematics . . . . . . . 676--683 2298 John B. Goodenough Exception Handling: Issues and a 2299 Proposed Notation . . . . . . . . . . . 683--696 2300 Mehdi Jazayeri and 2301 William F. Ogden and 2302 William C. Rounds The Intrinsically Exponential Complexity 2303 of the Circularity Problem for Attribute 2304 Grammars . . . . . . . . . . . . . . . . 697--706 2305 Harry B. Hunt, III and 2306 Thomas G. Szymanski and 2307 Jeffrey D. Ullman On the Complexity of LR(k) Testing . . . 707--716 2308 Susan L. Graham and 2309 Mark Wegman A fast and usually linear algorithm for 2310 global flow analysis . . . . . . . . . . 716--716 2311 Richard J. Lipton Reduction: A Method of Proving 2312 Properties of Parallel Programs . . . . 717--721 2313 J. T. Schwartz Automatic Data Structure Choice in a 2314 Language of Very High Level . . . . . . 722--728 2315 2316Communications of the ACM 2317Volume 19, Number 1, January, 1976 2318 2319 Leonard Kleinrock and 2320 William E. Naylor and 2321 Holger Opderbeck A Study of Line Overhead in the ARPANET 3--13 2322 Neil C. Wilhelm An Anomaly in Disk Scheduling: A 2323 Comparison of FCFS and SSTF Seek 2324 Scheduling Using an Empirical Model for 2325 Disk Accesses . . . . . . . . . . . . . 13--18 (or 13--17??) 2326 Carson E. Agnew On Quadratic Adaptive Routing Algorithms 18--22 2327 P. L. Karlton and 2328 S. H. Fuller and 2329 R. E. Scroggs and 2330 E. B. Kaehler Performance of Height-Balanced Trees . . 23--28 2331 J. J. Florentin Information Reference Coding . . . . . . 29--33 2332 Charles R. Litecky and 2333 Gordon B. Davis Study of Errors, Error-Proneness, and 2334 Error Diagnosis in Cobol . . . . . . . . 33--37 2335 2336Communications of the ACM 2337Volume 19, Number 2, February, 1976 2338 2339 Donald E. Knuth Errata: ``Ancient Babylonian 2340 algorithms'' 2341 Gregor V. Bochmann Semantic Evaluation from Left to Right 55--62 2342 Ronald L. Rivest On Self-Organizing Sequential Search 2343 Heuristics . . . . . . . . . . . . . . . 63--67 2344 F. M. Ives Permutation Enumeration: Four New 2345 Permutation Algorithms . . . . . . . . . 68--72 2346 Alberto Martelli Application of Heuristic Search Methods 2347 to Edge and Contour Detection . . . . . 73--83 2348 Kenneth F. Siler A Stochastic Evaluation Model for 2349 Database Organizations in Data Retrieval 2350 Systems . . . . . . . . . . . . . . . . 84--95 2351 Ronald Fagin A Counterintuitive Example of Computer 2352 Paging . . . . . . . . . . . . . . . . . 96--97 2353 Ehud Artzy and 2354 James A. Hinds and 2355 Harry J. Saal A Fast Division Technique for Constant 2356 Divisors . . . . . . . . . . . . . . . . 98--101 2357 2358Communications of the ACM 2359Volume 19, Number 3, March, 1976 2360 2361 Allen Newell and 2362 Herbert A. Simon Computer Science as Empirical Inquiry: 2363 Symbols and Search . . . . . . . . . . . 113--126 2364 Jair M. Babad and 2365 Mario M. Modiano Joining Policies in a Multipriority 2366 Multiclass Batch Computer System . . . . 127--136 2367 F. E. Allen and 2368 J. Cocke A Program Data Flow Analysis Procedure 137--147 (or 137--146??) 2369 Naftaly Minski Intentional Resolution of Privacy 2370 Protection in Database Systems . . . . . 148--159 2371 M. Naftaly Intentional resolution of privacy 2372 protection in database systems . . . . . 148--159 2373 2374Communications of the ACM 2375Volume 19, Number 4, April, 1976 2376 2377 O. R. Smoot Development of an international system 2378 for legal protection of computer 2379 programs . . . . . . . . . . . . . . . . 171--174 2380 Bennet P. Lientz A comparative evaluation of versions of 2381 BASIC . . . . . . . . . . . . . . . . . 175--181 2382 J. Raymond LG: A language for analytic geometry . . 182--187 2383 Ronald Fagin Corrigendum: ``A Counterintuitive 2384 Example of Computer Paging'' . . . . . . 187 2385 Shmuel Katz and 2386 Zohar Manna Logical Analysis of Programs . . . . . . 188--206 2387 2388Communications of the ACM 2389Volume 19, Number 5, May, 1976 2390 2391 Dorothy E. Denning A Lattice Model of Secure Information 2392 Flow . . . . . . . . . . . . . . . . . . 236--243 2393 Jonathan K. Millen Security Kernel Validation in Practice 243--250 2394 Butler W. Lampson and 2395 Howard E. Sturgis Reflections on an Operating System 2396 Design . . . . . . . . . . . . . . . . . 251--265 2397 A. N. Habermann and 2398 Lawrence Flon and 2399 Lee Cooprider Modularization and Hierarchy in a Family 2400 of Operating Systems . . . . . . . . . . 266--272 2401 John H. Howard Proving Monitors . . . . . . . . . . . . 273--279 (or 273--278??) 2402 Susan Owicki and 2403 David Gries Verifying Properties of Parallel 2404 Programs: An Axiomatic Approach . . . . 279--285 2405 A. Wayne Madison and 2406 Alan P. Batson Characteristics of Program Localities 285--294 2407 Barton G. Prieve and 2408 R. S. Fabry VMIN --- an Optimal Variable-Space Page 2409 Replacement Algorithm . . . . . . . . . 295--297 2410 Wesley W. Chu and 2411 Holger Opderbeck Analysis of the PFF Replacement 2412 Algorithm via a Semi-Markov Model . . . 298--304 2413 2414Communications of the ACM 2415Volume 19, Number 6, June, 1976 2416 2417 O. E. Taulbee and 2418 S. D. Conte Production and employment of Ph.D.'s in 2419 computer science . . . . . . . . . . . . 311--313 2420 Dennis G. Severance and 2421 Ricardo A. Duhne A Practitioner's Guide to Addressing 2422 Algorithms . . . . . . . . . . . . . . . 314--326 2423 Forest Baskett and 2424 Alan Jay Smith Interference in Multiprocessor Computer 2425 Systems with Interleaved Memory . . . . 327--334 2426 Gideon Frieder and 2427 Harry J. Saal Process for the Determination of 2428 Addresses in Variable Length Addressing 335--338 2429 David S. Wise Referencing Lists by an Edge . . . . . . 338--342 2430 Helmut Schumacher and 2431 Kenneth C. Sevcik The synthetic approach to decision table 2432 conversion . . . . . . . . . . . . . . . 343--351 2433 Douglas W. Clark An Efficient List Moving Algorithm Using 2434 constant Workspace . . . . . . . . . . . 352--354 (or 353--354??) 2435 Guy L. Steele, Jr. Corrigendum: ``Multiprocessing 2436 Compactifying Garbage Collection'' . . . 354--354 2437 Gary D. Knott A Numbering System for Permutations of 2438 Combinations . . . . . . . . . . . . . . 355--356 2439 2440Communications of the ACM 2441Volume 19, Number 7, July, 1976 2442 2443 S. D. Conte and 2444 M. H. Halstead Technology of Computer Center 2445 Management: a Proposed Course for 2446 Graduate Professional Programs in 2447 Computer Science or in Information 2448 Systems . . . . . . . . . . . . . . . . 369--370 2449 Robert M. Keller Formal Verification of Parallel Programs 371--384 2450 James C. King Symbolic Execution and Program Testing 385--394 2451 Robert M. Metcalfe and 2452 David R. Boggs Ethernet: Distributed Packet Switching 2453 for Local Computer Networks . . . . . . 395--404 2454 Cheng-Wen Cheng and 2455 Jonas Rabin Synthesis of Decision Rules . . . . . . 404--406 2456 George S. Fishman Sampling from the Gamma-distribution on 2457 a computer . . . . . . . . . . . . . . . 407--409 2458 Kurt Maly Compressed Tries . . . . . . . . . . . . 409--415 2459 Warren Burton A buddy system variation for disk 2460 storage allocation . . . . . . . . . . . 416--417 2461 G. H. Gonnet Heaps applied to event driven mechanisms 417--418 2462 2463Communications of the ACM 2464Volume 19, Number 8, August, 1976 2465 2466 John J. Donovan Tools and Philosophy for Software 2467 Education . . . . . . . . . . . . . . . 430--436 2468 R. D. Tennent The Denotational Semantics of 2469 Programming Languages . . . . . . . . . 437--453 2470 James H. Clark Designing Surfaces in 3-D . . . . . . . 454--460 2471 Michael A. Harrison and 2472 Walter L. Ruzzo and 2473 Jeffrey D. Ullman Protection in Operating Systems . . . . 461--471 2474 D. S. Hirschberg An Insertion Technique for One-Sided 2475 Height-Balanced Trees . . . . . . . . . 471--473 2476 2477Communications of the ACM 2478Volume 19, Number 9, September, 1976 2479 2480 Wesley W. Chu and 2481 Holger Opderbeck Corrigendum: ``Analysis of the PFF 2482 replacement algorithm via a semi-Markov 2483 model'' 2484 Ben Wegbreit Corrigendum: ``Faster Retrieval from 2485 Context Trees'' . . . . . . . . . . . . ?? 2486 Philip L. Wadler Analysis of an Algorithm for Real Time 2487 Garbage Collection . . . . . . . . . . . 491--500 2488 Chee K. Yap New Upper Bounds for Selection . . . . . 501--508 2489 Michael C. Loui Weighted Derivation Trees . . . . . . . 509--513 2490 Kenneth G. Walter Recursion Analysis for Compiler 2491 Optimization . . . . . . . . . . . . . . 514--516 2492 James R. Bitner and 2493 Gideon Ehrlich and 2494 Edward M. Reingold Efficient Generation of the Binary 2495 Reflected Gray Code and Its Applications 517--521 2496 L. Peter Deutsch and 2497 Daniel G. Bobrow An Efficient, Incremental, Automatic 2498 Garbage Collector . . . . . . . . . . . 522--526 2499 Ben Wegbreit Faster Retrieval from Context Trees . . 526--529 2500 2501Communications of the ACM 2502Volume 19, Number 10, October, 1976 2503 2504 James F. Blinn and 2505 Martin E. Newell Texture and Reflection in Computer 2506 Generated Images . . . . . . . . . . . . 542--547 2507 James H. Clark Hierarchical Geometric Models for 2508 Visible Surface Algorithms . . . . . . . 547--554 2509 Joshua Z. Levin A Parametric Algorithm for Drawing 2510 Pictures of Solid Objects Composed of 2511 Quadric Surfaces . . . . . . . . . . . . 555--563 2512 N. Burtnyk and 2513 M. Wein Interactive Skeleton Techniques for 2514 Enhancing Motion Dynamics in Key Frame 2515 Animation . . . . . . . . . . . . . . . 564--569 2516 James W. Frane The BMD and BMDP Series of Statistical 2517 Computer Programs . . . . . . . . . . . 570--576 2518 C. Duong-Kien and 2519 H.-J. Hoffmann and 2520 D. Muth An improvement to Martin's algorithm for 2521 computation of linear precedence 2522 functions . . . . . . . . . . . . . . . 576--577 2523 Richard G. Montanelli, Jr. and 2524 Sandra A. Mamrak Status of Women and Minorities in 2525 Academic Computer Science . . . . . . . 578--581 2526 2527Communications of the ACM 2528Volume 19, Number 11, November, 1976 2529 2530 D. T. Ross Homilies for humble standards (computer 2531 applications) . . . . . . . . . . . . . 595--600 2532 Henry F. Ledgard and 2533 William C. Cave Cobol Under Control . . . . . . . . . . 601--608 2534 Thomas R. Wilcox and 2535 Alan M. Davis and 2536 Michael H. Tindall Design and Implementation of a Table 2537 Driven, Interactive Diagnostic 2538 Programming System . . . . . . . . . . . 609--616 2539 Frank Rubin Experiments in Text File Compression . . 617--623 (or 617--622??) 2540 K. P. Eswaran and 2541 J. N. Gray and 2542 R. A. Lorie and 2543 I. L. Traiger The notions of consistency and predicate 2544 locks in a database system . . . . . . . 624--633 2545 K. Maruyama and 2546 S. E. Smith Optimal Reorganization of Distributed 2547 Space Disk Files . . . . . . . . . . . . 634--642 2548 Richard G. Hamlet High-Level Binding with Low-Level 2549 Linkers . . . . . . . . . . . . . . . . 642--644 2550 2551Communications of the ACM 2552Volume 19, Number 12, December, 1976 2553 2554 Jean E. Sammet Roster of Programming Languages for 2555 1974--75 . . . . . . . . . . . . . . . . 655--669 2556 Bruce W. Arden The Computer Science and Engineering 2557 Research Study (COSERS) . . . . . . . . 670--673 2558 J. F. Nunamaker, Jr. and 2559 Benn R. Konsynski, Jr. and 2560 Thomas Ho and 2561 Carl Singer Computer-Aided Analysis and Design of 2562 Information Systems . . . . . . . . . . 674--687 2563 George Stockman and 2564 Laveen Kanal and 2565 M. C. Kyle Structural Pattern Recognition of 2566 Carotid Pulse Waves Using a General 2567 Waveform Parsing System . . . . . . . . 688--695 2568 2569Communications of the ACM 2570Volume 20, Number 1, January, 1977 2571 2572 Allen van Gelder Structured programming in COBOL: an 2573 approach for application programmers . . 2--12 2574 Richard H. Austing and 2575 Bruce H. Barnes and 2576 Gerald L. Engel A Survey of the Literature in Computer 2577 Science Education Since Curriculum '68 13--21 2578 Jair M. Babad A Record and File Partitioning Model . . 22--31 (or 22--30??) 2579 Albert L. Zobrist and 2580 Frederick R. Carlson, Jr. Detection of Combined Occurrences . . . 31--36 (or 31--35??) 2581 A. P. Batson and 2582 R. E. Brundage Segment Sizes and Lifetimes in Algol 60 2583 Programs . . . . . . . . . . . . . . . . 36--44 2584 David Gries On Believing Programs to be Correct . . 49--50 2585 2586Communications of the ACM 2587Volume 20, Number 2, February, 1977 2588 2589 Mervin E. Muller An Approach to Multidimensional Data 2590 Array Processing by Computer . . . . . . 63--77 2591 Douglas W. Clark and 2592 C. Cordell Green An Empirical Study of List Structure in 2593 LISP . . . . . . . . . . . . . . . . . . 78--87 2594 F. P. Preparata and 2595 S. J. Hong Convex Hulls of Finite Sets of Points in 2596 Two and Three Dimensions . . . . . . . . 87--93 2597 M. C. Easton and 2598 B. T. Bennett Transient-Free Working-Set Statistics 93--99 2599 Jack Bresenham A Linear Algorithm for Incremental 2600 Digital Display of Circular Arcs . . . . 100--106 2601 Thoddi C. T. Kotiah and 2602 David I. Steinberg Occurrences of Cycling and Other 2603 Phenomena Arising in a Class of Linear 2604 Programming Models . . . . . . . . . . . 107--112 2605 Gary D. Knott A Numbering System for Binary Trees . . 113--115 2606 2607Communications of the ACM 2608Volume 20, Number 3, March, 1977 2609 2610 Philip Clapson Improving the Access Time for Random 2611 Access Files . . . . . . . . . . . . . . 127--135 2612 C. T. Yu and 2613 G. Salton Effective Information Retrieval Using 2614 Term Accuracy . . . . . . . . . . . . . 135--142 2615 Amund Lunde Empirical Evaluation of Some Features of 2616 Instruction Set Processor Architectures 143--153 2617 R. M. Brown and 2618 J. C. Browne and 2619 K. M. Chandy Memory Management and Response Time . . 153--165 2620 Warren Burton Representation of Many-Sided Polygons 2621 and Polygonal Lines for Rapid Processing 166--171 2622 H. B. Hunt, III and 2623 T. G. Szymanski and 2624 J. D. Ullman Operations on Sparse Relations . . . . . 171--176 2625 Richard L. Nolan Effects of Chargeout on User/Manager 2626 Attitudes . . . . . . . . . . . . . . . 177--185 2627 Israel Borovits and 2628 Philip Ein-Dor Cost/utilization: A measure of system 2629 performance . . . . . . . . . . . . . . 185--191 2630 C. Bays A comparison of next-fit, first-fit, and 2631 best-fit . . . . . . . . . . . . . . . . 191--192 2632 Eberhard Bertsch The storage requirement in precedence 2633 parsing . . . . . . . . . . . . . . . . 192--196 (or 192--194??) 2634 2635Communications of the ACM 2636Volume 20, Number 4, April, 1977 2637 2638 James H. Morris, Jr. and 2639 Ben Wegbreit Subgoal Induction . . . . . . . . . . . 209--222 2640 Steven L. Tanimoto and 2641 Theodosios Pavlidis Editing of Picture Segmentations Using 2642 Local Analysis of Graphs . . . . . . . . 223--229 2643 Nicholas V. Findler Studies in Machine Cognition Using the 2644 Game of Poker . . . . . . . . . . . . . 230--245 2645 K. Maruyama and 2646 S. E. Smith Analysis of Design Alternatives for 2647 Virtual Memory Indexes . . . . . . . . . 245--254 2648 Henry C. Lucas, Jr. and 2649 Jimmy A. Sutton Stage Hypothesis and the S-Curve: Some 2650 Contradictory Evidence . . . . . . . . . 254--259 2651 S. B. Yao Approximating block accesses in database 2652 organizations . . . . . . . . . . . . . 260--261 2653 C. R. Hollander Remark on uniform insertion on 2654 structured data structures . . . . . . . 261--262 2655 S. K. Bandyopadhyay Comment on weighted increment linear 2656 search for scatter tables . . . . . . . 262--263 2657 C. D. Thompson and 2658 H. T. Kung Sorting on a Mesh-Connected Parallel 2659 Computer . . . . . . . . . . . . . . . . 263--271 2660 Lawrence Robinson and 2661 Karl N. Levitt Proof Techniques for Hierarchically 2662 Structured Programs . . . . . . . . . . 271--283 2663 2664Communications of the ACM 2665Volume 20, Number 5, May, 1977 2666 2667 R. C. Holt and 2668 D. B. Wortman and 2669 D. T. Barnard and 2670 J. R. Cordy SP/k: A System for Teaching Computer 2671 Programming . . . . . . . . . . . . . . 301--309 2672 George S. Fishman Achieving Specific Accuracy in 2673 Simulation Output Analysis . . . . . . . 310--315 2674 Howard L. Morgan and 2675 K. Dan Levin Optimal Program and Data Locations in 2676 Computer Networks . . . . . . . . . . . 315--322 2677 J.-L. Baer and 2678 B. Schwab A Comparison of Tree-Balancing 2679 Algorithms . . . . . . . . . . . . . . . 322--330 2680 Neil J. Stillman and 2681 P. Bruce Berra A Comparison of Hardware and Software 2682 Associative Memories in the Context of 2683 Computer Graphics . . . . . . . . . . . 331--339 2684 Marvin Shapiro Choice of Reference Points in Best-Match 2685 File Searching . . . . . . . . . . . . . 339--343 2686 Michael Z. Hanani An Optimal Evaluation of Boolean 2687 Expressions in an Online Query System 344--347 2688 Y. Milman An Approach to Optimal Design of Storage 2689 Parameters in Databases . . . . . . . . 347--350 2690 James W. Hunt and 2691 Thomas G. Szymanski A Fast Algorithm for Computing Longest 2692 Common Subsequences . . . . . . . . . . 350--353 2693 2694Communications of the ACM 2695Volume 20, Number 6, June, 1977 2696 2697 Orrin E. Taulbee and 2698 S. D. Conte Production and Employment of Ph.D.'s in 2699 Computer Science --- 1976 . . . . . . . 370--372 2700 Ben Shneiderman and 2701 Richard Mayer and 2702 Don McKay and 2703 Peter Heller Experimental Investigations of the 2704 Utility of Detailed Flowcharts in 2705 Programming . . . . . . . . . . . . . . 373--381 2706 H. F. Ledgard and 2707 R. W. Taylor Two Views of Data Abstraction . . . . . 382--384 2708 Moshe M. Zloof and 2709 S. Peter de Jong The System for Business Automation 2710 (SBA): Programming Language . . . . . . 385--396 2711 John V. Guttag Abstract Data Types and the Development 2712 of Data Structures . . . . . . . . . . . 396--404 2713 John Miles Smith and 2714 Diane C. P. Smith Database Abstractions: Aggregation . . . 405--413 2715 David Gries and 2716 Narain Gehani Some Ideas on Data Types in High-Level 2717 Languages . . . . . . . . . . . . . . . 414--420 2718 James L. Peterson and 2719 Theodore A. Norman Buddy Systems . . . . . . . . . . . . . 421--431 2720 J. M. Robson A Bounded Storage Algorithm for Copying 2721 Cyclic Structures . . . . . . . . . . . 431--433 2722 R. S. Bird Notes on Recursion Elimination . . . . . 434--439 2723 Henry S. Warren, Jr. Functions Realizable with Word-Parallel 2724 Logical and Two's-Complement Addition 2725 Instructions . . . . . . . . . . . . . . 439--441 2726 2727Communications of the ACM 2728Volume 20, Number 7, July, 1977 2729 2730 Sandra A. Mamrak Dynamic Response Time Prediction for 2731 Computer Networks . . . . . . . . . . . 461--468 2732 Manfred Ruschitzka and 2733 R. S. Fabry A Unifying Approach to Scheduling . . . 469--477 2734 William D. Tajibnapis A Correctness Proof of a Topology 2735 Information Maintenance Protocol for a 2736 Distributed Computer Network . . . . . . 477--485 2737 Paul G. Heckel and 2738 Butler W. Lampson A terminal-oriented communication system 486--494 2739 Ben Ross Schneider, Jr. and 2740 Reid M. Watts SITAR: an Interactive Text Processing 2741 System for Small Computers . . . . . . . 495--499 2742 J. L. W. Kessels Alternative to Event Queues for 2743 Synchronization in Monitors . . . . . . 500--503 2744 Dorothy E. Denning and 2745 Peter J. Denning Certification of Programs for Secure 2746 Information Flow . . . . . . . . . . . . 504--513 2747 Jeffrey M. Barth Shifting Garbage Collection Overhead to 2748 Compile Time . . . . . . . . . . . . . . 513--518 2749 E. A. Ashcroft and 2750 W. W. Wadge Lucid, a Nonprocedural Language with 2751 Iteration . . . . . . . . . . . . . . . 519--526 2752 J. Nevil Brownlee An Algol-based implementation of SNOBOL 2753 4 patterns . . . . . . . . . . . . . . . 527--529 2754 2755Communications of the ACM 2756Volume 20, Number 8, August, 1977 2757 2758 Charles M. Geschke and 2759 James H. Morris, Jr. and 2760 Edwin H. Satterthwaite Early Experience with Mesa . . . . . . . 540--553 2761 Mary Shaw and 2762 William A. Wulf and 2763 Ralph L. London Abstraction and Verification in Alphard: 2764 Defining and Specifying Iteration and 2765 Generators . . . . . . . . . . . . . . . 553--564 2766 Barbara Liskov and 2767 Alan Snyder and 2768 Russell Atkinson and 2769 Craig Schaffert Abstraction Mechanisms in CLU . . . . . 564--576 2770 Niklaus Wirth Toward a Discipline of Real-Time 2771 Programming . . . . . . . . . . . . . . 577--583 2772 J. D. Gannon An experimental evaluation of data type 2773 conventions . . . . . . . . . . . . . . 584--595 2774 W. R. Franta and 2775 Kurt Maly An Efficient Data Structure for the 2776 Simulation Event Set . . . . . . . . . . 596--602 2777 Eugene L. Lawler Comment on computing the $k$ shortest 2778 paths in a graph . . . . . . . . . . . . 603--604 2779 N. Francez Another advantage of keyword notation 2780 for parameter communication with 2781 subprograms . . . . . . . . . . . . . . 604--605 2782 2783Communications of the ACM 2784Volume 20, Number 9, September, 1977 2785 2786 Michael O. Rabin Complexity of Computations . . . . . . . 625--633 2787 Dana S. Scott Logic and Programming Languages . . . . 634--641 2788 Richard H. Austing The GRE Advanced Test in Computer 2789 Science . . . . . . . . . . . . . . . . 642--645 2790 Robert W. Scheifler An Analysis of Inline Substitution for a 2791 Structured Programming Language . . . . 647--654 2792 David K. Gifford Hardware Estimation of a Process' 2793 Primary Memory Requirements . . . . . . 655--663 2794 Harry G. Mairson Some New Upper Bounds on the Generation 2795 of Prime Numbers . . . . . . . . . . . . 664--669 2796 Edward M. McCreight Pagination of B*-Trees with 2797 Variable-Length Records . . . . . . . . 670--674 2798 2799Communications of the ACM 2800Volume 20, Number 10, October, 1977 2801 2802 H. Fuchs and 2803 Z. M. Kedem and 2804 S. P. Uselton Optimal Surface Reconstruction from 2805 Planar Contours . . . . . . . . . . . . 693--702 2806 Sheng-Chuan C. Wu and 2807 John F. Abel and 2808 Donald P. Greenberg An Interactive Computer Graphics 2809 Approach to Surface Representation . . . 703--712 2810 Barry K. Rosen High-Level Data Flow Analysis . . . . . 712--724 2811 C. Montangero and 2812 G. Pacini and 2813 F. Turini Two-Level Control Structure for 2814 Nondeterministic Programming . . . . . . 725--730 2815 Wilf R. LaLonde Regular Right Part Grammars and Their 2816 Parsers . . . . . . . . . . . . . . . . 731--741 2817 R. Devillers Game Interpretation of the Deadlock 2818 Avoidance Problem . . . . . . . . . . . 741--745 2819 Evan L. Ivie Programmer's Workbench --- a Machine for 2820 Software Development . . . . . . . . . . 746--753 2821 Alan Jay Smith Multiprocessor Memory Organization and 2822 Memory Interference . . . . . . . . . . 754--761 2823 Robert S. Boyer and 2824 J. Strother Moore A Fast String Searching Algorithm . . . 762--772 2825 2826Communications of the ACM 2827Volume 20, Number 11, November, 1977 2828 2829 J. A. N. Lee Considerations for future programming 2830 language standards activities . . . . . 788--794 2831 Rollins Turner and 2832 Bill Strecker Use of the LRU Stack Depth Distribution 2833 for Simulation of Paging Behavior . . . 795--798 2834 Franklin C. Crow The Aliasing Problem in 2835 Computer-Generated Shaded Images . . . . 799--805 2836 Leslie Lamport Concurrent Reading and Writing . . . . . 806--811 2837 John E. Shore Anomalous Behavior of the Fifty-Percent 2838 Rule in Dynamic Memory Allocation . . . 812--820 2839 G. C. Stockman and 2840 A. K. Agrawala Equivalence of Hough curve detection to 2841 template matching . . . . . . . . . . . 820--822 2842 N. Wirth What can we do about the unnecessary 2843 diversity of notation for syntactic 2844 definitions? . . . . . . . . . . . . . . 822--823 2845 M. K. Roy A note on reflection-free permutation 2846 enumeration . . . . . . . . . . . . . . 823--823 2847 Zohar Manna and 2848 Adi Shamir The Optimal Approach to Recursive 2849 Programs . . . . . . . . . . . . . . . . 824--831 2850 Michael Hammer and 2851 W. Gerry Howe and 2852 Vincent J. Kruskal and 2853 Irving Wladawsky Very High Level Programming Language for 2854 Data Processing Applications . . . . . . 832--840 2855 Renzo Sprugnoli Perfect Hashing Functions: A Single 2856 Probe Retrieving Method for Static Sets 841--850 2857 John Cocke and 2858 Ken Kennedy An Algorithm for Reduction of Operator 2859 Strength . . . . . . . . . . . . . . . . 850--856 2860 R. S. Bird Improving Programs by the Introduction 2861 of Recursion . . . . . . . . . . . . . . 856--863 2862 Norman R. Nielsen Dynamic Memory Allocation in Computer 2863 Simulation . . . . . . . . . . . . . . . 864--873 2864 Michael W. Blasgen and 2865 Richard G. Casey and 2866 Kapali P. Eswaran An Encoding Method for Multifield 2867 Sorting and Indexing . . . . . . . . . . 874--878 2868 Enrique Grapa and 2869 Geneva G. Belford Some Theorems to Aid in Solving the File 2870 Allocation Problem . . . . . . . . . . . 878--882 2871 2872Communications of the ACM 2873Volume 20, Number 12, December, 1977 2874 2875 A. A. Lopez and 2876 R. Raymond and 2877 R. Tardiff A survey of computer science offerings 2878 in small liberal arts colleges . . . . . 902--906 2879 J. L. W. Kessels A Conceptual Framework for a 2880 Nonprocedural Programming Language . . . 906--913 2881 J. Lawrence Carter A Case Study of a New Code Generation 2882 Technique for Compilers . . . . . . . . 914--920 2883 David Gries An Exercise in Proving Parallel Programs 2884 Correct . . . . . . . . . . . . . . . . 921--930 2885 Irene Grief A language for formal problem 2886 specification . . . . . . . . . . . . . 931--935 2887 Marshall D. Abrams and 2888 Siegfried Treu A Methodology for Interactive Computer 2889 Service Measurement . . . . . . . . . . 936--944 2890 J. N. Danziger and 2891 W. H. Dutton Computers as an innovation in American 2892 local governments . . . . . . . . . . . 945--956 2893 2894Communications of the ACM 2895Volume 24, Number 1, January, 1977 2896 2897 P. D. Summers A Methodology for LISP Program 2898 Construction from Examples . . . . . . . 161--175 2899 S. H. Lavington The Manchester Mark I and Atlas: a 2900 historical perspective . . . . . . . . . 4--12 2901 R. N. Ibbett and 2902 P. C. Capon The development of the MU5 computer 2903 system . . . . . . . . . . . . . . . . . 13--24 2904 B. R. Borgerson and 2905 M. L. Hanson and 2906 P. A. Hartley Evolution of the Sperry Univac 1100 2907 Series: a History, Analysis, and 2908 Projection . . . . . . . . . . . . . . . 25--43 2909 C. G. Bell and 2910 A. Kotok and 2911 T. N. Hastings and 2912 R. Hill The Evolution of the DECsystem 10 . . . 44--63 2913 Richard M. Russell The CRAY-1 Computer System . . . . . . . 63--72 2914 Richard P. Case and 2915 Andris Padegs Architecture of the IBM System/370 . . . 73--96 2916 2917Communications of the ACM 2918Volume 21, Number 2, February, 1978 2919 2920 S. A. Mamrak and 2921 R. G. Montanelli, Jr. Computer science faculties: the current 2922 status of minorities and women . . . . . 115--119 2923 R. L. Rivest and 2924 A. Shamir and 2925 L. Adelman A Method for Obtaining Digital 2926 Signatures and Public-Key Cryptosystems 120--126 2927 M. A. Auslander and 2928 H. R. Strong Systematic Recursion Removal . . . . . . 127--134 2929 L. T. Kou and 2930 L. J. Stockmeyer and 2931 C. K. Wong Covering Edges by Cliques with Regard to 2932 Keyword Conflicts and Intersection 2933 Graphs . . . . . . . . . . . . . . . . . 135--139 2934 Gerald Held and 2935 Michael Stonebraker B-Trees Re-Examined . . . . . . . . . . 139--143 2936 William J. Stewart A Comparison of Numerical Techniques in 2937 Markov Modeling . . . . . . . . . . . . 144--152 2938 Gabor T. Herman and 2939 Arnold Lent and 2940 Peter H. Lutz Relaxation Methods for Image 2941 Reconstruction . . . . . . . . . . . . . 152--158 2942 Zohar Manna and 2943 Richard Waldinger Is `Sometime' Sometimes Better Than 2944 `Always'? (Intermittent Assertions in 2945 Proving Program Correctness) . . . . . . 159--172 2946 Bruce J. Schachter and 2947 Azriel Rosenfeld Some New Methods of Detecting Step Edges 2948 in Digital Pictures . . . . . . . . . . 172--176 2949 2950Communications of the ACM 2951Volume 21, Number 3, March, 1978 2952 2953 Michael O. Rabin Corrigendum: ``Complexity of 2954 computations'' 2955 Henry C. Lucas, Jr. Use of an Interactive Information 2956 Storage and Retrieval System in Medical 2957 Research . . . . . . . . . . . . . . . . 197--205 2958 William H. Dutton and 2959 Kenneth L. Kraemer Management Utilization of Computers in 2960 American Local Governments . . . . . . . 206--218 2961 R. E. Anderson Value orientation of computer science 2962 students . . . . . . . . . . . . . . . . 219--225 2963 S. Rao Kosaraju Insertions and Deletions in One-Sided 2964 Height-Balanced Trees . . . . . . . . . 226--227 2965 Richard A. DeMillo and 2966 Stanley C. Eisenstat and 2967 Richard J. Lipton Preserving Average Proximity in Arrays 228--231 2968 M. A. Franklin and 2969 G. Scott Graham and 2970 R. K. Gupta Anomalies with Variable Partition Paging 2971 Algorithms . . . . . . . . . . . . . . . 232--236 2972 Andrew S. Tanenbaum Implications of Structured Programming 2973 for Machine Architecture . . . . . . . . 237--246 2974 2975Communications of the ACM 2976Volume 21, Number 4, April, 1978 2977 2978 W. H. Payne and 2979 K. L. McMillen Orderly Enumeration of Nonsingular 2980 Binary Matrices Applied to Text 2981 Encryption . . . . . . . . . . . . . . . 259--263 2982 Paul Heckel A Technique for Isolating Differences 2983 Between Files . . . . . . . . . . . . . 264--268 2984 Art Lew Optimal Conversion of Extended-Entry 2985 Decision Tables with General Cost 2986 Criteria . . . . . . . . . . . . . . . . 269--279 2987 Henry G. Baker, Jr. List Processing in Real Time on a Serial 2988 Computer . . . . . . . . . . . . . . . . 280--294 2989 Ralph C. Merkle Secure Communications Over Insecure 2990 Channels . . . . . . . . . . . . . . . . 294--299 2991 Thomas G. Szymanski Assembling Code for machines with 2992 Span-Dependent Instructions . . . . . . 300--308 2993 Jean Vuillemin A Data Structure for Manipulating 2994 Priority Queues . . . . . . . . . . . . 309--315 2995 S. Even and 2996 M. Rodeh Economical Encoding of Commas Between 2997 Strings . . . . . . . . . . . . . . . . 315--317 2998 R. C. H. Cheng Generating beta variates with 2999 nonintegral shape parameters . . . . . . 317--322 3000 3001Communications of the ACM 3002Volume 21, Number 5, May, 1978 3003 3004 Douglas W. Clark A Fast Algorithm for Copying List 3005 Structures . . . . . . . . . . . . . . . 351--357 3006 Anita K. Jones and 3007 Barbara H. Liskov A Language Extension for Expressing 3008 Constraints on Data Access . . . . . . . 358--367 3009 Matthew Geller Test Data as an Aid in Proving Program 3010 Correctness . . . . . . . . . . . . . . 368--375 3011 James R. Low Automatic Data Structure Selection: an 3012 Example and Overview . . . . . . . . . . 376--385 3013 Michael Karr and 3014 David B. Loveman III Incorporation of Units into Programming 3015 Languages . . . . . . . . . . . . . . . 385--391 3016 David R. Hanson and 3017 Ralph E. Griswold The SL5 procedure mechanism . . . . . . 392--400 3018 Frederick Hayes-Roth and 3019 John McDermott An Interference Matching Technique for 3020 Inducing Abstractions . . . . . . . . . 401--411 3021 J. M. Fleisher and 3022 R. R. Meyer New Sufficient Optimality Conditions for 3023 Integer Programming and Their 3024 Application . . . . . . . . . . . . . . 411--418 3025 Pandu R. Tadikamalla Computer Generation of Gamma Random 3026 Variables . . . . . . . . . . . . . . . 419--422 3027 Richard L. Sites Optimal Shift Strategy for a 3028 Block-Transfer CCD Memory . . . . . . . 423--425 3029 3030Communications of the ACM 3031Volume 21, Number 6, June, 1978 3032 3033 S. H. Zweben and 3034 M. A. McDonald An Optimal Method for Deletion in 3035 One-Sided Height-Balanced Trees . . . . 441--445 3036 James R. Driscoll and 3037 Y. Edmund Lien A Selective Traversal Algorithm for 3038 Binary Search Trees . . . . . . . . . . 445--447 3039 Jacques Cohen and 3040 Martin S. Roth Analyses of Deterministic Parsing 3041 Algorithms . . . . . . . . . . . . . . . 448--458 3042 M. Dennis Mickunas and 3043 John A. Modry Automatic Error Recovery for LR Parsers 459--465 3044 B. P. Lientz and 3045 E. B. Swanson and 3046 G. E. Tompkins Characteristics of Application Software 3047 Maintenance . . . . . . . . . . . . . . 466--471 3048 Earl Chrysler Some Basic Determinants of Computer 3049 Programming Productivity . . . . . . . . 472--483 3050 Rob Kling Automated Welfare Client-Tracking and 3051 Service Integration: the Political 3052 Economy of Computing . . . . . . . . . . 484--493 3053 E. Gelenbe and 3054 D. Derochette Performance of Rollback Recovery Systems 3055 Under Intermittent Failures . . . . . . 493--499 3056 Toby J. Teorey General Equations for Idealized CPU-I/O 3057 Overlap Configurations . . . . . . . . . 500--507 3058 3059Communications of the ACM 3060Volume 21, Number 7, July, 1978 3061 3062 David L. Waltz An English Language Query Answering 3063 System for a Large Relational Data Base 526--539 3064 Michael L. Fredman and 3065 Bruce Weide On the complexity of computing the 3066 measure of $\bigcup[a_i,b_i]$ . . . . . 540--544 3067 Francis Y. Chin An ${O}(n)$ Algorithm for Determining a 3068 Near-Optimal Computation Order of Matrix 3069 Chain Products . . . . . . . . . . . . . 544--549 3070 Yehoshua Perl and 3071 Alon Itai and 3072 Haim Avni Interpolation Search --- A Log Log N 3073 Search . . . . . . . . . . . . . . . . . 550--553 3074 Constantine Halatsis and 3075 George Philokyprou Pseudochaining in Hash Tables . . . . . 554--557 3076 Leslie Lamport Time, Clocks, and the Ordering of Events 3077 in a Distributed System . . . . . . . . 558--565 3078 Henry Givens Baker, Jr. Shallow Binding in Lisp 1.5 . . . . . . 565--569 3079 Hanan Samet Proving the Correctness of Heuristically 3080 Optimized Code . . . . . . . . . . . . . 570--582 3081 Robert E. Shostak An Algorithm for Reasoning About 3082 Equality . . . . . . . . . . . . . . . . 583--585 3083 Rahul Chattergy and 3084 Udo W. Pooch Analysis of the Availability of Computer 3085 Systems Using Computer-Aided Algebra . . 586--591 3086 Lawrence Snyder B-Trees Re-examined . . . . . . . . . . 594--594 3087 3088Communications of the ACM 3089Volume 21, Number 8, August, 1978 3090 3091 John Backus Can Programming Be Liberated From the 3092 von Neumann Style? A Functional Style 3093 and its Algebra of Programs . . . . . . 613--641 3094 R. Kling Value conflicts and social choice in 3095 electronic funds transfer system 3096 developments . . . . . . . . . . . . . . 642--657 3097 D. S. Hirschberg Fast Parallel Sorting Algorithms . . . . 657--661 3098 F. Lockwood Morris A Time- and Space-Efficient Garbage 3099 Compaction Algorithm . . . . . . . . . . 662--665 3100 C. A. R. Hoare Communicating Sequential Processes . . . 666--677 3101 Richard S. Brice and 3102 J. C. Browne Feedback Coupled Resource Allocation 3103 Policies in the 3104 Multiprogramming-Multiprocessor Computer 3105 System . . . . . . . . . . . . . . . . . 678--686 3106 Peter Scheuermann and 3107 C. Robert Carlson Self-Assessment Procedure V: a 3108 self-assessment procedure dealing with 3109 database systems . . . . . . . . . . . . 687--693 3110 3111Communications of the ACM 3112Volume 21, Number 9, September, 1978 3113 3114 R. A. Harris and 3115 J. D. Zund An algorithm using symbolic techniques 3116 for the Bel-Petrov classification of 3117 gravitational fields . . . . . . . . . . 715--717 3118 H. D. Schwetman Hybrid Simulation Models of Computer 3119 Systems . . . . . . . . . . . . . . . . 718--723 3120 Jeffrey M. Barth A Practical Interprocedural Data Flow 3121 Analysis Algorithm . . . . . . . . . . . 724--736 3122 Gerald J. Popek and 3123 David A. Farber Model for Verification of Data Security 3124 in Operating Systems . . . . . . . . . . 737--749 3125 Peter J. Denning and 3126 Donald R. Slutz Generalized Working Sets for Segment 3127 Reference Strings . . . . . . . . . . . 750--759 3128 Glenford J. Myers Controlled Experiment in Program Testing 3129 and Code Walkthroughs/Inspections . . . 760--768 3130 Th. Ottmann and 3131 H. W. Six and 3132 D. Wood Right Brother Trees . . . . . . . . . . 769--776 3133 Ernst G. Ulrich Event Manipulation for Discrete 3134 Simulations Requiring Large Numbers of 3135 Events . . . . . . . . . . . . . . . . . 777--785 3136 K. Maly A note on virtual memory indexes . . . . 786--787 3137 Stephen A. Ward Real Time Plotting of Approximate 3138 Contour Maps . . . . . . . . . . . . . . 788--790 3139 A. Tenenbaum Simulations of dynamic sequential search 3140 algorithms . . . . . . . . . . . . . . . 790--791 3141 3142Communications of the ACM 3143Volume 21, Number 10, October, 1978 3144 3145 Walt Brainerd Fortran 77 . . . . . . . . . . . . . . . 806--820 3146 D. Towsley and 3147 K. M. Chandy and 3148 J. C. Browne Models for Parallel Processing Within 3149 Programs: Application to CPU:I/O and 3150 I/O:I/O Overlap . . . . . . . . . . . . 821--831 3151 Ben Shneiderman Jump Searching: A Fast Sequential Search 3152 Technique . . . . . . . . . . . . . . . 831--834 3153 Shi-Kuo Chang and 3154 Yin-Wah Wong Optimal Histogram Matching by Monotone 3155 Gray Level Transformation . . . . . . . 835--840 3156 Robert Morris Counting Large Numbers of Events in 3157 Small Registers . . . . . . . . . . . . 840--842 3158 Colin L. McMaster An Analysis of Algorithms for the Dutch 3159 National Flag Problem . . . . . . . . . 842--846 3160 Robert Sedgewick Implementing Quicksort Programs . . . . 847--857 3161 Gordon Lyon Packed Scatter Tables . . . . . . . . . 857--865 3162 Malcolm C. Easton and 3163 Ronald Fagin Cold-Start Vs. Warm-Start Miss Ratios 866--872 3164 W. R. Franta and 3165 Kurt Maly A comparison of heaps and the TL 3166 structure for the simulation event set 873--875 3167 3168Communications of the ACM 3169Volume 21, Number 11, November, 1978 3170 3171 Norman R. Lyons Systems Design Education: a Gaming 3172 Approach . . . . . . . . . . . . . . . . 889--895 3173 J. W. Wendorf A Simply Extended and Modified Batch 3174 Environment Graphical System (Sembegs) 897--904 3175 B. Kumar and 3176 E. S. Davidson Performance Evaluation of Highly 3177 Concurrent Computers by Deterministic 3178 Simulation . . . . . . . . . . . . . . . 904--913 3179 Berthold K. P. Horn and 3180 Brett L. Bachman Using Synthetic Images to Register Real 3181 Images with Surface Models . . . . . . . 914--924 3182 P. R. Tadikamalla Computer Generation of Gamma Random 3183 Variables --- II . . . . . . . . . . . . 925--928 3184 G. David Ripley Simple Recovery-Only Procedure for 3185 Simple Precedence Parsers . . . . . . . 928--930 3186 D. P. Friedman and 3187 D. S. Wise A Note on Conditional Expressions . . . 931--933 3188 Per Brinch Hansen Distributed Processes: A Concurrent 3189 Programming Concept . . . . . . . . . . 934--941 3190 Fabrizio Luccio and 3191 Linda Pagli Power Trees . . . . . . . . . . . . . . 941--947 3192 B. A. Sheil Median Split Trees: A Fast Lookup 3193 Technique for Frequently Occurring Keys 947--958 3194 C. A. R. Hoare Corrigendum: ``Communicating Sequential 3195 Processes'' . . . . . . . . . . . . . . 958--958 3196 Eugene C. Freuder Synthesizing Constraint Expressions . . 958--966 3197 Edsger W. Dijkstra and 3198 Leslie Lamport and 3199 A. J. Martin and 3200 C. S. Scholten and 3201 E. F. M. Steffens On-the-Fly Garbage Collection: An 3202 Exercise in Cooperation . . . . . . . . 966--975 3203 3204Communications of the ACM 3205Volume 21, Number 12, December, 1978 3206 3207 David Gries Corrigendum: ``An exercise in proving 3208 parallel programs correct'' 3209 Roger M. Needham and 3210 Michael D. Schroeder Using Encryption for Authentication in 3211 Large Networks of Computers . . . . . . 993--999 3212 David Gries and 3213 Jayadev Misra A Linear Sieve Algorithm for Finding 3214 Prime Numbers . . . . . . . . . . . . . 999--1003 3215 James L. Peterson and 3216 James R. Bitner and 3217 John H. Howard The Selection of Optimal Tab Settings 1004--1007 3218 James C. Wetherbe and 3219 V. Thomas Dock Strategic Planning Methodology for the 3220 Computing Effort in Higher Education: an 3221 Empirical Evaluation . . . . . . . . . . 1008--1015 3222 M. Ibramsha and 3223 V. Rajaraman Detection of Logical Errors in Decision 3224 Table Programs . . . . . . . . . . . . . 1016--1025 3225 Alberto Martelli and 3226 Ugo Montanari Optimizing Decision Trees Through 3227 Heuristically Guided Search . . . . . . 1025--1039 3228 Yogen K. Dalal and 3229 Robert M. Metcalfe Reverse Path Forwarding of Broadcast 3230 Packets . . . . . . . . . . . . . . . . 1040--1048 3231 John V. Guttag and 3232 Ellis Horowitz and 3233 David R. Musser Abstract Data Types and Software 3234 Validation . . . . . . . . . . . . . . . 1048--1064 3235 Jay M. Spitzen and 3236 Karl N. Levitt and 3237 Lawrence Robinson An Example of Hierarchical Design and 3238 Proof . . . . . . . . . . . . . . . . . 1064--1075 3239 3240Communications of the ACM 3241Volume 23, Number 4, May, 1978 3242 3243 J. L. Bentley Multidimensional Divide-and-Conquer . . 214--228 3244 3245Communications of the ACM 3246Volume 22, Number 1, January, 1979 3247 3248 John W. Boyse Interference Detection Among Solids and 3249 Surfaces . . . . . . . . . . . . . . . . 3--9 3250 Kent W. Colton The impact and use of computer 3251 technology by the police . . . . . . . . 10--20 3252 Gian Carlo Bongiovanni and 3253 Fabrizio Luccio Permutation of Data Blocks in a Bubble 3254 Memory . . . . . . . . . . . . . . . . . 21--25 3255 Charles H. Sauer and 3256 K. Mani Chandy The Impact of Distributions and 3257 Disciplines on Multiple Processor 3258 Systems . . . . . . . . . . . . . . . . 25--34 3259 J. P. Banatre and 3260 J. P. Routeau and 3261 L. Trilling An event-driven compiling technique . . 34--42 3262 Jacques J. Arsac Syntactic Source to Source Transforms 3263 and Program Manipulation . . . . . . . . 43--54 3264 3265Communications of the ACM 3266Volume 22, Number 2, February, 1979 3267 3268 O. E. Taulbee and 3269 S. D. Conte Production and employment of Ph.D.s in 3270 computer science --- 1977 and 1978 . . . 75--76 3271 R. E. Fairley Employment characteristics of doctoral 3272 level computer scientists . . . . . . . 77--78 3273 W. E. Gull and 3274 M. A. Jenkins Recursive data structures in APL. . . . 79--96 3275 E. Morel and 3276 C. Renvoise Global Optimization by Suppression of 3277 Partial Redundancies . . . . . . . . . . 96--103 3278 M. R. Anderson and 3279 M. G. Anderson Comments on Perfect Hashing Functions: A 3280 Single Probe Retrieving Method for 3281 Static Sets . . . . . . . . . . . . . . 104--105 3282 David R. Cheriton and 3283 Michael A. Malcolm and 3284 Lawrence S. Melen and 3285 Gary R. Sager Thoth, a Portable Real-Time Operating 3286 System . . . . . . . . . . . . . . . . . 105--115 3287 David P. Reed and 3288 Rajendra K. Kanodia Synchronization with Eventcounts and 3289 Sequencers . . . . . . . . . . . . . . . 115--123 3290 Haim Mendelson and 3291 Joseph S. Pliskin and 3292 Uri Yechiali Optimal Storage Allocation for Serial 3293 Files . . . . . . . . . . . . . . . . . 124--130 3294 3295Communications of the ACM 3296Volume 22, Number 3, March, 1979 3297 3298 Richard H. Austing and 3299 Bruce H. Barnes and 3300 Della T. Bonnette and 3301 Gerald L. Engel and 3302 Gordon Stokes Curriculum '78: Recommendations for the 3303 Undergraduate Program in Computer 3304 Science --- A Report of the ACM 3305 Curriculum Committee on Computer Science 147--166 3306 Albert D. Edgar and 3307 Samuel C. Lee FOCUS microcomputer number system . . . 166--177 3308 James Slagle Experiments with Some Algorithms that 3309 Find Central Solutions for Pattern 3310 Classification . . . . . . . . . . . . . 178--183 3311 Amaryllis Deliyanni and 3312 Robert A. Kowalski Logic and Semantic Networks . . . . . . 184--192 3313 Dalia Motzkin Use of Normal Multiplication Tables for 3314 Information Storage and Retrieval . . . 193--207 3315 C. L. McMaster Corrigendum: ``An Analysis of Algorithms 3316 for the Dutch National Flag Problem'' 207--207 3317 3318Communications of the ACM 3319Volume 22, Number 4, April, 1979 3320 3321 Arthur M. Lesk Detection of Three-Dimensional Patterns 3322 of Atoms in Chemical Structures . . . . 219--224 3323 E. G. Cale and 3324 L. L. Gremillion and 3325 J. L. McKenney Price/Performance Patterns of U.S. 3326 Computer Systems . . . . . . . . . . . . 225--233 3327 Giacomo Bucci and 3328 Donald N. Streeter Methodology for the Design of 3329 Distributed Information Systems . . . . 233--245 3330 Richard J. Hanson and 3331 John A. Wisniewski A Mathematical Programming Updating 3332 Method Using Modified Givens 3333 Transformations and Applied to LP 3334 Problems . . . . . . . . . . . . . . . . 245--251 3335 Daniel Brelaz New Methods to Color the Vertices of a 3336 Graph . . . . . . . . . . . . . . . . . 251--256 3337 3338Communications of the ACM 3339Volume 22, Number 5, May, 1979 3340 3341 Richard A. De Millo and 3342 Richard J. Lipton and 3343 Alan J. Perlis Social Processes and Proofs of Theorems 3344 and Programs . . . . . . . . . . . . . . 271--280 3345 Ernest Chang and 3346 Rosemary Roberts An Improved Algorithm for Decentralized 3347 Extrema-Finding in Circular 3348 Configurations of Processors . . . . . . 281--283 3349 T. D. Sterling Consumer Difficulties with Computerized 3350 Transactions: an Empirical Investigation 283--289 3351 John C. Reynolds Reasoning About Arrays . . . . . . . . . 290--299 3352 Michael J. Manthey Model for and Discussion of 3353 Multi-Interpreter Systems . . . . . . . 299--309 3354 3355Communications of the ACM 3356Volume 22, Number 6, June, 1979 3357 3358 R. S. Lemos An implementation of structured 3359 walk-throughs in teaching COBAL 3360 programming . . . . . . . . . . . . . . 335--340 3361 S. N. Busenberg and 3362 W. C. Tam An academic program providing realistic 3363 training in software engineering . . . . 341--345 3364 Steven Alter Model for Automating File and Program 3365 Design in Business Application Systems 345--353 3366 Jerome A. Feldman High Level Programming for Distributed 3367 Computing . . . . . . . . . . . . . . . 353--368 3368 Robert Sedgewick Corrigendum: ``Implementing Quicksort 3369 Programs'' . . . . . . . . . . . . . . . 368--368 3370 R. Shapira and 3371 H. Freeman The Cyclic Order Property of Vertices as 3372 an Aid in Scene Analysis . . . . . . . . 368--375 3373 3374Communications of the ACM 3375Volume 22, Number 7, July, 1979 3376 3377 T. Winograd Beyond Programming Languages . . . . . . 391--401 3378 F. P. Preparata An Optimal Real-Time Algorithm for 3379 Planar Convex Hulls . . . . . . . . . . 402--405 3380 Patrick C. Fischer and 3381 Robert L. Probert Storage Reorganization Techniques for 3382 Matrix Computation in a Paging 3383 Environment . . . . . . . . . . . . . . 405--415 3384 J. H. Hine and 3385 I. Mitrani and 3386 S. Tsur The Control of Response Times in 3387 Multi-Class Systems by Memory Allocation 415--424 3388 Robert A. Kowalski Algorithm = Logic + Control . . . . . . 424--436 3389 3390Communications of the ACM 3391Volume 22, Number 8, August, 1979 3392 3393 J. W. Wong and 3394 G. Scott Graham Self-Assessment Procedure VI: a 3395 self-assessment procedure dealing with 3396 queueing network models of computer 3397 systems . . . . . . . . . . . . . . . . 449--454 3398 R. W. Floyd The paradigms of programming . . . . . . 455--460 3399 D. S. Hirschberg and 3400 A. K. Chandra and 3401 D. V. Sarwate Computing Connected Components on 3402 Parallel Computers . . . . . . . . . . . 461--464 3403 Nachum Dershowitz and 3404 Zohar Manna Proving Termination with Multiset 3405 Orderings . . . . . . . . . . . . . . . 465--476 3406 Dorothy E. Denning Secure Personal Computing in an Insecure 3407 Network . . . . . . . . . . . . . . . . 476--482 3408 L. S. Nelson Further remark on stably updating mean 3409 and standard deviation estimates . . . . 483--483 3410 3411Communications of the ACM 3412Volume 22, Number 9, September, 1979 3413 3414 Jerome A. Feldman and 3415 William R. Sutherland Rejuvenating Experimental Computer 3416 Science --- A Report to the National 3417 Science Foundation and Others . . . . . 497--502 3418 Daniel D. McCracken, CCP and 3419 Peter J. Denning and 3420 David H. Brandin Addendum: An ACM Executive Committee 3421 Position on the Crisis in Experimental 3422 Computer Science . . . . . . . . . . . . 503--504 3423 Zvi Galil On Improving the Worse Case Running Time 3424 of the Boyer-Moore String Matching 3425 Algorithm . . . . . . . . . . . . . . . 505--508 3426 Kari-Jouko Raiha and 3427 Stuart H. Zweben An Optimal Insertion Algorithm for 3428 One-Sided Height-Balanced Binary Search 3429 Trees . . . . . . . . . . . . . . . . . 508--512 3430 Wilfred J. Hansen Progressive acyclic digraphs --- a tool 3431 for database integrity . . . . . . . . . 513--518 3432 G. Nagy and 3433 S. G. Wagle Approximation of Polygonal Maps by 3434 Cellular Maps . . . . . . . . . . . . . 518--525 3435 T. F. Chan and 3436 J. G. Lewis Computing standard deviations: accuracy 526--531 3437 D. H. D. West Updating mean and variance estimates: an 3438 improved method . . . . . . . . . . . . 532--535 3439 3440Communications of the ACM 3441Volume 22, Number 10, October, 1979 3442 3443 P. D. Laird Comment on: ``An optimal evaluation of 3444 Boolean expressions in an online query 3445 system'' [Comm. ACM, 20, 1977, no. 5, 3446 344--347, MR 55 #9627] by M. Z. Hanani 549--550 3447 Ehud Gudes and 3448 Anthony Hoffman A note on: ``An optimal evaluation of 3449 Boolean expressions in an online query 3450 system'' [Comm. ACM, 20, 1977, no. 5, 3451 344--347, MR 55 #9627] by M. Z. Hanani 550--553 3452 M. R. Anderson and 3453 M. G. Anderson Corrigendum: ``Comments on Perfect 3454 Hashing Functions: A Single Probe 3455 Retrieving Method for Static Sets'' . . 553 3456 Leslie Lamport On the Proof of Correctness of a 3457 Calendar Program . . . . . . . . . . . . 554--556 3458 Paul Klint Line Numbers Made Cheap . . . . . . . . 557--559 3459 Tomas Lozano-Perez and 3460 Michael A. Wesley An Algorithm for Planning Collision-Free 3461 Paths Among Polyhedral Obstacles . . . . 560--570 3462 F. L. Morris On a Comparison of Garbage Collection 3463 Techniques . . . . . . . . . . . . . . . 571 3464 3465Communications of the ACM 3466Volume 22, Number 11, November, 1979 3467 3468 R. E. Mayer A psychology of learning BASIC . . . . . 589--593 3469 R. Morris and 3470 K. Thompson Password Security --- A Case History . . 594--597 3471 Shmuel Peleg and 3472 Azriel Rosenfeld Breaking Substitution Ciphers Using a 3473 Relaxation Algorithm . . . . . . . . . . 598--605 3474 Robert Endre Tarjan and 3475 Andrew Chi Chih Yao Storing a Sparse Table . . . . . . . . . 606--611 3476 Adi Shamir How to Share a Secret . . . . . . . . . 612--613 3477 3478Communications of the ACM 3479Volume 22, Number 12, December, 1979 3480 3481 A. H. Lipis Costs of the current US payments system 644--647 3482 R. H. Long Public protection and education with EFT 648--654 3483 D. B. Parker Vulnerabilities of EFTs to intentionally 3484 caused losses . . . . . . . . . . . . . 654--660 3485 K. L. Kraemer and 3486 K. Colton Policy, values, and EFT research: 3487 anatomy of a research agenda . . . . . . 660--671 3488 J. F. Shoch and 3489 J. A. Hupp Measured Performance of an ETHERNET 3490 Local Network . . . . . . . . . . . . . 711--721 3491 3492Communications of the ACM 3493Volume 26, Number 9, September, 1979 3494 3495 Hanan Samet A quadtree medial axis transform . . . . 680--693 3496 3497Communications of the ACM 3498Volume 33, Number 6, June, 1990 3499 3500 Peter K. Pearson Fast Hashing of Variable-Length Text 3501 Strings . . . . . . . . . . . . . . . . 677--680 3502 3503Communications of the ACM 3504Volume 33, Number 8, August, 1990 3505 3506 Daniel M. Sunday A Very Fast Substring Search Algorithm 132--142 3507 3508Communications of the ACM 3509Volume 34, Number 11, November, 1991 3510 3511 I. Dittmer Note on Fast Hashing of Variable Length 3512 Text Strings . . . . . . . . . . . . . . 118 3513 Jacques Savoy Note on Fast Hashing of Variable Length 3514 Text Strings . . . . . . . . . . . . . . 118--119 3515 James Litsios Note on Fast Hashing of Variable Length 3516 Text Strings . . . . . . . . . . . . . . 118--120 3517 Peter Pearson Note on Fast Hashing of Variable Length 3518 Text Strings . . . . . . . . . . . . . . 120 3519 3520Computing Surveys 3521Volume 6, Number 4, December, 1974 3522 3523 Donald E. Knuth Structured Programming with go to 3524 Statements . . . . . . . . . . . . . . . 261--301 3525 3526Journal of the ACM 3527Volume 23, Number 1, January, 1976 3528 3529 Susan L. Graham and 3530 Mark Wegman A Fast and Usually Linear Algorithm for 3531 Global Flow Analysis . . . . . . . . . . 172--202 3532 3533Management Science 3534Volume 19, Number , , 1972 3535 3536 R. J. Brown Chromatic scheduling and the chromatic 3537 number problem . . . . . . . . . . . . . 451--463 3538 3539SIAM Journal of Computing 3540Volume 6, Number 2, June, 1977 3541 3542 Donald E. Knuth and 3543 J. H. Morris and 3544 V. R. Pratt Fast pattern matching in strings . . . . 323--350 3545 3546Software --- Practice and Experience 3547Volume 12, Number 1, January, 1982 3548 3549 A. L. Tharp and 3550 K.-C. Tai The practicality of text signatures for 3551 accelerating string searching . . . . . 35--44 3552 3553ACM Transactions on Mathematical Software 3554Volume 1, Number 3, September, 1975 3555 3556 Ove Skovgaard Remark on ``Algorithm 236: Bessel 3557 Functions of the First Kind [S17]'' . . 282--284 3558 Jayadev Misra Remark on ``Algorithm 246: Graycode 3559 [Z]'' . . . . . . . . . . . . . . . . . 285--285 3560 3561ACM Transactions on Mathematical Software 3562Volume 1, Number 9, September, 1975 3563 3564 Robert Feinstein Remark on ``Algorithm 483: Masked 3565 Three-Dimensional Plot Program with 3566 Rotations [J6]'' . . . . . . . . . . . . 285--285 3567 3568ACM Transactions on Mathematical Software 3569Volume 2, Number 1, March, 1976 3570 3571 D. M. Boulton Remark on ``Algorithm 434: Exact 3572 Probabilities for $R\times{C}$ 3573 Contingency Tables [G2]'' . . . . . . . 108--108 3574 Lucian D. Duta Remark on ``Algorithm 475: Visible 3575 Surface Plotting Program [J6]'' . . . . 109--110 3576 G. M. White and 3577 S. Goudreau and 3578 J. L. Legros Remark on ``Algorithm 479: A Minimal 3579 Spanning Tree Clustering Method [Z]'' 110--111 3580 J. Pomeranz Remark on ``Algorithm 487: Exact 3581 Cumulative Distribution of the 3582 Kolmogorov-Smirnov Statistic for Small 3583 Samples [S14]'' . . . . . . . . . . . . 111--111 3584 Robert Morris Remark on ``Algorithm 490: The 3585 Dilogarithm Function of a Real Argument 3586 [S22]'' . . . . . . . . . . . . . . . . 112--112 3587 3588ACM Transactions on Mathematical Software 3589Volume 2, Number 2, June, 1976 3590 3591 Malcolm C. Pike and 3592 Jennie SooHoo Remark on ``Algorithm 179: Incomplete 3593 Beta Ratio [S14]'' . . . . . . . . . . . 207--208 3594 Michael R. Anderson Remark on ``Algorithm 433: Interpolation 3595 and Smooth Curve Fitting Based on Local 3596 Procedures [E2]'' . . . . . . . . . . . 208--208 3597 3598ACM Transactions on Mathematical Software 3599Volume 2, Number 3, September, 1976 3600 3601 Alan M. Davies Remark on ``Algorithm 450: Rosenbrock 3602 Function Minimization [E4]'' . . . . . . 300--301 3603 Theodore Brown Remark on ``Algorithm 489: The Algorithm 3604 SELECT --- for Finding the $i$th 3605 Smallest of $n$ Elements [M1]'' . . . . 301--304 3606 3607ACM Transactions on Mathematical Software 3608Volume 2, Number 4, December, 1976 3609 3610 M. R. Ito Remark on ``Algorithm 284: Interchange 3611 of Two Blocks of Data [K2]'' . . . . . . 392--393 3612 Mohamed el Lozy Remark on ``Algorithm 299: Chi-Squared 3613 Integral [S15]'' . . . . . . . . . . . . 393--395 3614 Henk Koppelaar and 3615 Peter Molenaar Remark on ``Algorithm 486: Numerical 3616 Inversion of Laplace Transform [D5]'' 395--396 3617 3618ACM Transactions on Mathematical Software 3619Volume 3, Number 1, March, 1977 3620 3621 Esko G. Cate and 3622 David W. Twigg Algorithm 513: Analysis of In-Situ 3623 Transposition [F1] . . . . . . . . . . . 104--110 3624 Fran\ccoise Veillon Remark on ``Algorithm 486: Numerical 3625 Inversion of Laplace Transform'' . . . . 111--111 3626 3627ACM Transactions on Mathematical Software 3628Volume 3, Number 2, June, 1977 3629 3630 J. K. M. Jansen Remark on ``Algorithm 259: Legendre 3631 Functions for Arguments Larger than 3632 One'' . . . . . . . . . . . . . . . . . 204--250 3633 3634ACM Transactions on Mathematical Software 3635Volume 3, Number 3, September, 1977 3636 3637 Paolo Sipala Remark on ``Algorithm 408: A Sparse 3638 Matrix Package (Part I) [F4]'' . . . . . 303--303 3639 Dennis Tenney Remark on ``Algorithm 219: Topological 3640 Ordering for PERT Networks'' . . . . . . 303--303 3641 3642ACM Transactions on Mathematical Software 3643Volume 4, Number 1, March, 1978 3644 3645 Ove Skovgaard Remark on ``Algorithm 149: Complete 3646 Elliptic Integral [S21]'' . . . . . . . 95--95 3647 3648ACM Transactions on Mathematical Software 3649Volume 4, Number 3, September, 1978 3650 3651 John P. Coleman Remark on ``Algorithm 49: Spherical 3652 Neumann Function'' . . . . . . . . . . . 295--295 3653 Fred G. Gustavson Remark on ``Algorithm 408: A Sparse 3654 Matrix Package (Part I) [F4]'' . . . . . 295--295 3655 Andrew Y. Schoene Remark on ``Algorithm 435: Modified 3656 Incomplete Gamma Function [S14]'' . . . 296--304 3657 3658ACM Transactions on Mathematical Software 3659Volume 5, Number 2, June, 1979 3660 3661 Mohamed el Lozy Remark on ``Algorithm 395: Student's 3662 $t$-Distribution'' and Remark on 3663 ``Algorithm 396: Student's Quantiles 3664 [S14]'' . . . . . . . . . . . . . . . . 238--239 3665 K. O. Geddes Remark on ``Algorithm 424: 3666 Clenshaw-Curtis Quadrature [O1]'' . . . 240--240 3667 M. R. Anderson Remark on ``Algorithm 474: Bivariate 3668 Interpolation and Smooth Surface Fitting 3669 Based on Local Procedures'' . . . . . . 241--241 3670 3671ACM Transactions on Mathematical Software 3672Volume 5, Number 4, December, 1979 3673 3674 Burton L. Leathers Remark on ``Algorithm 513: Analysis of 3675 In-Situ Transposition [F1]'' and Remark 3676 on ``Algorithm 467: Matrix Transposition 3677 in Place'' . . . . . . . . . . . . . . . 520--520 3678 A. C. M. van Swieten and 3679 J. Th. M. de Hosson Remark on ``Algorithm 475: Visible 3680 Surface Plotting Program'' . . . . . . . 521--523 3681 3682ACM Transactions on Mathematical Software 3683Volume 6, Number 3, September, 1980 3684 3685 U. Harms and 3686 H. Kollakowski and 3687 G. Moller Remark on ``Algorithm 408: A Sparse 3688 Matrix Package (Part 1) [F4]'' . . . . . 456--457 3689 3690ACM Transactions on Mathematical Software 3691Volume 7, Number 2, June, 1981 3692 3693 G. W. Hill Remark on ``Algorithm 395: Student's 3694 $t$-Distribution'' . . . . . . . . . . . 247--249 3695 G. W. Hill Remark on ``Algorithm 396: Student's 3696 $t$-Quantiles'' . . . . . . . . . . . . 250--251 3697 I. D. Hill and 3698 M. C. Pike Remark on ``Algorithm 299: Chi-Squared 3699 Integral'' . . . . . . . . . . . . . . . 185--185 3700 3701ACM Transactions on Mathematical Software 3702Volume 11, Number 4, December, 1985 3703 3704 M. C. Er Remark on ``Algorithm 246: Graycode 3705 [Z]'' . . . . . . . . . . . . . . . . . 441--443 3706