Lines Matching refs:of
2 Communications of the ACM
8 Communications of the ACM
14 Communications of the ACM
19 Communications of the ACM
25 Communications of the ACM
28 W. Gautschi ACM Algorithm 236: Bessel Functions of
31 Communications of the ACM
36 Communications of the ACM
42 Communications of the ACM
45 W. Fletcher ACM Algorithm 284: Interchange of Two
46 Blocks of Data . . . . . . . . . . . . . 326
48 Communications of the ACM
54 Communications of the ACM
59 Communications of the ACM
62 ANSI Subcommittee X3J3 Clarification of Fortran Standards ---
65 Communications of the ACM
71 Communications of the ACM
77 Communications of the ACM
80 T. C. Lowe Automatic segmentation of cyclic program
84 Bruce J. Klein Recursive computation of certain
85 derivatives --- A study of error
96 of Laplace Transforms . . . . . . . . . 47--49
97 H. E. Schaffer ACM Algorithm 369: Generator of Random
112 Anonymous Interchange rolls of perforated tape for
117 Communications of the ACM
130 C. E. Radke The Use of Quadratic Residue Research 103--105
139 of management . . . . . . . . . . . . . 110--114, 19
143 J. S. White ACM Algorithm 373: Number of Doubly
153 Communications of the ACM
165 D. C. Wood Measurements of Segment Size . . . . . . 155--159
168 D. G. Schweikert A Comparison of Error Improvement
179 S. M. Swanson ACM Algorithm 377: Symbolic Expansion of
181 M. V. Kailas Another method of converting from
185 H. A. Maurer A Note on the Complement of Inherently
191 Communications of the ACM
196 J. Rau Creation and Control of Internal Data
202 P. Brinch Hansen The Nucleus of a Multiprogramming System 238--241, 250
209 of Simultaneous Nonlinear Equations . . 259--260
218 parameters of procedures . . . . . . . . 266--266
223 Communications of the ACM
227 Analysis of Biomedical Images . . . . . 279--283, 286
234 T. H. Naylor Application of Sequential Sampling to
236 J. Loeckx Algorithm for the Construction of
239 Based on the Principle of Completeness
245 of a Rectangular Matrix . . . . . . . . 324--326 (or 324--325??)
249 Communications of the ACM
252 H. A. Elder On the Feasibility of Voice Input to an
255 V. Rajaraman On the Conversion of Decision Tables to
263 K. E. Hillstrom Comparison of Several Adaptive
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
275 Eigenvectors of a Real Symmetric Matrix
277 R. L. London Certification of Algorithm 245 (M1)
278 Treesort 3: Proof of Algorithms --- A
279 New Kind of Certification . . . . . . . 371--374
282 E. F. Codd A Relational Model of Data for Large
285 Communications of the ACM
298 Common Divisor of $n$ Integers . . . . . 433--436
303 Divisor of $n$ Integers and Multipliers 447--448
311 Communications of the ACM
314 N. R. Nielsen Allocation of Computer Resources. is
325 J. W. Gintell The instrumentation of Multics . . . . . 495--500
348 Anonymous Identification of States of the United
349 States (including the District of
352 Communications of the ACM
355 W. Jack Bouknight A Procedure for Generation of
366 G. W. Kimble A Variation of the Goodman-Lance Method
367 for the Solution of Two-Point Boundary
373 M. H. van Emden Increasing the Efficiency of Quicksort 563--567 (or 563--566??)
375 Dennis McCall ACM Algorithm 392: Systems of Hyperbolic
384 Z. Bavel On the Number of Automorphisms of a
387 Communications of the ACM
409 L. B. Smith The use of interactive graphics to solve
412 Communications of the ACM
437 Efficiency of Quicksort . . . . . . . . 693--694
445 J. Rokne Condition numbers of Pei matrices . . . 699--699
447 Communications of the ACM
452 edit functions of time . . . . . . . . . 715--721
454 the Elementary Circuits of a Graph . . . 722--726
470 and Eigenvectors of a Real Symmetric
473 P. E. Jackson Estimates of Distributions of Random
478 W. J. Raduchel Efficient handling of binary data . . . 758--759
480 Isolation of Computer Scientists . . . . 759--760
482 Communications of the ACM
490 Shi-Kuo Chang The Reconstruction of Binary Patterns
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
499 C. A. R. Hoare Proof of a Program: FIND . . . . . . . . 39--45
500 L. G. Proll Further evidence for the analysis of
509 K. A. Redish Comment on London's Certification of
511 S. L. Pollack Comment on the conversion of decision
514 Communications of the ACM
517 K. Schwayder Conversion of Limited-Entry Decision
520 K. Shwayder Conversion of limited-entry decision
526 N. R. Nielsen An analysis of some time-sharing
531 H. Hurwitz, Jr. On the Probability Distribution of the
532 Values of Binary Trees . . . . . . . . . 99--102
534 R. C. T. Lee Application of Game Tree Searching
541 G. L. Thompson ACM Algorithm 405: Roots of Matrix
545 Communications of the ACM
556 C. W. Gear The Automatic Integration of Ordinary
558 J. A. Howell ACM Algorithm 406: Exact Solution of
562 of Ordinary Differential Equations . . . 185--190
564 Communications of the ACM
587 Communications of the ACM
591 Codasyl Systems Committee Introduction to `Feature analysis of
594 N. R. Nielsen The merit of regional computing networks 319--326
599 Ugo Montanari On the optimal detection of curves in
602 R. R. Fenichel On Implementation of Label Variables . . 349--350
608 Communications of the ACM
611 Kazuaki Harada Generation of rosary permutations
613 J. D. Foley An approach to the optimum design of
618 O. G. Johnson Numerical properties of the Ritz-Trefftz
622 A. G. Fraser On the Meaning of Names in Programming
627 Communications of the ACM
631 F. M. Tonge The State of Computer-Oriented Curricula
639 nodes of a graph . . . . . . . . . . . . 468--475
643 of arithmetic expressions . . . . . . . 479--485
651 Communications of the ACM
656 Anthony C. Hearn Applications of Symbolic Manipulation in
668 of algebraic manipulative systems . . . 542--547
671 Communications of the ACM
674 Daniel Teichroew Education Related to the Use of
679 Dynamic Storage Allocation of $2^n$-word
682 blocks and cutnodes of a graph'' . . . . 592--592
690 nonlinear systems of ordinary
698 Communications of the ACM
701 Jay Earley Toward an Understanding of Data
703 ANSI Subcommittee X3J3 Clarification of Fortran Standards ---
719 Evaluation of Normalized Taylor
720 Coefficients of an Analytic Function
723 Communications of the ACM
729 P. L. Wodon The composition of semantics in Algol 68 697--708
735 K. Arimoto Automation of etching-pattern layout . . 720--730
739 Approximation of Continuous Functions by
740 a Chebyshev System of Functions . . . . 737--746
742 Communications of the ACM
746 G. T. Herman Reconstruction of Pictures from Their
749 G. S. Akin Algorithmic Selection of the Best Method
753 M. C. Harrison Implementation of the Substring Test by
762 C. R. Foulk A note on `a modification of Nordsieck's
764 Sven-\AAke A. Gustafson Rapid Computation of General
768 Jean-Claude Lassalle An extension of the Munkres algorithm
775 Sven-\AAke Gustafson ACM Algorithm 416: Rapid Computation of
776 Coefficients of Interpolation Formulas
778 Sven-\AAke Gustafson ACM Algorithm 417: Rapid Computation of
779 Weights of Interpolatory Quadrature
782 Communications of the ACM
787 J. D. Ullman Principles of optimal page replacement 80--93
789 Communications of the ACM
795 Communications of the ACM
799 G. W. Stewart Algorithm 432: The Solution of the
802 Communications of the ACM
806 phase problem of X-ray crystallography 3--6
809 P. E. Hart Use of the Hough transformation to
824 B. Einarsson ACM Algorithm 418: Calculation of
827 Communications of the ACM
841 J. F. Traub ACM Algorithm 419: Zeros of a Complex
850 Gabor T. Herman Corrigendum: ``Reconstruction of
853 Communications of the ACM
863 B. H. Liskov The Design of the Venus Operating System 144--149
865 of a supervisory computer . . . . . . . 150--156
869 A. Nico Habermann Synchronization of Communicating
872 Tad B. Pinkerton A Comparative Analysis of Disk
875 T. A. Ryan, Jr. A study of storage partitioning using a
876 mathematical model of locality . . . . . 185--190
878 Stuart C. Schwartz Properties of the working-set model . . 191--198
880 Communications of the ACM
885 H. L. Morgan On the Implementation of Security
913 Communications of the ACM
931 D. Schultz Fast finite-difference solution of
935 Richard Harter The Optimality of Winograd's Formula . . 352--352
939 R. E. Knop ACM Algorithm 425: Generation of Random
946 R. L. Ashenhurst A report of the ACM curriculum committee
952 Communications of the ACM
957 T. A. Rourke On the optimization of performance of
966 computation of linear precedence
971 Volterra integral equations of the
974 K. S. Kolbig Certification of algorithm 363 (complex
977 eigenvectors of a real general matrix) 466--466
984 B. Einarsson Remark on algorithm 418 (Calculation of
998 Communications of the ACM
1008 Michael A. Arbib Toward an Automata Theory of Brains . . 521--527
1010 Jean Vuillemin Fixpoint Approach to the Theory of
1017 Joel Moses Toward a General Theory of Special
1019 C. C. Foster A view of computer architecture . . . . 557--565
1024 S. R. Kimbleton The role of computer system models in
1030 L. D. Fosdick The production of better mathematical
1034 Charles W. Bachman The Evolution of Storage Structures . . 628--634
1035 J. R. Rice On the present and future of scientific
1037 Robert I. Benjamin A generational perspective of
1047 Konrad Zuse The ``Plankalkul'' of Konrad Zuse: a
1048 forerunner of today's programming
1050 Richard E. Sprague A Western View of Computer History . . . 686--692
1051 Franz L. Alt Archaeology of computers ---
1056 Communications of the ACM
1059 John G. Herriot In memory of George E. Forsythe . . . . 719--720
1060 Donald E. Knuth George Forsythe and the development of
1063 Collection of articles in honor of
1076 G. S. Shedler A Model of Memory Contention in a Paging
1080 W. L. van der Poel Comment on the composition of semantics
1085 K. Harada A note on the generation of rosary
1088 W. Squire ACM Algorithm 429: Localization of the
1089 Roots of a Polynomial . . . . . . . . . 776--777
1094 Communications of the ACM
1098 W. H. Kautz Cellular Arrays for the Solution of
1103 T. Lamdan A New Approach to Automatic Scanning of
1111 G. W. Stewart ACM Algorithm 432: Solution of the
1116 J. Gregory A Comparison of Floating Point Summation
1118 Hatem M. Khalil The eigenproblem of block tridiagonal
1128 Communications of the ACM
1132 James B. Morris Demand Paging Through Utilization of
1137 Richard J. Hanson Integral Equations of Immunology . . . . 883--890
1141 Gert Dathe Conversion of Decision Tables by Rule
1151 Communications of the ACM
1154 Phyllis Fox Comparative Study of Computer Programs
1156 Michael A. Malcolm Algorithms to Reveal Properties of
1159 Approximating All Zeros of a Polynomial
1165 M. Verhelst Conversion of Limited-Entry Decision
1189 Communications of the ACM
1203 N. L. Slezak A comparison of multivariate normal
1206 Prentiss Robinson New Method for the Solution of the
1210 P. J. Brown Levels of Language for Portable Software 1059--1062
1213 J. C. Browne Trace-Driven Modeling and Analysis of
1224 Communications of the ACM
1228 Stuart C. Schwartz Corrigendum: ``Properties of the
1231 Communications of the ACM
1234 G. S. Shedler A Queuing Model of a Multiprogrammed
1236 Carter Bays The Reallocation of Hash-Coded Tables 11--14
1239 David J. Kuck On the Time Required for a Sequence of
1242 D. P. Partridge Adaptive Correction of Program
1245 C. R. Crawford Reduction of a Band-Symmetric
1248 L. Fein The practical aspect of computer science
1262 Communications of the ACM
1265 R. D. Merrill Representation of Contours and Regions
1269 L. Lichten The Use of Grammatical Inference for
1271 J. F. Gimpel A Theory of Discrete Patterns and Their
1274 of Analytic Functions . . . . . . . . . 101--104
1275 Richard P. Brent Reducing the Retrieval Time of Scatter
1280 R. M. Balzer An overview of the ISPL computer system
1284 W. P. Crowley ACM Algorithm 443: Solution of the
1287 Communications of the ACM
1299 Charles D. Pack The Effects of Multiplexing on a
1302 Thomas R. Wilcox Design and Implementation of Diagnostic
1318 Communications of the ACM
1323 L. E. Lyon Implementation of a High Level Language
1327 W. J. Cody A Statistical Study of the Accuracy of
1337 evaluation of a working set dispatcher 247--253
1339 the Manipulation of Chebyshev Series . . 254--256
1341 D. I. Good Greatest common divisor of $n$ integers
1344 Communications of the ACM
1347 David Pager On the Problem of Communicating Complex
1352 R. G. Johnson Some Comments on the Use of Ambiguous
1359 Y. M. Lee Minimal Event-Node Network of Project
1370 J. A. Howell Exact solution of linear equations using
1373 R. E. Wheeler Increasing the efficiency of quicksort 311--311
1380 R. G. Estell A comment on the practical aspects of
1388 Communications of the ACM
1400 Samuel F. Fuller On the Near-Optimality of the
1410 H. Strunz The development of decision tables via
1411 parsing of complex decision situations 366--369
1417 D. F. Swinehart ACM Algorithm 448: Number of
1425 Judith Yuni Kirk Computer Photocomposition of Technical
1428 Communications of the ACM
1438 Erol Gelenbe Distribution of a Program in Primary and
1452 F. Fiala ACM Algorithm 449: Solution of Linear
1458 P. J. Nikolai DIFSUB for solution of ordinary
1461 Communications of the ACM
1475 Combinations of $m$ Out of $n$ Objects 485--485
1489 E. J. Williams Localization of the roots of a
1494 of Programs . . . . . . . . . . . . . . 491--502
1497 N. Tokura On the Capabilities of While, Repeat,
1499 Caxton C. Foster A Generalization of AVL Trees . . . . . 513--517
1501 Communications of the ACM
1509 Conversion of Decision Tables to
1511 Alfonso F. Cardenas Evaluation and Selection of File
1513 R. G. Casey Design of Tree Structures for Efficient
1524 J. M. Williams ACM Algorithm 455: Analysis of Skew
1525 Representations of the Symmetric Group 571--572
1529 of an Undirected Graph . . . . . . . . . 575--577
1531 Generation of Permutations in
1534 Generation of Permutations in
1539 E. W. LeM. Hunt Localization of the roots of a
1542 Communications of the ACM
1548 Ben Wegbreit A Model and Stack Implementation of
1550 Vincent Y. Lum General Performance Analysis of
1554 Daniel S. Hirschberg A Class of Dynamic Memory Allocation
1564 Circuits of a Graph . . . . . . . . . . 632--633
1566 James D. Sebastian ACM Algorithm 460: Calculation of
1571 Solutions to a Class of Functional
1576 SCALE2, and SCALE3 for Determination of
1579 Communications of the ACM
1583 R. S. Fabry Dynamic Verification of Operating System
1595 C. H. Reinsch ACM Algorithm 464: Eigenvalues of a Real
1611 Execution of Arithmetic Expressions . . 700--702
1620 solution of Wiener-Hopf integral
1626 Communications of the ACM
1641 Communications of the ACM
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
1655 R. Piessens ACM Algorithm 473: Computation of
1663 R. G. Johnson Comments on the algorithms of Verhelst
1664 for the conversion of limited-entry
1670 Communications of the ACM
1682 Leslie Lamport The Parallel Execution of DO Loops . . . 83--93
1685 Ben Wegbreit The Synthesis of Loop Predicates . . . . 102--112
1687 Communications of the ACM
1691 A. J. Kleinman On the Construction of a Representative
1699 Rudolf Loeser Some Performance Tests of ``Quicksort''
1707 A. Frank Ackerman Quadratic Search for Hash Tables of Size
1709 Harold S. Stone A note on a combinatorial problem of
1711 Fred T. Krogh Efficient Implementation of a Variable
1715 Communications of the ACM
1718 Jerome H. Saltzer A Simple Linear Model of Demand Paging
1721 R. K. Gupta Computation of Page Fault Probability
1723 John W. Boyse Execution Characteristics of Programs in
1727 Method for the Construction of School
1734 J. C. Larreche A study of computer use in a graduate
1735 school of business . . . . . . . . . . . 205--206
1743 P. W. Abrahams Some remarks on lookup of structured
1757 G. Ehrlich ACM Algorithm 477: Generator of
1759 B. Einarsson Solution of the transcendental equation
1762 Communications of the ACM
1765 Mary Shaw Reduction of Compilation Costs Through
1767 Ben Wegbreit The treatment of data types in EL1 . . . 251--264
1770 Nai Kuan Tsao On the Distributions of Significant
1777 Properties of Floating Point Arithmetic
1783 Communications of the ACM
1793 James F. Gimpel The minimization of
1796 F. D. K. Roberts ACM Algorithm 478: Solution of an
1797 Overdetermined System of Equations in
1802 R. Piessens Calculation of Fourier integrals . . . . 324--324
1805 R. L. Page Generation of random correlated normal
1809 W. D. Slysz An evaluation of software in the social
1812 John Gary Compact Representation of Contour Plots
1820 F. Pollack HYDRA: The Kernel of a Multiprocessor
1827 Edward Minieka On Computing Sets of Shortest Paths in a
1830 Communications of the ACM
1841 Jerome H. Saltzer Protection and the Control of
1848 Communications of the ACM
1852 Storage of Data . . . . . . . . . . . . 434--436
1863 Existence of Solutions to the Timetable
1865 Leslie Lamport A New Solution of Dijkstra's Concurrent
1867 John C. Cavouras On the Conversion of Programs to
1885 Communications of the ACM
1894 Mario Schkolnick The Equivalence of Reducing Transition
1899 K. H. Burrell ACM Algorithm 484: Evaluation of the
1903 L. L. Schumaker ACM Algorithm 485: Computation of
1911 Communications of the ACM
1920 I. L. Traiger A note on the calculation of average
1933 A. S. Walters On Generation of Test Problems for
1936 of Laplace Transform . . . . . . . . . . 587--589 (or 587--588??)
1943 Fred T. Krogh Errata: ``Efficient Implementation of a
1949 Communications of the ACM
1962 E. W. Dijkstra Self-stabilizing Systems in Spite of
1974 Communications of the ACM
1979 Construction of a Community Information
1981 J. C. Strauss An analytic model of the Hasp execution
1985 J. R. Dickson A Comparison of List Schedules for
1987 N. D. Wallace Computer Generation of Gamma Random
1991 R. V. Oakford A Graph Formulation of a School
1995 of Systems of Ordinary Differential
1998 Distribution of the Kolmogorov-Smirnov
2005 Communications of the ACM
2008 D. Mitra Some Aspects of Hierarchical Memory
2011 Communications of the ACM
2021 Communications of the ACM
2028 J. H. Wilkinson On the Stability of Gauss-Jordan
2031 A. van der Sluis Perturbations of Eigenvalues of
2034 Herbert Robinson Elementary Divisors of Tensor Products 36--39
2036 Harlan D. Mills The New Math of Computer Programming . . 43--48
2038 Irving T. Ho Storage-Efficient Representation of
2041 Stability Properties of Linear Multistep
2044 Deviation of Data . . . . . . . . . . . 57--58
2046 Communications of the ACM
2052 E. G. Coffman, Jr. Analysis of Interleaved Memory Systems
2061 Jack Sklansky Finding Circles by an Array of
2064 Communications of the ACM
2081 -- for Finding the $i$th Smallest of $n$
2084 W. F. Tinney On Computing Certain Elements of the
2085 Inverse of a Sparse Matrix . . . . . . . 177--179
2087 A. van der Sluis Corrigendum: ``Perturbations of
2088 eigenvalues of non-normal matrices'' . . 180
2092 Communications of the ACM
2100 Function of a Real Argument . . . . . . 200--202
2104 Graham Smith On Maintenance of the Opportunity List
2106 I. C. Braid The Synthesis of Solids Bounded by Many
2110 Henry S. Warren, Jr. A Modification of Warshall's Algorithm
2111 for the Transitive Closure of Binary
2116 Pierre Duval A Comparison of Simulation Event List
2123 Communications of the ACM
2128 Alfonso F. Cardenas Analysis and Performance of Inverted
2131 of English . . . . . . . . . . . . . . . 264--274
2135 M. Hatzopoulos A note on the LU factorization of a
2138 A. I. Wasserman A problem-list of public policy issues
2140 Harlan D. Mills Corrigendum: ``The New Math of Computer
2150 Communications of the ACM
2153 N. E. Gibbs ACM Algorithm 492: Generation of All the
2154 Cycles of a Graph from a Set of Basic
2184 Charles T. Zahn, Jr. Ill-Chosen Use of ``Event'' . . . . . . 360--360
2186 Communications of the ACM
2194 Grammars of Natural Language . . . . . . 390--400
2196 D. P. Siewiorek Use of the Concept of Transparency in
2197 the Design of Hierarchically Structured
2204 B. Gilchrist Discrimination in the employment of
2207 Communications of the ACM
2215 J. D. Ullman Deterministic Parsing of Ambiguous
2218 Formal Derivation of Programs . . . . . 453--457
2220 standard deviation of data . . . . . . . 458--458
2227 P. Duval Corrigendum: ``A comparison of
2231 Sakti P. Ghosh Consecutive Storage of Relevant Records
2238 Communications of the ACM
2245 R. Mark Claudson Digital Simulation of River Plankton
2247 William F. Piepmeier Optimal Balancing of I/O Requests to
2251 Communications of the ACM
2254 Rob Gerritsen A Preliminary System for the Design of
2261 Philip Yen-Tang Chang Optimizing the Performance of a
2264 D. D. Chamberlin Implementation of a Structured English
2268 H. Kobayashi Horner's Rule for the Evaluation of
2271 Communications of the ACM
2284 Michael Marcotty A genealogy of control structures . . . 629--639
2291 to the Compaction of Character Sets . . 656--657
2293 Communications of the ACM
2303 of the Circularity Problem for Attribute
2307 Jeffrey D. Ullman On the Complexity of LR(k) Testing . . . 707--716
2311 Richard J. Lipton Reduction: A Method of Proving
2312 Properties of Parallel Programs . . . . 717--721
2314 Language of Very High Level . . . . . . 722--728
2316 Communications of the ACM
2321 Holger Opderbeck A Study of Line Overhead in the ARPANET 3--13
2323 Comparison of FCFS and SSTF Seek
2330 E. B. Kaehler Performance of Height-Balanced Trees . . 23--28
2333 Gordon B. Davis Study of Errors, Error-Proneness, and
2336 Communications of the ACM
2346 Alberto Martelli Application of Heuristic Search Methods
2351 Ronald Fagin A Counterintuitive Example of Computer
2358 Communications of the ACM
2369 Naftaly Minski Intentional Resolution of Privacy
2371 M. Naftaly Intentional resolution of privacy
2374 Communications of the ACM
2377 O. R. Smoot Development of an international system
2378 for legal protection of computer
2380 Bennet P. Lientz A comparative evaluation of versions of
2384 Example of Computer Paging'' . . . . . . 187
2386 Zohar Manna Logical Analysis of Programs . . . . . . 188--206
2388 Communications of the ACM
2391 Dorothy E. Denning A Lattice Model of Secure Information
2400 of Operating Systems . . . . . . . . . . 266--272
2403 David Gries Verifying Properties of Parallel
2406 Alan P. Batson Characteristics of Program Localities 285--294
2411 Holger Opderbeck Analysis of the PFF Replacement
2414 Communications of the ACM
2418 S. D. Conte Production and employment of Ph.D.'s in
2427 Harry J. Saal Process for the Determination of
2437 Gary D. Knott A Numbering System for Permutations of
2440 Communications of the ACM
2444 M. H. Halstead Technology of Computer Center
2449 Robert M. Keller Formal Verification of Parallel Programs 371--384
2455 Jonas Rabin Synthesis of Decision Rules . . . . . . 404--406
2463 Communications of the ACM
2468 R. D. Tennent The Denotational Semantics of
2477 Communications of the ACM
2481 Holger Opderbeck Corrigendum: ``Analysis of the PFF
2486 Philip L. Wadler Analysis of an Algorithm for Real Time
2494 Edward M. Reingold Efficient Generation of the Binary
2501 Communications of the ACM
2510 Pictures of Solid Objects Composed of
2516 James W. Frane The BMD and BMDP Series of Statistical
2521 computation of linear precedence
2524 Sandra A. Mamrak Status of Women and Minorities in
2527 Communications of the ACM
2536 Michael H. Tindall Design and Implementation of a Table
2543 I. L. Traiger The notions of consistency and predicate
2546 S. E. Smith Optimal Reorganization of Distributed
2551 Communications of the ACM
2554 Jean E. Sammet Roster of Programming Languages for
2561 Carl Singer Computer-Aided Analysis and Design of
2565 M. C. Kyle Structural Pattern Recognition of
2569 Communications of the ACM
2576 Gerald L. Engel A Survey of the Literature in Computer
2580 Frederick R. Carlson, Jr. Detection of Combined Occurrences . . . 31--36 (or 31--35??)
2586 Communications of the ACM
2592 C. Cordell Green An Empirical Study of List Structure in
2595 S. J. Hong Convex Hulls of Finite Sets of Points in
2600 Digital Display of Circular Arcs . . . . 100--106
2602 David I. Steinberg Occurrences of Cycling and Other
2603 Phenomena Arising in a Class of Linear
2607 Communications of the ACM
2615 Amund Lunde Empirical Evaluation of Some Features of
2620 Warren Burton Representation of Many-Sided Polygons
2625 Richard L. Nolan Effects of Chargeout on User/Manager
2628 Philip Ein-Dor Cost/utilization: A measure of system
2630 C. Bays A comparison of next-fit, first-fit, and
2635 Communications of the ACM
2641 Theodosios Pavlidis Editing of Picture Segmentations Using
2642 Local Analysis of Graphs . . . . . . . . 223--229
2644 Game of Poker . . . . . . . . . . . . . 230--245
2646 S. E. Smith Analysis of Design Alternatives for
2664 Communications of the ACM
2678 B. Schwab A Comparison of Tree-Balancing
2681 P. Bruce Berra A Comparison of Hardware and Software
2682 Associative Memories in the Context of
2684 Marvin Shapiro Choice of Reference Points in Best-Match
2686 Michael Z. Hanani An Optimal Evaluation of Boolean
2688 Y. Milman An Approach to Optimal Design of Storage
2694 Communications of the ACM
2698 S. D. Conte Production and Employment of Ph.D.'s in
2703 Peter Heller Experimental Investigations of the
2704 Utility of Detailed Flowcharts in
2707 R. W. Taylor Two Views of Data Abstraction . . . . . 382--384
2712 of Data Structures . . . . . . . . . . . 396--404
2727 Communications of the ACM
2734 William D. Tajibnapis A Correctness Proof of a Topology
2745 Peter J. Denning Certification of Programs for Secure
2752 J. Nevil Brownlee An Algol-based implementation of SNOBOL
2755 Communications of the ACM
2770 Niklaus Wirth Toward a Discipline of Real-Time
2772 J. D. Gannon An experimental evaluation of data type
2779 N. Francez Another advantage of keyword notation
2783 Communications of the ACM
2786 Michael O. Rabin Complexity of Computations . . . . . . . 625--633
2790 Robert W. Scheifler An Analysis of Inline Substitution for a
2792 David K. Gifford Hardware Estimation of a Process'
2795 of Prime Numbers . . . . . . . . . . . . 664--669
2796 Edward M. McCreight Pagination of B*-Trees with
2799 Communications of the ACM
2817 R. Devillers Game Interpretation of the Deadlock
2826 Communications of the ACM
2832 Bill Strecker Use of the LRU Stack Depth Distribution
2833 for Simulation of Paging Behavior . . . 795--798
2837 John E. Shore Anomalous Behavior of the Fifty-Percent
2840 A. K. Agrawala Equivalence of Hough curve detection to
2843 diversity of notation for syntactic
2858 Ken Kennedy An Algorithm for Reduction of Operator
2861 of Recursion . . . . . . . . . . . . . . 856--863
2872 Communications of the ACM
2877 R. Tardiff A survey of computer science offerings
2881 J. Lawrence Carter A Case Study of a New Code Generation
2894 Communications of the ACM
2902 P. C. Capon The development of the MU5 computer
2906 P. A. Hartley Evolution of the Sperry Univac 1100
2912 R. Hill The Evolution of the DECsystem 10 . . . 44--63
2915 Andris Padegs Architecture of the IBM System/370 . . . 73--96
2917 Communications of the ACM
2922 status of minorities and women . . . . . 115--119
2936 William J. Stewart A Comparison of Numerical Techniques in
2947 Azriel Rosenfeld Some New Methods of Detecting Step Edges
2950 Communications of the ACM
2953 Michael O. Rabin Corrigendum: ``Complexity of
2955 Henry C. Lucas, Jr. Use of an Interactive Information
2959 Kenneth L. Kraemer Management Utilization of Computers in
2961 R. E. Anderson Value orientation of computer science
2972 Andrew S. Tanenbaum Implications of Structured Programming
2975 Communications of the ACM
2979 K. L. McMillen Orderly Enumeration of Nonsingular
2984 Art Lew Optimal Conversion of Extended-Entry
2996 M. Rodeh Economical Encoding of Commas Between
3001 Communications of the ACM
3014 David B. Loveman III Incorporation of Units into Programming
3025 Pandu R. Tadikamalla Computer Generation of Gamma Random
3030 Communications of the ACM
3040 Martin S. Roth Analyses of Deterministic Parsing
3046 G. E. Tompkins Characteristics of Application Software
3048 Earl Chrysler Some Basic Determinants of Computer
3052 Economy of Computing . . . . . . . . . . 484--493
3054 D. Derochette Performance of Rollback Recovery Systems
3059 Communications of the ACM
3065 Bruce Weide On the complexity of computing the
3066 measure of $\bigcup[a_i,b_i]$ . . . . . 540--544
3068 Near-Optimal Computation Order of Matrix
3076 Leslie Lamport Time, Clocks, and the Ordering of Events
3079 Hanan Samet Proving the Correctness of Heuristically
3084 Udo W. Pooch Analysis of the Availability of Computer
3088 Communications of the ACM
3093 and its Algebra of Programs . . . . . . 613--641
3111 Communications of the ACM
3116 for the Bel-Petrov classification of
3118 H. D. Schwetman Hybrid Simulation Models of Computer
3123 David A. Farber Model for Verification of Data Security
3134 Simulations Requiring Large Numbers of
3137 Stephen A. Ward Real Time Plotting of Approximate
3139 A. Tenenbaum Simulations of dynamic sequential search
3142 Communications of the ACM
3156 Robert Morris Counting Large Numbers of Events in
3158 Colin L. McMaster An Analysis of Algorithms for the Dutch
3165 Kurt Maly A comparison of heaps and the TL
3168 Communications of the ACM
3176 E. S. Davidson Performance Evaluation of Highly
3182 P. R. Tadikamalla Computer Generation of Gamma Random
3204 Communications of the ACM
3211 Large Networks of Computers . . . . . . 993--999
3217 John H. Howard The Selection of Optimal Tab Settings 1004--1007
3223 V. Rajaraman Detection of Logical Errors in Decision
3229 Robert M. Metcalfe Reverse Path Forwarding of Broadcast
3237 Lawrence Robinson An Example of Hierarchical Design and
3240 Communications of the ACM
3245 Communications of the ACM
3250 Kent W. Colton The impact and use of computer
3253 Fabrizio Luccio Permutation of Data Blocks in a Bubble
3256 K. Mani Chandy The Impact of Distributions and
3265 Communications of the ACM
3269 S. D. Conte Production and employment of Ph.D.s in
3271 R. E. Fairley Employment characteristics of doctoral
3276 C. Renvoise Global Optimization by Suppression of
3295 Communications of the ACM
3304 Science --- A Report of the ACM
3313 Dalia Motzkin Use of Normal Multiplication Tables for
3315 C. L. McMaster Corrigendum: ``An Analysis of Algorithms
3318 Communications of the ACM
3321 Arthur M. Lesk Detection of Three-Dimensional Patterns
3322 of Atoms in Chemical Structures . . . . 219--224
3325 J. L. McKenney Price/Performance Patterns of U.S.
3328 Donald N. Streeter Methodology for the Design of
3335 Daniel Brelaz New Methods to Color the Vertices of a
3338 Communications of the ACM
3343 Alan J. Perlis Social Processes and Proofs of Theorems
3348 Configurations of Processors . . . . . . 281--283
3352 Michael J. Manthey Model for and Discussion of
3355 Communications of the ACM
3358 R. S. Lemos An implementation of structured
3371 H. Freeman The Cyclic Order Property of Vertices as
3374 Communications of the ACM
3386 S. Tsur The Control of Response Times in
3390 Communications of the ACM
3396 queueing network models of computer
3398 R. W. Floyd The paradigms of programming . . . . . . 455--460
3411 Communications of the ACM
3424 of the Boyer-Moore String Matching
3433 S. G. Wagle Approximation of Polygonal Maps by
3440 Communications of the ACM
3443 P. D. Laird Comment on: ``An optimal evaluation of
3448 Anthony Hoffman A note on: ``An optimal evaluation of
3456 Leslie Lamport On the Proof of Correctness of a
3462 F. L. Morris On a Comparison of Garbage Collection
3465 Communications of the ACM
3468 R. E. Mayer A psychology of learning BASIC . . . . . 589--593
3478 Communications of the ACM
3481 A. H. Lipis Costs of the current US payments system 644--647
3483 D. B. Parker Vulnerabilities of EFTs to intentionally
3487 anatomy of a research agenda . . . . . . 660--671
3489 J. A. Hupp Measured Performance of an ETHERNET
3492 Communications of the ACM
3497 Communications of the ACM
3500 Peter K. Pearson Fast Hashing of Variable-Length Text
3503 Communications of the ACM
3508 Communications of the ACM
3511 I. Dittmer Note on Fast Hashing of Variable Length
3513 Jacques Savoy Note on Fast Hashing of Variable Length
3515 James Litsios Note on Fast Hashing of Variable Length
3517 Peter Pearson Note on Fast Hashing of Variable Length
3526 Journal of the ACM
3539 SIAM Journal of Computing
3550 K.-C. Tai The practicality of text signatures for
3557 Functions of the First Kind [S17]'' . . 282--284
3581 Cumulative Distribution of the
3585 Dilogarithm Function of a Real Argument
3605 Smallest of $n$ Elements [M1]'' . . . . 301--304
3611 of Two Blocks of Data [K2]'' . . . . . . 392--393
3616 Inversion of Laplace Transform [D5]'' 395--396
3622 David W. Twigg Algorithm 513: Analysis of In-Situ
3625 Inversion of Laplace Transform'' . . . . 111--111
3674 Burton L. Leathers Remark on ``Algorithm 513: Analysis of