Lines Matching +full:mutual +full:- +full:inductive
23 for Pert Networks . . . . . . . . . . . 738--739
29 the First Kind . . . . . . . . . . . . . 479--480
40 for Arguments Larger than One . . . . . 488--492
52 M. C. Pike ACM Algorithm 299: Chi-Squared Integral 243--244
57 Edsger Wybe Dijkstra Go to statement considered harmful . . . 147--148
62 ANSI Subcommittee X3J3 Clarification of Fortran Standards ---
63 Initial Progress . . . . . . . . . . . . 289--294
69 Computer Organization . . . . . . . . . 489--498
74 V. Y. Lum Multi-Attribute Retrieval with Combined
75 Indexes . . . . . . . . . . . . . . . . 660--665
82 processor timing . . . . . . . . . . . . 3--6
85 derivatives --- A study of error
86 propagation . . . . . . . . . . . . . . 7--9
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
94 approximation to a digitized contour . . 41--47
96 of Laplace Transforms . . . . . . . . . 47--49
99 Distribution . . . . . . . . . . . . . . 49--49
101 Generator . . . . . . . . . . . . . . . 49--52
103 Order . . . . . . . . . . . . . . . . . 52--52
105 Produce Complex Primes CSIEVE . . . . . 52--54
109 Minimal Storage'', by R. C. Singleton 54--54
111 machine-to-machine data interchange . . 55--55
113 information interchange . . . . . . . . 56--56
115 generator . . . . . . . . . . . . . . . 57--57
122 Retrieval from Files . . . . . . . . . . 67--73
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
132 Calculation . . . . . . . . . . . . . . 105--107
134 Code Eliminating Secondary Clustering 107--109
139 of management . . . . . . . . . . . . . 110--114, 19
142 graphical flowchart input . . . . . . . 115--119
144 Restricted Partitions . . . . . . . . . 120--120
146 Generator . . . . . . . . . . . . . . . 120--120
148 Exponential . . . . . . . . . . . . . . 120--121
149 H. Spath Fitting data to one exponential . . . . 120--121
151 $f(x)=A\cos(Bx+C)$ . . . . . . . . . . . 121--122
156 H. L. Morgan Spelling correction in systems programs 90--94
159 J. C. Yochelson A Program to Teach Programming . . . . . 141--146
162 Tree-Searching Program . . . . . . . . . 147--154, 159
164 Shy-Ming M. Ju and
165 D. C. Wood Measurements of Segment Size . . . . . . 155--159
167 Approximation . . . . . . . . . . . . . 160--162
170 Integration . . . . . . . . . . . . . . 163--166
174 Natural Language Inference . . . . . . . 167--183
177 Differential Equations . . . . . . . . . 184--191 (or 184--190??)
180 Algebraic Expressions . . . . . . . . . 191--192
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
186 Ambiguous Context-Free Languages . . . . 194--194
189 Information Retrieval from Files'' . . . 266--266
198 Environment . . . . . . . . . . . . . . 211--215
199 H. D. Mills Syntax-Directed Documentation for PL360 216--222
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
205 R. L. Weil, Jr. The cyclical majority problem . . . . . 251--254
206 E. N. Nilson Cubic Splines on Uniform Meshes . . . . 255--258
208 Newton-like Method for Solving a System
209 of Simultaneous Nonlinear Equations . . 259--260
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
214 on demand strategy . . . . . . . . . . . 265--265
216 minimization . . . . . . . . . . . . . . 265--266
218 parameters of procedures . . . . . . . . 266--266
221 Organization'' . . . . . . . . . . . . . 266--266
226 L. Hodes Programming System for the On-Line
227 Analysis of Biomedical Images . . . . . 279--283, 286
229 the Genie Compiler . . . . . . . . . . . 284--286
230 S. Vere Translation Equations (Errata) . . . . . 286--286
235 Simulation. an Example Inventory Model 287--296
237 Bounded-Context Parsers . . . . . . . . 297--307
238 John C. Reynolds GEDANKEN --- A Simple Typeless Language
240 and the Reference Concept . . . . . . . 308--319
241 S. Crespi-Reghizzi and
242 R. Morpurgo A language for treating graphs . . . . . 319--323
244 M. A. Brebner ACM Algorithm 380: In-situ Transposition
245 of a Rectangular Matrix . . . . . . . . 324--326 (or 324--325??)
247 Uniform In Solid Angle . . . . . . . . . 326--326
253 On-Line Computer Processing System . . . 339--346
256 Computer Programs . . . . . . . . . . . 347--351
258 Meetings . . . . . . . . . . . . . . . . 351--352
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
264 Newton-Cotes Quadrature Routines in
266 Peaked Integrands . . . . . . . . . . . 362--365
269 Matrices . . . . . . . . . . . . . . . . 365--367
271 Out of ${N}$ Objects . . . . . . . . . . 368--368
273 with Repetitions . . . . . . . . . . . . 368--369
276 [F2] . . . . . . . . . . . . . . . . . . 369--371
278 Treesort 3: Proof of Algorithms --- A
279 New Kind of Certification . . . . . . . 371--374
281 W. C. Harrison R201--SHELLSORT . . . . . . . . . . . . 373--374
283 Shared Data Banks . . . . . . . . . . . 377--387
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
296 J. Eve File Structures Using Hashing Functions 427--432, 436
298 Common Divisor of $n$ Integers . . . . . 433--436
299 W. A. Woods Context-Sensitive Parsing . . . . . . . 437--445
301 ${E}_i(x)$ . . . . . . . . . . . . . . . 446--447
303 Divisor of $n$ Integers and Multipliers 447--448
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
309 Programming . . . . . . . . . . . . . . 452--452
315 Pricing the Answer . . . . . . . . . . . 467--474
318 Numerals . . . . . . . . . . . . . . . . 475--481
320 Scatter Storage . . . . . . . . . . . . 481--482
323 E. S. Mankin Sorting in a Paging Environment . . . . 483--494
325 J. W. Gintell The instrumentation of Multics . . . . . 495--500
328 optimal Floyd-Evans productions for
329 precedence grammars . . . . . . . . . . 501--508
331 and Linear Search . . . . . . . . . . . 509--510
335 W. Schwering ACM Algorithm 388: Rademacher Function 510--511
340 Functions . . . . . . . . . . . . . . . 511--511
345 Walsh Functions . . . . . . . . . . . . 511--512 (or 511--511??)
347 Polynomials . . . . . . . . . . . . . . 512--512
350 Columbia) for information interchange 514--515
356 Three-Dimensional Half-Toned Computer
357 Graphics Presentations . . . . . . . . . 527--536
360 Computer-Aided Design. an Application to
361 Circuit Project . . . . . . . . . . . . 537--545
363 Software System . . . . . . . . . . . . 546--555
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
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??)
376 P.D.E. . . . . . . . . . . . . . . . . . 567--570
378 Summation with Arbitrary Precision . . . 570--570
380 Translation . . . . . . . . . . . . . . 571--573 (or 571--572??)
383 Method for Hash Code Searching . . . . . 573--574
385 Singly Generated Automaton . . . . . . . 574--575
391 Language Analysis . . . . . . . . . . . 591--606
393 H. Sturgis A formalism for translator interactions 607--617
395 $t$-Distribution . . . . . . . . . . . . 617--619
397 $t$-Quantiles . . . . . . . . . . . . . 619--620
400 Programming Problem . . . . . . . . . . 620--621
402 Conversion . . . . . . . . . . . . . . . 621--621
403 J. J. Seppanen ACM Algorithm 399: Spanning Tree . . . . 621--622
405 Integration . . . . . . . . . . . . . . 622--624
410 numerical problems . . . . . . . . . . . 625--634
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
423 Reformatter . . . . . . . . . . . . . . 669--675
425 Charles H. Kaman The Linear Quotient Hash Code . . . . . 675--677
426 C. J. Cheney A Nonrecursive List Compacting Algorithm 677--678
429 interchange (1600 CPI, phase encoded) 679--685
432 interchange (9 track-200 and 800 CPI,
433 NRZI and 1600 CPI, P.E.) . . . . . . . . 686--692
435 to Produce Complex Primes . . . . . . . 693--693
437 Efficiency of Quicksort . . . . . . . . 693--694
439 argument/function values . . . . . . . . 696--697
442 arithmetic . . . . . . . . . . . . . . . 697--698
444 program behavior . . . . . . . . . . . . 698--699
445 J. Rokne Condition numbers of Pei matrices . . . 699--699
451 F. R. Moore GROOVE-A program to compose, store, and
452 edit functions of time . . . . . . . . . 715--721
454 the Elementary Circuits of a Graph . . . 722--726
461 in the multiaccess system ESOPE . . . . 727--733
463 management information systems . . . . . 734--739
464 R. J. Thompson Improving round-off in Runge-Kutta
465 computations with Gill's method . . . . 739--740
467 evaluating set expressions . . . . . . . 741--744
468 N. A. Black Optimum Merging from Mass Storage . . . 745--749
471 Matrix [F2] . . . . . . . . . . . . . . 750--750
475 Communications Traffic Models . . . . . 752--757
477 simplifying the components separately 758--758
478 W. J. Raduchel Efficient handling of binary data . . . 758--759
480 Isolation of Computer Scientists . . . . 759--760
486 C. W. Medlock Object Code Optimization . . . . . . . . 13--22
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
494 in a Two-Dimensional Space . . . . . . . 26--32
496 powers of a formal series . . . . . . . 32--35
498 Deadlocks . . . . . . . . . . . . . . . 36--38
499 C. A. R. Hoare Proof of a Program: FIND . . . . . . . . 39--45
501 algorithms for the zero-one programming
502 problem . . . . . . . . . . . . . . . . 46--47
505 Partitioning . . . . . . . . . . . . . . 48--48
508 Function . . . . . . . . . . . . . . . . 48--49 (or 48--48??)
510 Algorithm 245 . . . . . . . . . . . . . 50--51
512 tables to computer programs . . . . . . 52--52
517 K. Schwayder Conversion of Limited-Entry Decision
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
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
530 Multipurpose Heuristic Program . . . . . 91--99 (or 91--98??)
532 Values of Binary Trees . . . . . . . . . 99--102
536 Recognition . . . . . . . . . . . . . . 103--110
538 P. Lancaster Complex Interval Arithmetic . . . . . . 111--112
543 Problem . . . . . . . . . . . . . . . . 113--117
548 A. M. Noll Scanned-Display Computer Graphics . . . 143--150
550 R. J. Waldinger Toward Automatic Program Synthesis . . . 151--165
552 Assisted Registration System . . . . . . 166--171
555 Performed by a Hashing Algorithm . . . . 172--175
557 Differential Equations . . . . . . . . . 176--179
560 Arithmetic . . . . . . . . . . . . . . . 180--184
562 of Ordinary Differential Equations . . . 185--190
568 Refinement . . . . . . . . . . . . . . . 221--227
571 M. Dodd Key-to-Address Transform Techniques: A
573 Existing Formatted Files . . . . . . . . 228--239
576 Organization and Programming . . . . . . 240--250
580 R. C. Hwang Animator: an on-line two-dimensional
581 film animation system . . . . . . . . . 251--259
583 W. D. Munro On Complement Division . . . . . . . . . 260--264
585 Package (Part I) . . . . . . . . . . . . 265--273
593 systems' . . . . . . . . . . . . . . . . 308--318
594 N. R. Nielsen The merit of regional computing networks 319--326
597 G. Marble A Man-Machine Approach Toward Solving
598 the Traveling Salesman Problem . . . . . 327--334
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
605 Curve Fit . . . . . . . . . . . . . . . 355--356
606 J. M. Chambers ACM Algorithm 410: Partial Sorting [M1] 357--358
612 expressed in Hamiltonian circuits . . . 373--379
614 computer graphics systems . . . . . . . 380--390
616 for Curriculum Planning . . . . . . . . 391--401
618 O. G. Johnson Numerical properties of the Ritz-Trefftz
619 algorithm for optimal control . . . . . 402--406
621 Multiplications . . . . . . . . . . . . 407--408
623 Systems . . . . . . . . . . . . . . . . 409--416
624 R. J. Walker Binary summation . . . . . . . . . . . . 417--417
625 M. Zelkowitz Interrupt driven programming . . . . . . 417--418
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
637 Processing, and Its Formal Semantics . . 460--467 (or 461--467??)
639 nodes of a graph . . . . . . . . . . . . 468--475
640 D. E. Ferguson Buffer Allocation in Merge-Sorting . . . 476--478
643 of arithmetic expressions . . . . . . . 479--485
645 L. B. Wilson The Stable Marriage Problem . . . . . . 486--490
648 the Stable Marriage Problem . . . . . . 491--492
649 J. \vCermak ACM Algorithm 412: Graph Plotter . . . . 492--493
657 Theoretical Physics . . . . . . . . . . 511--516
659 manipulation --- a survey . . . . . . . 517--521
661 Multiple Cell Types . . . . . . . . . . 522--526
663 the Perplexed . . . . . . . . . . . . . 527--537
665 celestial mechanics . . . . . . . . . . 538--541
668 of algebraic manipulative systems . . . 542--547
669 Joel Moses Symbolic Integration: The Stormy Decade 548--560
675 Computers in Organizations . . . . . . . 573--588
679 Dynamic Storage Allocation of $2^n$-word
680 Blocks . . . . . . . . . . . . . . . . . 589--592
682 blocks and cutnodes of a graph'' . . . . 592--592
685 File Organization . . . . . . . . . . . 593--597
686 David L. Phillips A note on best one-sided approximations 598--600
688 Newton-Raphson method in implicit
691 differential equations . . . . . . . . . 600--601
694 Ordered Lists . . . . . . . . . . . . . 602--603
695 R. R. Fenichel Comment on Cheney's List-Compaction
696 Algorithm . . . . . . . . . . . . . . . 603--604
702 Structures . . . . . . . . . . . . . . . 617--627
703 ANSI Subcommittee X3J3 Clarification of Fortran Standards ---
704 Second Report . . . . . . . . . . . . . 628--642
708 methods . . . . . . . . . . . . . . . . 643--650
709 W. M. Newman Display procedures . . . . . . . . . . . 651--660
712 time-shared environment . . . . . . . . 661--666
716 `Writers' . . . . . . . . . . . . . . . 667--668
721 (C5) . . . . . . . . . . . . . . . . . . 669--675
729 P. L. Wodon The composition of semantics in Algol 68 697--708
731 past recommendations, status, and needs 709--712
732 D. L. Shell Optimizing the Polyphase Sort . . . . . 713--719
735 K. Arimoto Automation of etching-pattern layout . . 720--730
736 Michael A. Malcolm On Accurate Floating-Point Summation . . 731--736
740 a Chebyshev System of Functions . . . . 737--746
747 Projections . . . . . . . . . . . . . . 759--768
750 for Compressing Map Data Strings . . . . 769--774
751 James K. Mullin Retrieval-Update Speed Trade-offs Using
752 Combined Indexes . . . . . . . . . . . . 775--776
754 Hashing . . . . . . . . . . . . . . . . 777--779
758 programming . . . . . . . . . . . . . . 780--790
760 Environment . . . . . . . . . . . . . . 791--795
763 method using an ``off-step'' point' . . 796--796
764 Sven-\AAke A. Gustafson Rapid Computation of General
766 Quadrature Rules . . . . . . . . . . . . 797--801
768 Jean-Claude Lassalle An extension of the Munkres algorithm
770 rectangular matrices . . . . . . . . . . 802--804
774 Matrices) . . . . . . . . . . . . . . . 805--806
775 Sven-\AAke Gustafson ACM Algorithm 416: Rapid Computation of
777 [E1] . . . . . . . . . . . . . . . . . . 806--807
778 Sven-\AAke Gustafson ACM Algorithm 417: Rapid Computation of
780 Rules [D1] . . . . . . . . . . . . . . . 807--807
787 J. D. Ullman Principles of optimal page replacement 80--93
800 Matrix Equation $AX -+BX = C$ . . . . . 820--826
806 phase problem of X-ray crystallography 3--6
807 S. Levialdi On Shrinking Binary Picture Patterns . . 7--10
810 detect lines and curves in pictures . . 11--15
812 F. M. Djorup A CRT editing system . . . . . . . . . . 16--20
814 NEWBASIC system . . . . . . . . . . . . 21--28
816 Sort'' . . . . . . . . . . . . . . . . . 28--28
819 English . . . . . . . . . . . . . . . . 29--40
821 regression . . . . . . . . . . . . . . . 41--45
823 … +or-f(+or-f(+or-f(\ldots+or-f(x)\ldots))) when f(x) is positive monotonic 45--46
825 Fourier Integrals . . . . . . . . . . . 47--48
830 David Pager A Proposal for a Computer-Based
831 Interactive Scientific Community . . . . 71--75
833 general space planning . . . . . . . . . 76--87
836 Storing Algorithm . . . . . . . . . . . 88--93
839 in the centralization problem . . . . . 94--96
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
848 Length for Dense Ordered Lists'' . . . . 113--113
851 Pictures from Their Projections'' . . . 113--113
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
865 of a supervisory computer . . . . . . . 150--156
868 Protection Rings . . . . . . . . . . . . 157--170
870 Processes . . . . . . . . . . . . . . . 171--176
873 Scheduling Policies . . . . . . . . . . 177--184
876 mathematical model of locality . . . . . 185--190
878 Stuart C. Schwartz Properties of the working-set model . . 191--198
886 Measures in Information Systems . . . . 211--220
888 in a resource sharing computer network 221--230
891 recognition and signal processing . . . 231--244
893 object . . . . . . . . . . . . . . . . . 245--252
895 winning Shannon Switching Games . . . . 253--256
899 for Computer Scientists . . . . . . . . 257--261
901 control . . . . . . . . . . . . . . . . 262--267
903 Paging . . . . . . . . . . . . . . . . . 268--270
905 Function with Error Control . . . . . . 271--272
906 V. K. M. Whitney ACM Algorithm 422: Minimal Spanning Tree 273--274
908 Solver . . . . . . . . . . . . . . . . . 274--274
910 List-Compacting Algorithm . . . . . . . 275--275
911 T. C. Hu A Comment on the Double-Chained Tree . . 276--276
916 James K. Mullin An Improved Indexed-Sequential Access
917 Method Using Hashed Overflow . . . . . . 301--307
921 Design . . . . . . . . . . . . . . . . . 308--318
922 R. D. Christman MUX, a simple approach to on-line
923 computing . . . . . . . . . . . . . . . 319--329
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
931 D. Schultz Fast finite-difference solution of
932 biharmonic problems . . . . . . . . . . 347--350
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
940 Correlated Normal Variables . . . . . . 355--357
941 C. Bron ACM Algorithm 426: Merge Sort Algorithm 357--358
943 Integral . . . . . . . . . . . . . . . . 358--360
944 J. M. Yohe ACM Algorithm 428: Hu-Tucker Minimum
945 Redundancy Alphabetic Coding Method . . 360--362
950 systems . . . . . . . . . . . . . . . . 363--398
958 time-sharing systems by simulation . . . 411--420
960 memory via writable overlays . . . . . . 421--426
963 Parallel Processes . . . . . . . . . . . 427--437
964 J. F. Gimpel Blocks-a new datatype for SNOBOL 4 . . . 438--447
967 functions . . . . . . . . . . . . . . . 448--454
969 Responses . . . . . . . . . . . . . . . 455--459
972 second kind . . . . . . . . . . . . . . 460--461
973 I. Pohl A Sorting Problem and Its Complexity . . 462--464
975 error function) . . . . . . . . . . . . 465--466
977 eigenvectors of a real general matrix) 466--466
979 random number generator) [G5]'' . . . . 467--468
981 uniform in solid angle) . . . . . . . . 468--468
983 summation with arbitrary precision) . . 468--469
985 Fourier integrals) . . . . . . . . . . . 469--469
988 programming problem) . . . . . . . . . . 469--469
989 Abraham Kandel Computer Science --- A Vicious Circle 470--471
991 generative CAI tutor . . . . . . . . . . 472--473
995 Two-point Gauss-Legendre-Simpson's
1001 Lee Revens The first twenty-five years ACM
1002 1947--1962 . . . . . . . . . . . . . . . 485--490
1004 review . . . . . . . . . . . . . . . . . 491--497
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
1011 Computation . . . . . . . . . . . . . . 528--536
1013 Science . . . . . . . . . . . . . . . . 537--541
1016 nonlinear programming . . . . . . . . . 542--549
1018 Functions . . . . . . . . . . . . . . . 550--556 (or 550--554??)
1019 C. C. Foster A view of computer architecture . . . . 557--565
1021 data communications systems . . . . . . 566--573
1022 Per Brinch Hansen Structured Multiprogramming . . . . . . 574--578
1023 W. C. Lynch Operating system performance . . . . . . 579--585
1025 performance evaluation . . . . . . . . . 586--590
1027 (1965--1975) . . . . . . . . . . . . . . 591--600
1029 Future . . . . . . . . . . . . . . . . . 601--610
1031 software . . . . . . . . . . . . . . . . 611--617
1033 Systems for List Processing . . . . . . 618--627
1034 Charles W. Bachman The Evolution of Storage Structures . . 628--634
1036 computation . . . . . . . . . . . . . . 637--639
1038 information system development . . . . . 640--643
1039 S. Y. Sedelow Language analysis in the humanities . . 644--647
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
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
1054 C. C. Gotlieb Computers and employment . . . . . . . . 695--702
1059 John G. Herriot In memory of George E. Forsythe . . . . 719--720
1061 Computer Science . . . . . . . . . . . . 721--726
1065 Competition Award Papers) . . . . . . . 728--734
1068 Robert R. Roediger Political Redistricting by Computer . . 735--741
1070 with Disk Storage . . . . . . . . . . . 742--747
1074 Microprogramming and Emulation . . . . . 748--760
1077 Machine . . . . . . . . . . . . . . . . 761--771
1079 H. T. Gladwin Compiling fixed-point multiplications 772--772
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
1087 Harada . . . . . . . . . . . . . . . . . 775--775
1089 Roots of a Polynomial . . . . . . . . . 776--777
1092 Predominators in a Directed Graph . . . 777--778
1099 Graph Problems . . . . . . . . . . . . . 789--801
1100 Sakti P. Ghosh File Organization --- The Consecutive
1101 Retrieval Property . . . . . . . . . . . 802--808
1104 Contour Maps . . . . . . . . . . . . . . 809--812
1106 Precision . . . . . . . . . . . . . . . 813--817
1109 Problems . . . . . . . . . . . . . . . . 818--820
1113 ${\bf{A}}x+x{\bf{B}}={\bf{C}}$ . . . . . 820--826
1115 Hexagonal, and Triangular Arrays . . . . 827--837
1117 Methods . . . . . . . . . . . . . . . . 838--838
1119 matrices . . . . . . . . . . . . . . . . 839--839
1122 R. C. Holt Comment on Deadlock Prevention Method 840--841
1124 J. Feldman A controller for a Braille terminal . . 841--842
1126 Retrieval Using AVL Trees . . . . . . . 843--843
1131 E. W. Dijkstra The Humble Programmer . . . . . . . . . 859--866
1133 Working Sets on the Maniac II . . . . . 867--872
1136 Exponential and Normal Distributions . . 873--882
1137 Richard J. Hanson Integral Equations of Immunology . . . . 883--890
1140 Semantic Networks . . . . . . . . . . . 891--905
1142 Mask Method without Rule Mask . . . . . 906--909
1144 C. K. Wong Sorting by Natural Selection . . . . . . 910--913
1146 Factor in Programming'' . . . . . . . . 913--913
1149 Procedures . . . . . . . . . . . . . . . 914--918
1155 for Integrating Differential Equations 941--948
1157 Floating-Point Arithmetic . . . . . . . 949--951
1160 with Only Real Zeros . . . . . . . . . . 952--955
1161 Henry F. Ledgard Model for Type Checking --- with an
1162 Application to Algol 60 . . . . . . . . 956--966
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
1169 Computer Systems . . . . . . . . . . . . 981--986
1172 Symmetric Random Variables . . . . . . . 987--990
1174 for ${R\times{C}}$ Contingency Tables 991--992
1176 Gamma Function . . . . . . . . . . . . . 993--995
1178 P. S. T. Yuen Additional results on key-to-address
1181 formatted files . . . . . . . . . . . . 996--997
1182 S. Kennedy A note on optimal doubly-chained trees 997--998
1185 concurrent programming control problem 999--999
1187 composition . . . . . . . . . . . . . . 1000--1001
1193 H. C. Adams Dynamic Partitioning for Array Languages 1023--1032
1195 C. Witzgall Index Ranges for Matrix Calculi . . . . 1033--1039
1199 Structure . . . . . . . . . . . . . . . 1040--1044
1201 Scatter Tables . . . . . . . . . . . . . 1045--1047
1204 generators . . . . . . . . . . . . . . . 1048--1049
1207 Cauchy Problem for Parabolic Equations 1050--1052
1209 Decomposing Systems into Modules . . . . 1053--1058
1210 P. J. Brown Levels of Language for Portable Software 1059--1062
1213 J. C. Browne Trace-Driven Modeling and Analysis of
1215 System . . . . . . . . . . . . . . . . . 1063--1069
1217 Trapezoidal Integration . . . . . . . . 1070--1070
1219 Simpson's Integration . . . . . . . . . 1070--1071
1221 Three-point Gauss-Legendre-Simpson's
1229 working-set model'' . . . . . . . . . . 191--198
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
1240 Matrix Products . . . . . . . . . . . . 22--26
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
1249 education --- discussion . . . . . . . . 45--46
1251 within a direct-access table . . . . . . 46--47
1252 M. S. Atkins Mutual recursion in Algol 60 using
1253 restricted compilers . . . . . . . . . . 47--48
1256 Stratified Sampling . . . . . . . . . . 49--50
1258 the dipole distribution [G5] . . . . . . 51--51
1260 A. W. Davis ACM Algorithm 442: Normal deviate [S14] 51--52
1266 for Efficient Computer Search . . . . . 69--82
1267 S. Crespi-Reghizzi and
1270 Designing Programming Languages . . . . 83--90
1272 Implementation in SNOBOL4 . . . . . . . 91--100
1274 of Analytic Functions . . . . . . . . . 101--104
1276 Storage Techniques . . . . . . . . . . . 105--109
1279 David B. DeVaney A software design and evaluation system 110--116
1281 design . . . . . . . . . . . . . . . . . 117--122
1285 Transcendental Equation $w e^w = x$ . . 123--124
1292 Small Colleges . . . . . . . . . . . . . 139--147
1293 Robert A. Wagner Common Phrases and Minimum-Space Text
1294 Storage . . . . . . . . . . . . . . . . 148--152
1297 M. Goldstein Telecommunications Using a Front-End
1298 Minicomputer . . . . . . . . . . . . . . 153--160
1300 Computer-Communications System . . . . . 161--168
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
1308 Technique . . . . . . . . . . . . . . . 180--181
1309 W. H. Payne Graduate Education: The Ph.D. Glut . . . 181--182
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
1316 projections . . . . . . . . . . . . . . 186--186
1324 Machine . . . . . . . . . . . . . . . . 199--212
1325 John G. Williams Asymmetric Memory Hierarchies . . . . . 213--222
1328 Floating Point Number Systems . . . . . 223--230
1330 R. M. Keller Some Approaches to Best-Match File
1331 Searching . . . . . . . . . . . . . . . 230--236
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
1339 the Manipulation of Chebyshev Series . . 254--256
1342 and multipliers . . . . . . . . . . . . 257--257
1348 Information . . . . . . . . . . . . . . 275--281
1350 Effective Way to Use Decision Tables . . 282--286
1354 Computer Programs . . . . . . . . . . . 287--290
1356 Retrieval . . . . . . . . . . . . . . . 291--295
1359 Y. M. Lee Minimal Event-Node Network of Project
1360 Precedence Relations . . . . . . . . . . 296--298
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
1368 D. Obradovic Minit algorithm for linear programming 310--310
1369 D. Obradovic Minit algorithm for linear programming 310--310
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
1376 algorithms . . . . . . . . . . . . . . . 312--312
1378 composition in computational linguistics 313--313
1379 R. L. Wexelblat Another comment on computer music . . . 313--314
1381 computer science education . . . . . . . 314--315
1384 Remote Job Entry System . . . . . . . . 314--322
1386 Resources and Avoiding Deadlocks . . . . 323--329
1392 allocation and accounting . . . . . . . 337--342
1396 segmentation . . . . . . . . . . . . . . 343--349
1398 memory-content-generated interrupts . . 350--351
1400 Samuel F. Fuller On the Near-Optimality of the
1401 Shortest-Latency-Time-First Drum
1402 Scheduling Discipline . . . . . . . . . 352--353
1406 present-day computers . . . . . . . . . 353--354
1408 analysis . . . . . . . . . . . . . . . . 355--361
1409 Ben Shneiderman Optimum Data Base Reorganization Points 362--365
1411 parsing of complex decision situations 366--369
1412 James R. Bell Threaded Code . . . . . . . . . . . . . 370--372
1415 for Graph Manipulation . . . . . . . . . 372--378
1418 Multiply-Restricted Partitions . . . . . 379--379
1421 fitting . . . . . . . . . . . . . . . . 380--382
1422 W. D. Hoskins Cubic spline solutions to fourth-order
1423 boundary value problems . . . . . . . . 382--385
1426 Text . . . . . . . . . . . . . . . . . . 386--391
1432 Hypothesis . . . . . . . . . . . . . . . 399--405
1434 Storage . . . . . . . . . . . . . . . . 406--410
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
1439 Fast Buffer Storage . . . . . . . . . . 431--434
1440 Robert F. Rosin Teaching ``About Programming'' . . . . . 435--439
1445 Information Systems Administration . . . 439--442 (or 439--441??)
1446 A. Kandel Computer Science --- Seminars for
1447 Undergraduates . . . . . . . . . . . . . 442--442
1449 GOTO . . . . . . . . . . . . . . . . . . 443--444
1451 Context-Free Grammars . . . . . . . . . 444--445
1453 Programming Problems in 0-1 Variables 445--448 (or 445--447??)
1455 Spanning Tree'' . . . . . . . . . . . . 448--448
1457 A. M. Collins Hidden-line plotting program . . . . . . 448--448
1459 differential equations . . . . . . . . . 448--448
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??)
1471 Minimization . . . . . . . . . . . . . . 482--483
1472 R. B. Goldstein ACM Algorithm 451: Chi-Square Quantiles 483--485
1475 Combinations of $m$ Out of $n$ Objects 485--485
1477 Formulas for Bromwich's Integral . . . . 486--487
1480 for Constrained Optimization . . . . . . 487--489
1482 J. Vinar Complex gamma function . . . . . . . . . 489--489
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
1490 polynomial . . . . . . . . . . . . . . . 490--490
1493 Jean Vuillemin Inductive Methods for Proving Properties
1494 of Programs . . . . . . . . . . . . . . 491--502
1498 and Exit Statements . . . . . . . . . . 503--512
1499 Caxton C. Foster A Generalization of AVL Trees . . . . . 513--517
1506 Servers . . . . . . . . . . . . . . . . 527--531
1510 Computer Programs . . . . . . . . . . . 532--539
1512 Organization --- A Model and a System 540--548
1514 Querying . . . . . . . . . . . . . . . . 549--556
1515 Juan Rodriguez-Rosell Empirical Working Set Behavior . . . . . 556--560
1518 variable lookup . . . . . . . . . . . . 561--565
1519 M. V. Zelkowitz Reversible Execution . . . . . . . . . . 566--566
1522 cubatures . . . . . . . . . . . . . . . 567--571 (or 567--570??)
1525 Representations of the Symmetric Group 571--572
1526 Zden\vek Fencl ACM Algorithm 456: Routing Problem . . . 572--574
1529 of an Undirected Graph . . . . . . . . . 575--577
1532 Lexicographic Order'' . . . . . . . . . 577--578
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
1540 polynomial . . . . . . . . . . . . . . . 579--579
1546 Control in a Time-Sharing Environment 587--590
1549 Multiple Environments . . . . . . . . . 591--603
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
1555 Algorithms . . . . . . . . . . . . . . . 615--618
1557 Working Set Parameter . . . . . . . . . 619--620
1558 Robert E. Millstein Control Structures in Illiac IV Fortran 621--627
1562 Programming . . . . . . . . . . . . . . 629--631
1564 Circuits of a Graph . . . . . . . . . . 632--633
1568 Direction Implicit Procedures . . . . . 633--635
1572 Differential Equations . . . . . . . . . 635--637
1574 Distribution . . . . . . . . . . . . . . 638--638
1577 Scales on Computer Generated Plots . . . 639--640
1582 Charles W. Bachman The Programmer as Navigator . . . . . . 653--658
1584 Decisions . . . . . . . . . . . . . . . 659--668
1586 V. B. Schneider Parser-Generating System for
1587 Constructing Compressed Compilers . . . 669--676
1590 Storage Requirements . . . . . . . . . . 676--682
1593 Theorem-Prover Having Partial Ordering
1594 Inference Rules . . . . . . . . . . . . 682--688
1596 Symmetric Tridiagonal Matrix . . . . . . 689--689
1598 Frequency . . . . . . . . . . . . . . . 690--690
1600 Algorithms . . . . . . . . . . . . . . . 690--691
1602 in Place . . . . . . . . . . . . . . . . 692--694
1605 Finite Interval . . . . . . . . . . . . 694--699
1608 Finite Field . . . . . . . . . . . . . . 699--699
1611 Execution of Arithmetic Expressions . . 700--702
1615 algorithm (and author's reply) . . . . . 703--703
1616 E. Wegner Tree-structured programs . . . . . . . . 704--705
1618 one orthogonal expansion into another 705--707
1620 solution of Wiener-Hopf integral
1621 equations . . . . . . . . . . . . . . . 708--710
1624 Method . . . . . . . . . . . . . . . . . 711--714
1631 Systems . . . . . . . . . . . . . . . . 727--749
1633 Robert W. Taylor A Data Definition and Mapping Language 750--759
1635 Almost Tridiagonal Matrix . . . . . . . 760--761
1636 W. Gautschi ACM Algorithm 471: Exponential Integrals 761--763
1639 Natural Spline Interpolation . . . . . . 763--768
1644 G. Lyon Syntax-directed least-errors analysis
1645 for context-free languages: a practical
1646 approach . . . . . . . . . . . . . . . . 3--14
1649 Tridiagonal Systems of Linear Equations 14--17
1652 procedures . . . . . . . . . . . . . . . 18--20
1654 William G. Poole, Jr. Tridiagonalization by Permutations . . . 20--24
1656 Legendre Series Coefficients . . . . . . 25--25
1659 Based on Local Procedures . . . . . . . 26--31
1661 Gary W. Hodgman Reentrant Polygon Clipping . . . . . . . 32--42
1664 for the conversion of limited-entry
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
1675 Paged Memory Environment . . . . . . . . 63--69
1678 drawings . . . . . . . . . . . . . . . . 70--77
1681 Asymmetric Random Variables . . . . . . 78--82
1682 Leslie Lamport The Parallel Execution of DO Loops . . . 83--93
1684 than BNF? . . . . . . . . . . . . . . . 94--102
1685 Ben Wegbreit The Synthesis of Loop Predicates . . . . 102--112
1692 Synthetic Workload . . . . . . . . . . . 127--133
1696 R. Wood Dynamic Memory Repacking . . . . . . . . 133--138
1698 Devices . . . . . . . . . . . . . . . . 139--142
1700 and Descendants . . . . . . . . . . . . 143--152
1701 T. Wright Visible surface plotting program . . . . 152--157 (or 152--155??)
1703 E. L. Battiste Incomplete beta ratio . . . . . . . . . 156--157
1706 Organized Raster Display . . . . . . . . 157--163
1708 $p^n$ . . . . . . . . . . . . . . . . . 164--164
1710 Burnett and Coffman . . . . . . . . . . 165--166
1713 Squares Problems . . . . . . . . . . . . 167--169
1719 Performance . . . . . . . . . . . . . . 181--186
1722 from Program Transition Diagram . . . . 186--191
1724 a Page-On-Demand System . . . . . . . . 192--196
1728 Timetables . . . . . . . . . . . . . . . 196--197
1730 Workspace . . . . . . . . . . . . . . . 198--202
1731 Shimon Even Parallelism in Tape-Sorting . . . . . . 202--204
1735 school of business . . . . . . . . . . . 205--206
1739 Response and Rebuttal . . . . . . . . . 206--207
1741 S. V. Pollack Ideal teaching machines --- a solution
1742 to the pedagogic language problem . . . 207--208
1744 variables . . . . . . . . . . . . . . . 209--210
1745 A. Balfour An alternative approach to mutual
1747 compilers . . . . . . . . . . . . . . . 210--210
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
1756 Tension . . . . . . . . . . . . . . . . 220--223 (or 220--221??)
1758 Set-Partitions to Exactly ${R}$ Subsets 224--225
1760 we/sup w/=x . . . . . . . . . . . . . . 225--225
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
1771 Digits and Roundoff Errors . . . . . . . 269--271
1774 an Optimized Trial Division Routine . . 272--276
1778 Units . . . . . . . . . . . . . . . . . 276--277
1781 by Dynamic Disk Allocation . . . . . . . 278--288
1788 Efficiency . . . . . . . . . . . . . . . 301--308
1791 L. Wos A Theorem-Proving Language for
1792 Experimentation . . . . . . . . . . . . 308--314
1794 spatially-multiplexed character sets . . 315--318
1798 the ${L_1}$ Norm . . . . . . . . . . . . 319--320
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
1806 variables . . . . . . . . . . . . . . . 325--325
1808 tables . . . . . . . . . . . . . . . . . 326--326
1810 sciences . . . . . . . . . . . . . . . . 326--332
1813 for Phone Line Transmission . . . . . . 333--336
1821 Operating System . . . . . . . . . . . . 337--345
1825 Michael J. Snell An Information-Theoretic Approach to
1826 Text Searching in Direct Access Systems 345--350
1828 Graph . . . . . . . . . . . . . . . . . 351--353
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
1840 Mean Finishing Time . . . . . . . . . . 382--387
1842 Information Sharing in Multics . . . . . 388--402
1843 R. S. Fabry Capability-Based Addressing . . . . . . 403--412
1846 Third Generation Architectures . . . . . 412--421
1852 Storage of Data . . . . . . . . . . . . 434--436
1856 Requiring Secrecy in the Computer . . . 437--442
1857 George B. Purdy A High Security Log-in Procedure . . . . 442--445
1860 Encipherment Programs . . . . . . . . . 445--449
1864 Problem . . . . . . . . . . . . . . . . 450--453
1866 Programming Problem . . . . . . . . . . 453--455
1868 Decision Tables: Method and Objectives 456--462
1872 Natural Splines . . . . . . . . . . . . 463--467
1874 Network Transformation . . . . . . . . . 467--469
1877 [G7] . . . . . . . . . . . . . . . . . . 470--470
1878 A. H. Stroud Gauss Harmonic Interpolation Formulas 471--475
1880 Functions . . . . . . . . . . . . . . . 476--479
1883 … $\int_0^\infty[\exp(-ct)dt/(t)^{1/2}(1+t^2)]$ and Similar Integrals 480--481
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
1895 Languages and Deterministic Languages 517--519
1897 Three-Dimensional Plot Program with
1898 Rotations . . . . . . . . . . . . . . . 520--523
1901 ${K}_1(z)$ for Complex Arguments . . . . 524--526
1904 $g$-Splines via a Factorization Method 526--530
1906 Optimum Checkpoint Interval . . . . . . 530--531
1908 Approach to Converting Limited-Entry
1909 Decision Tables to Computer Programs . . 532--537
1915 Structuring Concept . . . . . . . . . . 549--557
1918 Storage Allocation . . . . . . . . . . . 558--568 (or 558--562??)
1921 working set size . . . . . . . . . . . . 563--565
1923 Peter Scheuermann Structured Data Structures . . . . . . . 566--574
1928 L. A. Wehr A Back-end Computer for Data Base
1929 Management . . . . . . . . . . . . . . . 575--583 (or 575--582??)
1934 Linear Programming Codes . . . . . . . . 583--587 (or 583--586??)
1936 of Laplace Transform . . . . . . . . . . 587--589 (or 587--588??)
1938 191 . . . . . . . . . . . . . . . . . . 589--590
1940 linear programming problems . . . . . . 590--590
1942 J. Klemsa Rosenbrock function minimization . . . . 590--591
1945 Nonlinear Least Squares'' . . . . . . . 591--591
1947 Richard E. Weber Enumerating Full-Time Programmers . . . 592--593
1954 Stanley House . . . . . . . . . . . . . 609--613
1956 Sets . . . . . . . . . . . . . . . . . . 614--620
1957 Perry Lowell Miller A locally-organized parser for spoken
1958 input . . . . . . . . . . . . . . . . . 621--630
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
1965 B. Werner An on-site data management system
1966 application in field archaeology . . . . 644--646
1968 strings in Fortran IV . . . . . . . . . 646--647
1969 C. J. Van Rijsbergen The best-match problem in document
1970 retrieval . . . . . . . . . . . . . . . 648--649
1972 GO TO nor labels . . . . . . . . . . . . 650--650
1977 Donald E. Knuth Computer Programming as an Art . . . . . 667--673
1980 Utility . . . . . . . . . . . . . . . . 674--678
1982 task monitor . . . . . . . . . . . . . . 679--685
1986 Parallel Processing Systems . . . . . . 685--690
1988 Variates with Non-Integral Shape
1989 Parameters . . . . . . . . . . . . . . . 691--695
1992 Scheduling Algorithm . . . . . . . . . . 696--698
1996 Equations . . . . . . . . . . . . . . . 699--702
1998 Distribution of the Kolmogorov-Smirnov
1999 Statistic for Small Samples . . . . . . 703--704
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
2009 Systems . . . . . . . . . . . . . . . . 54--65
2014 R. E. Millstein Control Structures in Illiac IV Fortran 157--164
2019 Definition Language for Data Conversion 557--567
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
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
2032 Non-Normal Matrices . . . . . . . . . . 30--36
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
2038 Irving T. Ho Storage-Efficient Representation of
2039 Decimal Data . . . . . . . . . . . . . . 49--52
2042 Formulas . . . . . . . . . . . . . . . . 53--56
2044 Deviation of Data . . . . . . . . . . . 57--58
2050 Probable-Word Proof . . . . . . . . . . ??
2053 Using Blockage Buffers . . . . . . . . . 91--95
2055 Base . . . . . . . . . . . . . . . . . . 96--106
2057 Jack Minker State-Space, Problem-Reduction, and
2058 Theorem Proving --- Some Relationships 107--115
2062 Accumulators . . . . . . . . . . . . . . 120--122
2068 C. A. R. Hoare Matrix Reduction --- an Efficient Method
2069 (school timetables) . . . . . . . . . . 141--150
2071 Lorinda L. Cherry A System for Typesetting Mathematics . . 151--157
2075 J. M. Randal GLYPNIR --- A programming language for
2076 Illiac IV . . . . . . . . . . . . . . . 157--164
2078 Ronald L. Rivest Expected Time Bounds for Selection . . . 165--172
2081 -- for Finding the $i$th Smallest of $n$
2082 Elements . . . . . . . . . . . . . . . . 173--173
2085 Inverse of a Sparse Matrix . . . . . . . 177--179
2086 L. F. Shampine Discrete Least Squares Polynomial Fits 179--180
2088 eigenvalues of non-normal matrices'' . . 180
2090 Problem (Without Conditional Statements) 181--183
2097 Socio-Economic-Political Factors . . . . 193--199
2100 Function of a Real Argument . . . . . . 200--202
2103 for Dynamic Storage Allocation'' . . . . 202--202
2105 for Class-Teacher Timetable Problems . . 203--208
2107 Faces . . . . . . . . . . . . . . . . . 209--216
2109 Size is not a Prime Number . . . . . . . 216--217
2112 Relations . . . . . . . . . . . . . . . 218--220
2114 Blocks in the Buddy System . . . . . . . 221--222
2117 Algorithms . . . . . . . . . . . . . . . 223--230
2119 David W. Matula On Salazar and Oakford . . . . . . . . . 240--240
2121 David S. Johnson On Salazar and Oakford . . . . . . . . . 240--241
2127 Time Using Bounded Workspace . . . . . . 251--252
2129 Data Base Structures . . . . . . . . . . 253--263
2131 of English . . . . . . . . . . . . . . . 264--274
2133 Generation . . . . . . . . . . . . . . . 275--276 (or 275--275??)
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
2141 Programming'' . . . . . . . . . . . . . 280--280
2144 Cardiography . . . . . . . . . . . . . . 281--285
2146 for Equipment or Furniture Layouts . . . 286--297
2148 David W. Matula More on the Salazar and Oakford Paper 303--303
2155 Cycles . . . . . . . . . . . . . . . . . 310--310
2157 Pictures . . . . . . . . . . . . . . . . 311--317
2162 Allocation in Storage Hierarchies . . . 318--322
2165 David L. Parnas Significant Event Simulation . . . . . . 323--329
2166 Robert B. K. Dewar Indirect Threaded Code . . . . . . . . . 330--331
2169 Fibonacci Buddy System . . . . . . . . . 331--332
2172 Bibliographic Search . . . . . . . . . . 333--340
2174 Maximal Common Subsequences . . . . . . 341--343
2176 Radix Conversion . . . . . . . . . . . . 344--346
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
2184 Charles T. Zahn, Jr. Ill-Chosen Use of ``Event'' . . . . . . 360--360
2190 Saturation in Multiprogramming Systems 371--377
2191 Soren Lauesen A large semaphore based operating system 377--389
2194 Grammars of Natural Language . . . . . . 390--400
2198 Systems . . . . . . . . . . . . . . . . 401--408
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
2205 women in the computer industry . . . . . 416--418
2211 Produced by First-Fit and Best-Fit
2212 Allocation Strategies . . . . . . . . . 433--440
2216 Grammars . . . . . . . . . . . . . . . . 441--452
2218 Formal Derivation of Programs . . . . . 453--457
2220 standard deviation of data . . . . . . . 458--458
2223 Language . . . . . . . . . . . . . . . . 459--462
2225 Constants'' . . . . . . . . . . . . . . 462--462
2228 simulation event list algorithms'' . . . 462--462
2230 T. Ho . . . . . . . . . . . . . . . . . 463--463
2232 with Redundancy . . . . . . . . . . . . 464--471
2233 Leslie Lamport Multiple Byte Processing with Full-Word
2234 Instructions . . . . . . . . . . . . . . 471--475
2236 Table . . . . . . . . . . . . . . . . . 476--480
2242 Collection . . . . . . . . . . . . . . . 495--508
2244 Used for Associative Searching . . . . . 509--517
2246 Population Dynamics . . . . . . . . . . 517--523
2248 Disks . . . . . . . . . . . . . . . . . 524--527
2249 Ben Wegbreit Mechanical Program Analysis . . . . . . 528--539
2255 DBTG Data Structures . . . . . . . . . . 551--557
2259 Definition Language for Data Conversion 557--567
2261 Philip Yen-Tang Chang Optimizing the Performance of a
2262 Relational Algebra Data Base Interface 568--579
2265 Query Language . . . . . . . . . . . . . 580--588
2266 Fanica Gavril Merging with Parallel Processors . . . . 588--591
2269 General Closed Queueing Networks . . . . 592--593
2277 Indexing . . . . . . . . . . . . . . . . 613--620
2282 Expressions: The Square Data Sublanguage 621--628
2284 Michael Marcotty A genealogy of control structures . . . 629--639
2286 Steven P. Rhodes Practical Syntactic Error Recovery . . . 639--650 (or 639--649??)
2288 Edward M. Reingold Backtrack Programming Techniques . . . . 651--656
2291 to the Compaction of Character Sets . . 656--657
2297 Languages, and Mathematics . . . . . . . 676--683
2299 Proposed Notation . . . . . . . . . . . 683--696
2304 Grammars . . . . . . . . . . . . . . . . 697--706
2307 Jeffrey D. Ullman On the Complexity of LR(k) Testing . . . 707--716
2310 global flow analysis . . . . . . . . . . 716--716
2312 Properties of Parallel Programs . . . . 717--721
2314 Language of Very High Level . . . . . . 722--728
2321 Holger Opderbeck A Study of Line Overhead in the ARPANET 3--13
2325 Disk Accesses . . . . . . . . . . . . . 13--18 (or 13--17??)
2326 Carson E. Agnew On Quadratic Adaptive Routing Algorithms 18--22
2330 E. B. Kaehler Performance of Height-Balanced Trees . . 23--28
2331 J. J. Florentin Information Reference Coding . . . . . . 29--33
2333 Gordon B. Davis Study of Errors, Error-Proneness, and
2334 Error Diagnosis in Cobol . . . . . . . . 33--37
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
2345 Permutation Algorithms . . . . . . . . . 68--72
2347 to Edge and Contour Detection . . . . . 73--83
2350 Systems . . . . . . . . . . . . . . . . 84--95
2352 Paging . . . . . . . . . . . . . . . . . 96--97
2356 Divisors . . . . . . . . . . . . . . . . 98--101
2363 Symbols and Search . . . . . . . . . . . 113--126
2366 Multiclass Batch Computer System . . . . 127--136
2368 J. Cocke A Program Data Flow Analysis Procedure 137--147 (or 137--146??)
2370 Protection in Database Systems . . . . . 148--159
2372 protection in database systems . . . . . 148--159
2379 programs . . . . . . . . . . . . . . . . 171--174
2381 BASIC . . . . . . . . . . . . . . . . . 175--181
2382 J. Raymond LG: A language for analytic geometry . . 182--187
2386 Zohar Manna Logical Analysis of Programs . . . . . . 188--206
2392 Flow . . . . . . . . . . . . . . . . . . 236--243
2393 Jonathan K. Millen Security Kernel Validation in Practice 243--250
2396 Design . . . . . . . . . . . . . . . . . 251--265
2400 of Operating Systems . . . . . . . . . . 266--272
2401 John H. Howard Proving Monitors . . . . . . . . . . . . 273--279 (or 273--278??)
2404 Programs: An Axiomatic Approach . . . . 279--285
2406 Alan P. Batson Characteristics of Program Localities 285--294
2408 R. S. Fabry VMIN --- an Optimal Variable-Space Page
2409 Replacement Algorithm . . . . . . . . . 295--297
2412 Algorithm via a Semi-Markov Model . . . 298--304
2419 computer science . . . . . . . . . . . . 311--313
2422 Algorithms . . . . . . . . . . . . . . . 314--326
2425 Systems with Interleaved Memory . . . . 327--334
2428 Addresses in Variable Length Addressing 335--338
2429 David S. Wise Referencing Lists by an Edge . . . . . . 338--342
2432 conversion . . . . . . . . . . . . . . . 343--351
2434 constant Workspace . . . . . . . . . . . 352--354 (or 353--354??)
2436 Compactifying Garbage Collection'' . . . 354--354
2438 Combinations . . . . . . . . . . . . . . 355--356
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
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
2460 storage allocation . . . . . . . . . . . 416--417
2461 G. H. Gonnet Heaps applied to event driven mechanisms 417--418
2467 Education . . . . . . . . . . . . . . . 430--436
2469 Programming Languages . . . . . . . . . 437--453
2470 James H. Clark Designing Surfaces in 3-D . . . . . . . 454--460
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
2482 replacement algorithm via a semi-Markov
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
2491 Optimization . . . . . . . . . . . . . . 514--516
2495 Reflected Gray Code and Its Applications 517--521
2498 Garbage Collector . . . . . . . . . . . 522--526
2499 Ben Wegbreit Faster Retrieval from Context Trees . . 526--529
2506 Generated Images . . . . . . . . . . . . 542--547
2508 Visible Surface Algorithms . . . . . . . 547--554
2511 Quadric Surfaces . . . . . . . . . . . . 555--563
2515 Animation . . . . . . . . . . . . . . . 564--569
2517 Computer Programs . . . . . . . . . . . 570--576
2518 C. Duong-Kien and
2519 H.-J. Hoffmann and
2522 functions . . . . . . . . . . . . . . . 576--577
2525 Academic Computer Science . . . . . . . 578--581
2531 applications) . . . . . . . . . . . . . 595--600
2533 William C. Cave Cobol Under Control . . . . . . . . . . 601--608
2538 Programming System . . . . . . . . . . . 609--616
2539 Frank Rubin Experiments in Text File Compression . . 617--623 (or 617--622??)
2544 locks in a database system . . . . . . . 624--633
2547 Space Disk Files . . . . . . . . . . . . 634--642
2548 Richard G. Hamlet High-Level Binding with Low-Level
2549 Linkers . . . . . . . . . . . . . . . . 642--644
2555 1974--75 . . . . . . . . . . . . . . . . 655--669
2557 Research Study (COSERS) . . . . . . . . 670--673
2561 Carl Singer Computer-Aided Analysis and Design of
2562 Information Systems . . . . . . . . . . 674--687
2567 Waveform Parsing System . . . . . . . . 688--695
2573 approach for application programmers . . 2--12
2577 Science Education Since Curriculum '68 13--21
2578 Jair M. Babad A Record and File Partitioning Model . . 22--31 (or 22--30??)
2580 Frederick R. Carlson, Jr. Detection of Combined Occurrences . . . 31--36 (or 31--35??)
2583 Programs . . . . . . . . . . . . . . . . 36--44
2584 David Gries On Believing Programs to be Correct . . 49--50
2590 Array Processing by Computer . . . . . . 63--77
2593 LISP . . . . . . . . . . . . . . . . . . 78--87
2596 Two and Three Dimensions . . . . . . . . 87--93
2598 B. T. Bennett Transient-Free Working-Set Statistics 93--99
2600 Digital Display of Circular Arcs . . . . 100--106
2604 Programming Models . . . . . . . . . . . 107--112
2605 Gary D. Knott A Numbering System for Binary Trees . . 113--115
2611 Access Files . . . . . . . . . . . . . . 127--135
2614 Term Accuracy . . . . . . . . . . . . . 135--142
2616 Instruction Set Processor Architectures 143--153
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
2624 J. D. Ullman Operations on Sparse Relations . . . . . 171--176
2626 Attitudes . . . . . . . . . . . . . . . 177--185
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
2633 parsing . . . . . . . . . . . . . . . . 192--196 (or 192--194??)
2639 Ben Wegbreit Subgoal Induction . . . . . . . . . . . 209--222
2642 Local Analysis of Graphs . . . . . . . . 223--229
2644 Game of Poker . . . . . . . . . . . . . 230--245
2647 Virtual Memory Indexes . . . . . . . . . 245--254
2649 Jimmy A. Sutton Stage Hypothesis and the S-Curve: Some
2650 Contradictory Evidence . . . . . . . . . 254--259
2652 organizations . . . . . . . . . . . . . 260--261
2654 structured data structures . . . . . . . 261--262
2656 search for scatter tables . . . . . . . 262--263
2658 H. T. Kung Sorting on a Mesh-Connected Parallel
2659 Computer . . . . . . . . . . . . . . . . 263--271
2662 Structured Programs . . . . . . . . . . 271--283
2671 Programming . . . . . . . . . . . . . . 301--309
2673 Simulation Output Analysis . . . . . . . 310--315
2676 Computer Networks . . . . . . . . . . . 315--322
2677 J.-L. Baer and
2678 B. Schwab A Comparison of Tree-Balancing
2679 Algorithms . . . . . . . . . . . . . . . 322--330
2683 Computer Graphics . . . . . . . . . . . 331--339
2684 Marvin Shapiro Choice of Reference Points in Best-Match
2685 File Searching . . . . . . . . . . . . . 339--343
2687 Expressions in an Online Query System 344--347
2689 Parameters in Databases . . . . . . . . 347--350
2692 Common Subsequences . . . . . . . . . . 350--353
2699 Computer Science --- 1976 . . . . . . . 370--372
2705 Programming . . . . . . . . . . . . . . 373--381
2707 R. W. Taylor Two Views of Data Abstraction . . . . . 382--384
2710 (SBA): Programming Language . . . . . . 385--396
2712 of Data Structures . . . . . . . . . . . 396--404
2714 Diane C. P. Smith Database Abstractions: Aggregation . . . 405--413
2716 Narain Gehani Some Ideas on Data Types in High-Level
2717 Languages . . . . . . . . . . . . . . . 414--420
2719 Theodore A. Norman Buddy Systems . . . . . . . . . . . . . 421--431
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
2731 Computer Networks . . . . . . . . . . . 461--468
2733 R. S. Fabry A Unifying Approach to Scheduling . . . 469--477
2736 Distributed Computer Network . . . . . . 477--485
2738 Butler W. Lampson A terminal-oriented communication system 486--494
2741 System for Small Computers . . . . . . . 495--499
2743 Synchronization in Monitors . . . . . . 500--503
2746 Information Flow . . . . . . . . . . . . 504--513
2748 Compile Time . . . . . . . . . . . . . . 513--518
2751 Iteration . . . . . . . . . . . . . . . 519--526
2752 J. Nevil Brownlee An Algol-based implementation of SNOBOL
2753 4 patterns . . . . . . . . . . . . . . . 527--529
2760 Edwin H. Satterthwaite Early Experience with Mesa . . . . . . . 540--553
2765 Generators . . . . . . . . . . . . . . . 553--564
2769 Craig Schaffert Abstraction Mechanisms in CLU . . . . . 564--576
2770 Niklaus Wirth Toward a Discipline of Real-Time
2771 Programming . . . . . . . . . . . . . . 577--583
2773 conventions . . . . . . . . . . . . . . 584--595
2776 Simulation Event Set . . . . . . . . . . 596--602
2778 paths in a graph . . . . . . . . . . . . 603--604
2781 subprograms . . . . . . . . . . . . . . 604--605
2786 Michael O. Rabin Complexity of Computations . . . . . . . 625--633
2787 Dana S. Scott Logic and Programming Languages . . . . 634--641
2789 Science . . . . . . . . . . . . . . . . 642--645
2791 Structured Programming Language . . . . 647--654
2793 Primary Memory Requirements . . . . . . 655--663
2795 of Prime Numbers . . . . . . . . . . . . 664--669
2796 Edward M. McCreight Pagination of B*-Trees with
2797 Variable-Length Records . . . . . . . . 670--674
2805 Planar Contours . . . . . . . . . . . . 693--702
2806 Sheng-Chuan C. Wu and
2809 Approach to Surface Representation . . . 703--712
2810 Barry K. Rosen High-Level Data Flow Analysis . . . . . 712--724
2813 F. Turini Two-Level Control Structure for
2814 Nondeterministic Programming . . . . . . 725--730
2816 Parsers . . . . . . . . . . . . . . . . 731--741
2818 Avoidance Problem . . . . . . . . . . . 741--745
2819 Evan L. Ivie Programmer's Workbench --- a Machine for
2820 Software Development . . . . . . . . . . 746--753
2822 Memory Interference . . . . . . . . . . 754--761
2824 J. Strother Moore A Fast String Searching Algorithm . . . 762--772
2830 language standards activities . . . . . 788--794
2833 for Simulation of Paging Behavior . . . 795--798
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
2841 template matching . . . . . . . . . . . 820--822
2844 definitions? . . . . . . . . . . . . . . 822--823
2845 M. K. Roy A note on reflection-free permutation
2846 enumeration . . . . . . . . . . . . . . 823--823
2849 Programs . . . . . . . . . . . . . . . . 824--831
2854 Data Processing Applications . . . . . . 832--840
2856 Probe Retrieving Method for Static Sets 841--850
2859 Strength . . . . . . . . . . . . . . . . 850--856
2861 of Recursion . . . . . . . . . . . . . . 856--863
2863 Simulation . . . . . . . . . . . . . . . 864--873
2867 Sorting and Indexing . . . . . . . . . . 874--878
2870 Allocation Problem . . . . . . . . . . . 878--882
2878 in small liberal arts colleges . . . . . 902--906
2880 Nonprocedural Programming Language . . . 906--913
2882 Technique for Compilers . . . . . . . . 914--920
2884 Correct . . . . . . . . . . . . . . . . 921--930
2886 specification . . . . . . . . . . . . . 931--935
2889 Service Measurement . . . . . . . . . . 936--944
2892 local governments . . . . . . . . . . . 945--956
2898 Construction from Examples . . . . . . . 161--175
2900 historical perspective . . . . . . . . . 4--12
2903 system . . . . . . . . . . . . . . . . . 13--24
2908 Projection . . . . . . . . . . . . . . . 25--43
2912 R. Hill The Evolution of the DECsystem 10 . . . 44--63
2913 Richard M. Russell The CRAY-1 Computer System . . . . . . . 63--72
2915 Andris Padegs Architecture of the IBM System/370 . . . 73--96
2922 status of minorities and women . . . . . 115--119
2926 Signatures and Public-Key Cryptosystems 120--126
2928 H. R. Strong Systematic Recursion Removal . . . . . . 127--134
2933 Graphs . . . . . . . . . . . . . . . . . 135--139
2935 Michael Stonebraker B-Trees Re-Examined . . . . . . . . . . 139--143
2937 Markov Modeling . . . . . . . . . . . . 144--152
2941 Reconstruction . . . . . . . . . . . . . 152--158
2945 Proving Program Correctness) . . . . . . 159--172
2948 in Digital Pictures . . . . . . . . . . 172--176
2957 Research . . . . . . . . . . . . . . . . 197--205
2960 American Local Governments . . . . . . . 206--218
2962 students . . . . . . . . . . . . . . . . 219--225
2963 S. Rao Kosaraju Insertions and Deletions in One-Sided
2964 Height-Balanced Trees . . . . . . . . . 226--227
2967 Richard J. Lipton Preserving Average Proximity in Arrays 228--231
2971 Algorithms . . . . . . . . . . . . . . . 232--236
2973 for Machine Architecture . . . . . . . . 237--246
2981 Encryption . . . . . . . . . . . . . . . 259--263
2983 Between Files . . . . . . . . . . . . . 264--268
2984 Art Lew Optimal Conversion of Extended-Entry
2986 Criteria . . . . . . . . . . . . . . . . 269--279
2988 Computer . . . . . . . . . . . . . . . . 280--294
2990 Channels . . . . . . . . . . . . . . . . 294--299
2992 Span-Dependent Instructions . . . . . . 300--308
2994 Priority Queues . . . . . . . . . . . . 309--315
2997 Strings . . . . . . . . . . . . . . . . 315--317
2999 nonintegral shape parameters . . . . . . 317--322
3005 Structures . . . . . . . . . . . . . . . 351--357
3008 Constraints on Data Access . . . . . . . 358--367
3010 Correctness . . . . . . . . . . . . . . 368--375
3012 Example and Overview . . . . . . . . . . 376--385
3015 Languages . . . . . . . . . . . . . . . 385--391
3017 Ralph E. Griswold The SL5 procedure mechanism . . . . . . 392--400
3018 Frederick Hayes-Roth and
3020 Inducing Abstractions . . . . . . . . . 401--411
3024 Application . . . . . . . . . . . . . . 411--418
3026 Variables . . . . . . . . . . . . . . . 419--422
3028 Block-Transfer CCD Memory . . . . . . . 423--425
3035 One-Sided Height-Balanced Trees . . . . 441--445
3038 Binary Search Trees . . . . . . . . . . 445--447
3041 Algorithms . . . . . . . . . . . . . . . 448--458
3043 John A. Modry Automatic Error Recovery for LR Parsers 459--465
3047 Maintenance . . . . . . . . . . . . . . 466--471
3049 Programming Productivity . . . . . . . . 472--483
3050 Rob Kling Automated Welfare Client-Tracking and
3052 Economy of Computing . . . . . . . . . . 484--493
3055 Under Intermittent Failures . . . . . . 493--499
3056 Toby J. Teorey General Equations for Idealized CPU-I/O
3057 Overlap Configurations . . . . . . . . . 500--507
3063 System for a Large Relational Data Base 526--539
3066 measure of $\bigcup[a_i,b_i]$ . . . . . 540--544
3068 Near-Optimal Computation Order of Matrix
3069 Chain Products . . . . . . . . . . . . . 544--549
3072 Haim Avni Interpolation Search --- A Log Log N
3073 Search . . . . . . . . . . . . . . . . . 550--553
3075 George Philokyprou Pseudochaining in Hash Tables . . . . . 554--557
3077 in a Distributed System . . . . . . . . 558--565
3078 Henry Givens Baker, Jr. Shallow Binding in Lisp 1.5 . . . . . . 565--569
3080 Optimized Code . . . . . . . . . . . . . 570--582
3082 Equality . . . . . . . . . . . . . . . . 583--585
3085 Systems Using Computer-Aided Algebra . . 586--591
3086 Lawrence Snyder B-Trees Re-examined . . . . . . . . . . 594--594
3093 and its Algebra of Programs . . . . . . 613--641
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
3104 Multiprogramming-Multiprocessor Computer
3105 System . . . . . . . . . . . . . . . . . 678--686
3107 C. Robert Carlson Self-Assessment Procedure V: a
3108 self-assessment procedure dealing with
3109 database systems . . . . . . . . . . . . 687--693
3116 for the Bel-Petrov classification of
3117 gravitational fields . . . . . . . . . . 715--717
3119 Systems . . . . . . . . . . . . . . . . 718--723
3121 Analysis Algorithm . . . . . . . . . . . 724--736
3124 in Operating Systems . . . . . . . . . . 737--749
3127 Reference Strings . . . . . . . . . . . 750--759
3129 and Code Walkthroughs/Inspections . . . 760--768
3132 D. Wood Right Brother Trees . . . . . . . . . . 769--776
3135 Events . . . . . . . . . . . . . . . . . 777--785
3136 K. Maly A note on virtual memory indexes . . . . 786--787
3138 Contour Maps . . . . . . . . . . . . . . 788--790
3140 algorithms . . . . . . . . . . . . . . . 790--791
3145 Walt Brainerd Fortran 77 . . . . . . . . . . . . . . . 806--820
3150 I/O:I/O Overlap . . . . . . . . . . . . 821--831
3152 Technique . . . . . . . . . . . . . . . 831--834
3153 Shi-Kuo Chang and
3154 Yin-Wah Wong Optimal Histogram Matching by Monotone
3155 Gray Level Transformation . . . . . . . 835--840
3157 Small Registers . . . . . . . . . . . . 840--842
3159 National Flag Problem . . . . . . . . . 842--846
3160 Robert Sedgewick Implementing Quicksort Programs . . . . 847--857
3161 Gordon Lyon Packed Scatter Tables . . . . . . . . . 857--865
3163 Ronald Fagin Cold-Start Vs. Warm-Start Miss Ratios 866--872
3166 structure for the simulation event set 873--875
3172 Approach . . . . . . . . . . . . . . . . 889--895
3174 Environment Graphical System (Sembegs) 897--904
3178 Simulation . . . . . . . . . . . . . . . 904--913
3181 Images with Surface Models . . . . . . . 914--924
3183 Variables --- II . . . . . . . . . . . . 925--928
3184 G. David Ripley Simple Recovery-Only Procedure for
3185 Simple Precedence Parsers . . . . . . . 928--930
3187 D. S. Wise A Note on Conditional Expressions . . . 931--933
3189 Programming Concept . . . . . . . . . . 934--941
3191 Linda Pagli Power Trees . . . . . . . . . . . . . . 941--947
3193 Technique for Frequently Occurring Keys 947--958
3195 Processes'' . . . . . . . . . . . . . . 958--958
3196 Eugene C. Freuder Synthesizing Constraint Expressions . . 958--966
3201 E. F. M. Steffens On-the-Fly Garbage Collection: An
3202 Exercise in Cooperation . . . . . . . . 966--975
3211 Large Networks of Computers . . . . . . 993--999
3214 Prime Numbers . . . . . . . . . . . . . 999--1003
3217 John H. Howard The Selection of Optimal Tab Settings 1004--1007
3221 Empirical Evaluation . . . . . . . . . . 1008--1015
3224 Table Programs . . . . . . . . . . . . . 1016--1025
3227 Heuristically Guided Search . . . . . . 1025--1039
3230 Packets . . . . . . . . . . . . . . . . 1040--1048
3234 Validation . . . . . . . . . . . . . . . 1048--1064
3238 Proof . . . . . . . . . . . . . . . . . 1064--1075
3243 J. L. Bentley Multidimensional Divide-and-Conquer . . 214--228
3249 Surfaces . . . . . . . . . . . . . . . . 3--9
3251 technology by the police . . . . . . . . 10--20
3254 Memory . . . . . . . . . . . . . . . . . 21--25
3258 Systems . . . . . . . . . . . . . . . . 25--34
3261 L. Trilling An event-driven compiling technique . . 34--42
3263 and Program Manipulation . . . . . . . . 43--54
3270 computer science --- 1977 and 1978 . . . 75--76
3272 level computer scientists . . . . . . . 77--78
3274 M. A. Jenkins Recursive data structures in APL. . . . 79--96
3277 Partial Redundancies . . . . . . . . . . 96--103
3281 Static Sets . . . . . . . . . . . . . . 104--105
3285 Gary R. Sager Thoth, a Portable Real-Time Operating
3286 System . . . . . . . . . . . . . . . . . 105--115
3289 Sequencers . . . . . . . . . . . . . . . 115--123
3293 Files . . . . . . . . . . . . . . . . . 124--130
3304 Science --- A Report of the ACM
3305 Curriculum Committee on Computer Science 147--166
3307 Samuel C. Lee FOCUS microcomputer number system . . . 166--177
3310 Classification . . . . . . . . . . . . . 178--183
3312 Robert A. Kowalski Logic and Semantic Networks . . . . . . 184--192
3314 Information Storage and Retrieval . . . 193--207
3316 for the Dutch National Flag Problem'' 207--207
3321 Arthur M. Lesk Detection of Three-Dimensional Patterns
3322 of Atoms in Chemical Structures . . . . 219--224
3326 Computer Systems . . . . . . . . . . . . 225--233
3329 Distributed Information Systems . . . . 233--245
3334 Problems . . . . . . . . . . . . . . . . 245--251
3336 Graph . . . . . . . . . . . . . . . . . 251--256
3344 and Programs . . . . . . . . . . . . . . 271--280
3347 Extrema-Finding in Circular
3348 Configurations of Processors . . . . . . 281--283
3350 Transactions: an Empirical Investigation 283--289
3351 John C. Reynolds Reasoning About Arrays . . . . . . . . . 290--299
3353 Multi-Interpreter Systems . . . . . . . 299--309
3359 walk-throughs in teaching COBAL
3360 programming . . . . . . . . . . . . . . 335--340
3363 training in software engineering . . . . 341--345
3365 Design in Business Application Systems 345--353
3367 Computing . . . . . . . . . . . . . . . 353--368
3369 Programs'' . . . . . . . . . . . . . . . 368--368
3372 an Aid in Scene Analysis . . . . . . . . 368--375
3377 T. Winograd Beyond Programming Languages . . . . . . 391--401
3378 F. P. Preparata An Optimal Real-Time Algorithm for
3379 Planar Convex Hulls . . . . . . . . . . 402--405
3383 Environment . . . . . . . . . . . . . . 405--415
3387 Multi-Class Systems by Memory Allocation 415--424
3388 Robert A. Kowalski Algorithm = Logic + Control . . . . . . 424--436
3394 G. Scott Graham Self-Assessment Procedure VI: a
3395 self-assessment procedure dealing with
3397 systems . . . . . . . . . . . . . . . . 449--454
3398 R. W. Floyd The paradigms of programming . . . . . . 455--460
3402 Parallel Computers . . . . . . . . . . . 461--464
3405 Orderings . . . . . . . . . . . . . . . 465--476
3407 Network . . . . . . . . . . . . . . . . 476--482
3409 and standard deviation estimates . . . . 483--483
3416 Science --- A Report to the National
3417 Science Foundation and Others . . . . . 497--502
3422 Computer Science . . . . . . . . . . . . 503--504
3424 of the Boyer-Moore String Matching
3425 Algorithm . . . . . . . . . . . . . . . 505--508
3426 Kari-Jouko Raiha and
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
3434 Cellular Maps . . . . . . . . . . . . . 518--525
3436 J. G. Lewis Computing standard deviations: accuracy 526--531
3438 improved method . . . . . . . . . . . . 532--535
3446 344--347, MR 55 #9627] by M. Z. Hanani 549--550
3451 344--347, MR 55 #9627] by M. Z. Hanani 550--553
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
3468 R. E. Mayer A psychology of learning BASIC . . . . . 589--593
3470 K. Thompson Password Security --- A Case History . . 594--597
3473 Relaxation Algorithm . . . . . . . . . . 598--605
3475 Andrew Chi Chih Yao Storing a Sparse Table . . . . . . . . . 606--611
3476 Adi Shamir How to Share a Secret . . . . . . . . . 612--613
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
3484 caused losses . . . . . . . . . . . . . 654--660
3487 anatomy of a research agenda . . . . . . 660--671
3490 Local Network . . . . . . . . . . . . . 711--721
3495 Hanan Samet A quadtree medial axis transform . . . . 680--693
3500 Peter K. Pearson Fast Hashing of Variable-Length Text
3501 Strings . . . . . . . . . . . . . . . . 677--680
3506 Daniel M. Sunday A Very Fast Substring Search Algorithm 132--142
3514 Text Strings . . . . . . . . . . . . . . 118--119
3516 Text Strings . . . . . . . . . . . . . . 118--120
3524 Statements . . . . . . . . . . . . . . . 261--301
3531 Global Flow Analysis . . . . . . . . . . 172--202
3537 number problem . . . . . . . . . . . . . 451--463
3544 V. R. Pratt Fast pattern matching in strings . . . . 323--350
3546 Software --- Practice and Experience
3550 K.-C. Tai The practicality of text signatures for
3551 accelerating string searching . . . . . 35--44
3557 Functions of the First Kind [S17]'' . . 282--284
3559 [Z]'' . . . . . . . . . . . . . . . . . 285--285
3565 Three-Dimensional Plot Program with
3566 Rotations [J6]'' . . . . . . . . . . . . 285--285
3573 Contingency Tables [G2]'' . . . . . . . 108--108
3575 Surface Plotting Program [J6]'' . . . . 109--110
3579 Spanning Tree Clustering Method [Z]'' 110--111
3582 Kolmogorov-Smirnov Statistic for Small
3583 Samples [S14]'' . . . . . . . . . . . . 111--111
3586 [S22]'' . . . . . . . . . . . . . . . . 112--112
3593 Beta Ratio [S14]'' . . . . . . . . . . . 207--208
3596 Procedures [E2]'' . . . . . . . . . . . 208--208
3602 Function Minimization [E4]'' . . . . . . 300--301
3604 SELECT --- for Finding the $i$th
3605 Smallest of $n$ Elements [M1]'' . . . . 301--304
3611 of Two Blocks of Data [K2]'' . . . . . . 392--393
3612 Mohamed el Lozy Remark on ``Algorithm 299: Chi-Squared
3613 Integral [S15]'' . . . . . . . . . . . . 393--395
3616 Inversion of Laplace Transform [D5]'' 395--396
3622 David W. Twigg Algorithm 513: Analysis of In-Situ
3623 Transposition [F1] . . . . . . . . . . . 104--110
3625 Inversion of Laplace Transform'' . . . . 111--111
3632 One'' . . . . . . . . . . . . . . . . . 204--250
3638 Matrix Package (Part I) [F4]'' . . . . . 303--303
3640 Ordering for PERT Networks'' . . . . . . 303--303
3646 Elliptic Integral [S21]'' . . . . . . . 95--95
3652 Neumann Function'' . . . . . . . . . . . 295--295
3654 Matrix Package (Part I) [F4]'' . . . . . 295--295
3656 Incomplete Gamma Function [S14]'' . . . 296--304
3662 $t$-Distribution'' and Remark on
3664 [S14]'' . . . . . . . . . . . . . . . . 238--239
3666 Clenshaw-Curtis Quadrature [O1]'' . . . 240--240
3669 Based on Local Procedures'' . . . . . . 241--241
3675 In-Situ Transposition [F1]'' and Remark
3677 in Place'' . . . . . . . . . . . . . . . 520--520
3680 Surface Plotting Program'' . . . . . . . 521--523
3688 Matrix Package (Part 1) [F4]'' . . . . . 456--457
3694 $t$-Distribution'' . . . . . . . . . . . 247--249
3696 $t$-Quantiles'' . . . . . . . . . . . . 250--251
3698 M. C. Pike Remark on ``Algorithm 299: Chi-Squared
3699 Integral'' . . . . . . . . . . . . . . . 185--185
3705 [Z]'' . . . . . . . . . . . . . . . . . 441--443