Communications of the ACM (CACM), Volume 13, 1970

Volume 13, Number 1, January 1970

• Bernard A. Galler:
  ACM President's Letter. 1
  
• Thomas C. Lowe:
  Automatic segmentation of cyclic program structures based on connectivity and processor timing. 3-6
  
• Walter Gautschi, Bruce J. Klein:
  Recursive computation of certain derivatives&a study of error propagation. 7-9
  
• Alvin P. Mullery, Graham C. Driscoll:
  A processor allocation method for time-sharing. 10-14
  
• Robert F. Simmons:
  Natural language question-answering systems: 1969. 15-30
  
• Edgar T. Irons:
  Experience with an extensible language. 31-40
  
• Ugo Montanari:
  A Note on Minimal Length Polygongal Approximation to a Digitized Contour. 41-47
  
• Harald Stehfest:
  Algorithm 368: Numerical inversion of Laplace transforms [D5]. 47-49
  
• Henry E. Schaffer:
  Algorithm 369: Generator of random numbers satisfying the Poisson distribution [G5]. 49
  
• Edgar L. Butler:
  General random number generator [G5]. 49-52
  
• J. K. S. McKay:
  Algorithm 371: Partitions in natural order [A1]. 52
  
• K. B. Dunham:
  Algorithm 372: An algorithm to produce complex primes, CSIEVE [A1]. 52-53
  
• Walter Gautschi, Bruce J. Klein:
  Remark on algorithm 282 [S22] derivatives of ex/x, cos(x)/x, and sin (x)/x. 53-54
  
• Robin Griffin, K. A. Redish:
  Remark on algorithm 347 [M1]: an efficient algorithm for sorting with minimal storage. 54
  
• M. Stuart Lynn:
  Representation for calendar date for machine-to-machine data interchange. 55
  
• M. Stuart Lynn:
  Interchange rolls of perforated tape for information interchange. 56
  
• W. H. Payne:
  Fortran Tausworthe pseudorandom number generator. 57
  

Volume 13, Number 2, February 1970

• Walter M. Carlson:
  ACM Vice-President Carlson Asks: what are your standards? 65-66
  
• David Hsiao, Frank Harary:
  A formal system for information retrieval from files. 67-73
  
• Ernst von Glasersfeld, Pier Paolo Pisani:
  The multistore parser for hierarchical syntactic structures. 74-82
  
• Steven Vere:
  Translation equations. 83-89
  
• Howard L. Morgan:
  Spelling correction in systems programs. 90-94
  
• Jay Earley:
  An Efficient Context-Free Parsing Algorithm. 94-102
  
• Charles E. Radke:
  The use of quadratic residue research. 103-105
  
• Bush Jones:
  A variation on sorting by address calculation. 105-107
  
• James R. Bell:
  The Quadratic Quotient Method: a Hash Code Eliminating Secondary Clustering. 107-109
  
• David N. Ness, Robert S. Green, William A. Martin:
  Computer education in a graduate school of management. 110-114
  
• M. F. Robbins, J. D. Beyer:
  An interactive computer system using graphical flowchart input. 115-119
  
• John S. White:
  Algorithm 374: Restricted partition generator [A1]. 120
  
• Helmuth Späth:
  Algorithm 375: Fitting data to one exponential [E2]. 120
  
• John S. White:
  Algorithm 373: Number of doubly restricted partitions [A1]. 120
  
• Helmuth Späth:
  Algorithm 376: Least squares fit by f(x) = A cos(Bx+C [E2]. 121-122
  
• H. D. Knoble:
  Certification of algorithm 343 [F1]: eigenvalues and eigenvectors of a real general matrix. 122-124
  
• Ian Barrodale:
  Certification of algorithm 127 [F5]: Ortho. 122
  
• G. W. Hill, Mary Loughhead:
  Remark on Algorithm: Algorithm 321 [S14] t-test probabilities and Algorithm 344: students t-distribution. 124
  

Volume 13, Number 3, March 1970

• Robert R. Fenichel, Joseph Weizenbaum, Jerome C. Yochelson:
  A program to teach programming. 141-146
  
• James R. Slagle, John K. Dixon:
  Experiments with the M & N tree-searching program. 147-154
  
• Alan P. Batson, Shy-Ming Ju, David C. Wood:
  Measurements of segment size. 155-159
  
• G. A. Watson:
  On an algorithm for nonlinear minimax approximation. 160-162
  
• D. G. Schweikert:
  A comparison of error improvement estimates for adaptive trapezoid integration. 163-166
  
• Robert M. Schwarcz, John F. Burger, Robert F. Simmons:
  A deductive question-answerer for natural language inference. 167-183
  
• Alfonso F. Cardenas, Walter J. Karplus:
  PDEL - a language for partial differential equations. 184-191
  
• Michael J. Levine, Stanley M. Swanson:
  Algorithms 377: Symbolic expansion of algebraic expressions [R2]. 191-192
  
• Donald G. Rapp, Larry D. Scott:
  Certification of algorithm 310 [A1]: prime number generator. 192
  
• T. A. Bray, Christoph Witzgall:
  Remark on algorithm 336 [H]: Netflow. 192
  
• David Pager:
  A number system for the permutations. 193
  
• M. V. Kailas:
  Another method of converting from hexadecimal to decimal. 193
  
• Herman A. Maurer:
  A note on the complement of inherently ambiguous context-free languages. 194
  

Volume 13, Number 4, April 1970

• Bernard A. Galler:
  ACM President's letter: Is all the world the stage? 203
  
• A. J. DeSalvio, J. Garry Purdy, J. Rau:
  Creation and control of internal data bases under a Fortran programming environment. 211-215
  
• Harlan D. Mills:
  Syntax-directed documentation for PL360. 216-222
  
• Rudolf Bayer, Christoph Witzgall:
  Some complete calculi for matrices. 223-237
  
• Per Brinch Hansen:
  The nucleus of a multiprogramming system. 238-241
  
• Charles M. Eastman:
  Representations for space planning. 242-250
  
• John Pomeranz, Roman L. Weil:
  The cyclical majority problem. 251-254
  
• E. N. Nilson:
  Cubic splines on uniform meshes. 255-258
  
• W. Pankiewicz:
  Algorithm 378: discretized Newton-like method for solving a system of simultaneous nonlinear equations [C5]. 259-260
  
• J. N. Lyness:
  Algorithm 379: Squank (Simpson Quadrature used adaptivity - noise killed) [D1]. 260-262
  
• N. D. Cook:
  Remark on algorithm 351 [D1]: modified Romberg quadrature. 263
  
• Bo Einarsson:
  Remark on algorithm 353 [D1]: Filon quadrature. 263
  
• M. M. Guignard:
  Remark on algorithm 341 [H]: solution of linear programs in 0-1 variables by implicit enumeration. 263
  
• William F. Heess Jr.:
  Comments on a paper by Wallace and Mason. 264-265
  
• Ronald C. de Vries:
  Comment on Lawler's multilevel Boolean minimization. 265-266
  
• J. L. Smith:
  Comment on multiprogramming under a page on demand strategy. 265
  

Volume 13, Number 5, May 1970

• Bernard A. Galler:
  ACM President's Letter: Reflections. 277
  
• Louis Hodes:
  A programming system for the on-line analysis of biomedical images. 279-283
  
• Gary A. Sitton:
  Operations on generalized arrays with the genie compiler. 284-286
  
• W. Earl Sasser, Donald S. Burdick, Daniel A. Graham, Thomas H. Naylor:
  The application of sequential sampling to simulation: an example inventory model. 287-296
  
• Jacques Loeck:
  An algorithm for the construction of bounded-context parsers. 297-307
  
• John C. Reynolds:
  GEDANKEN - a simple typeless language based on the principle of completeness and the reference concept. 308-319
  
• Stefano Crespi-Reghizzi, Rosamaria Morpurgo:
  A language for treating graphs. 319-323
  
• Susan Laflin, M. A. Brebner:
  Algorithm 380: in-situ transposition of a rectangular matrix [F1]. 324-326
  
• Les G. Proll:
  Certification of algorithm 263A [H]. 326-327
  
• Robert E. Knop:
  Algorithm 381: random vectors uniform in solid angle. 326
  
• Ralph Lachenmaier:
  Remark on algorithm 380: subroutine to perform in-situ transposition of a rectangular matrix. 327
  

Volume 13, Number 6, June 1970

• Howard A. Elder:
  On the feasibility of voice input to an on-line computer processing system. 339-346
  
• C. R. Muthukrishnan, V. Rajaraman:
  On the conversion of decision tables to computer programs. 347-351
  
• Joseph E. Grimes:
  Scheduling to reduce conflict in meetings. 351-352
  
• Donald G. Frantz:
  A PL/1 program to assist the comparative linguist. 353-356
  
• Fred Damerau:
  Automatic parsing for content analysis. 356-360
  
• Peter Linz:
  Accurate floating-point summation. 361-362
  
• Kenneth E. Hillstrom:
  Comparison of several adaptive Newton-Cotes quadrature routines in evaluating definite integrals with peaked integrands. 362-365
  
• G. W. Stewart:
  Incorporating origin shifts into the QR algorithm for symmetric tridiagonal matrices. 365-367
  
• Phillip J. Chase:
  Algorithm 382: combinations of M out of N objects [G6]. 368
  
• Phillip J. Chase:
  Algorithm 383: permutations of a set with repetitions [G6]. 368-369
  
• G. W. Stewart:
  Algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix. 369-371
  
• Ralph L. London:
  Certification of algorithm 245 [M1]: treesort 3: proof of algorithms - a new kind of certification. 371-373
  
• J. P. Chandler, W. C. Harrison:
  Remark on algorithm 201 [M1]: shellsort. 373-374
  
• George C. Wallick:
  Remark on algorithm 351 [D1]: modified Romberg quadrature. 374-376
  
• Bruce Shriver, Patricia J. Eberlein, R. D. Dixon:
  Remark on algorithm 361 [G6]: permanent function of a square matrix I and II. 376
  
• E. F. Codd:
  A Relational Model of Data for Large Shared Data Banks. 377-387
  

Volume 13, Number 7, July 1970

• Walter M. Carlson:
  ACM president's letter: 100, 000 in 1975! 395
  
• Charles A. Grant:
  An interactive command generating facility. 403-406
  
• Mary Allen Wilkes:
  Conversational access to a 2048-word machine. 407-414
  
• William M. Waite:
  The mobile programming system: STAGE2. 415-421
  
• Burton H. Bloom:
  Space/Time Trade-offs in Hash Coding with Allowable Errors. 422-426
  
• Edward G. Coffman Jr., J. Eve:
  File structures using hashing functions. 427-432
  
• Gordon H. Bradley:
  Algorithm and bound for the greatest common divisor of n integers. 433-436
  
• William A. Woods:
  Context-sensitive parsing. 437-445
  
• Kathleen A. Paciorek:
  Algorithm 385: Exponential integral Ei(x). 446-447
  
• Gordon H. Bradley:
  Algorithm 386: Greatest common divisor of n integers and multipliers. 447-448
  
• Thomas J. Bray:
  Certification of algorithm 22: Ricatti-Bessel functions of first and second kind. 448
  
• Edward W. Ng:
  Certification of algorithm 385: Exponential integral Ei (x). 448-449
  
• Arthur H. J. Sale:
  Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t-distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of variance. 449
  
• Kirk Sattley, Robert E. Millstein:
  Comments on a paper by Lowe. 450
  
• John Pomeranz:
  Note on an anomaly in paging. 451
  
• H. D. Baecker:
  A note on data base deadlocks. 451
  
• B. R. Hunt:
  A comment on axiomatic approaches to programming. 452
  

Volume 13, Number 8, August 1970

• Walter M. Carlson:
  ACM President's Letter: ACM 70 in perspective. 463
  
• Norman R. Nielsen:
  The allocation of computer resources - is pricing the answer? 467-474
  
• George Nagy:
  Normalization techniques for handprinted numerals. 475-481
  
• A. Colin Day:
  Full table quadratic searching for scatter storage. 481-482
  
• Barbara S. Brawn, Frances G. Gustavson, Efrem S. Mankin:
  Sorting in a paging environment. 483-494
  
• Jerome H. Saltzer, John Gintell:
  The instrumentation of multics. 495-500
  
• Jean Ichbiah, Stephen P. Morse:
  A technique for generating almost optimal Floyd-Evans productions for precedence grammars. 501-508
  
• K. Fielding:
  Algorithm 387: Function mimimization and linear search. 509-510
  
• H. Hübner, H. Kremer, K. O. Linn:
  Algorithm 388: Rademacher function. 510-511
  
• H. Hübner, H. Kremer, K. O. Linn, W. Schwering:
  Algorithm 389: Binary ordered Walsh functions. 511
  
• H. Hübner, H. Kremer, K. O. Linn, W. Schwering:
  Algorithm 390: Sequencing ordered Walsh functions. 511
  
• John McKay:
  Algorithm 391: Unitary symmetric polynomials. 512
  
• Les G. Proll:
  Remark on Algorithm 233: Simpson's rule for multiple integration. 512
  
• William R. Wise Jr.:
  Algorithm 331: Gaussian quadrature formulas. 512
  

Volume 13, Number 9, September 1970

• Walter M. Carlson:
  ACM President's Letter: finding the real expert. 525
  
• W. Jack Bouknight:
  A procedure for generation of three-dimensional half-toned computer graphics presentations. 527-536
  
• Giampio Bracchi, Marco Somalvico:
  An interactive software system for computer-aided design: an application to circuit project. 537-545
  
• Ian Hirschsohn:
  AMESPLOT - a higher level data plotting software system. 546-555
  
• Cleve B. Moler, Louis Solomon:
  Integrating square roots. 556-557
  
• Gerald W. Kimble:
  A variation of the Goodman-Lance method for the solution of two-point boundary value problems. 557-558
  
• M. Wayne Wilson:
  Optimal starting approximations for generating square root for slow or no divide. 559-560
  
• Louis W. Ehrlich:
  Complex matrix inversion versus real. 561-562
  
• M. H. van Emden:
  Increasing the efficiency of quicksort. 563-567
  
• Robert R. Smith, Dennis McCall:
  Algorithms 392: Systems of hyperbolic p.d.e. 567-570
  
• S. Kamal Abdali:
  Algorithm 393: Special series summation with arbitrary precision. 570
  
• Robert B. Dial:
  Algorithm 394: Decision table translation. 571-572
  
• W. J. Cody, Kathleen A. Paciorek:
  Remark on algorithm 292: Regular Coulomb wave functions. 573
  
• Leslie Lamport:
  Comment on Bell's quadratic quotient method for hash coded searching. 573-574
  
• Zamir Bavel:
  On the number of automorphisms of a singly generated automaton. 574-575
  
• Charles B. Dunham:
  Remarks on algorithms with numerical constants. 575
  

Volume 13, Number 10, October 1970

• Walter M. Carlson:
  ACM President's letter: R for excellence: better education. 587
  
• Walter M. Carlson:
  ACM forum: announcement: ACM forum in the communications. 590
  
• William A. Woods:
  Transition network grammars for natural language analysis. 591-606
  
• Jay Earley, Howard E. Sturgis:
  A formalism for translator interactions. 607-617
  
• G. W. Hill:
  ACM Algorithm 395: Student's t-distribution. 617-619
  
• G. W. Hill:
  Algorithm 395: Students t-distribution. 617-619
  
• G. W. Hill:
  ACM Algorithm 396: Student's t-Quantiles. 619-620
  
• G. W. Hill:
  Algorithm 396: Student's t-quantiles. 619-620
  
• S. K. Chang, A. Gill:
  Algorithm 397: An integer programming problem. 620
  
• Richard A. Stone:
  Algorithm 398: Tableless date conversion. 621
  
• Jouko J. Seppänen:
  Algorithm 399: Spanning tree. 621-622
  
• George C. Wallick:
  Algorithm 400: Modified Havie integration. 622-624
  
• Bo Holmgren:
  Remark on algorithm 304: Normal curve integral. 624
  
• Richard Peto:
  Remark on algorithm 347: An efficient algorithm for sorting with minimal storage. 624
  
• Harald Stehfest:
  Remark on algorithm 368: Numerical inversion of Laplace transforms. 624
  
• Lyle B. Smith:
  The use of interactive graphics to solve numerical problems. 625-634
  

Volume 13, Number 11, November 1970

• Walter M. Carlson:
  ACM President's Letter: The fourth estate - the computer revolution. 649
  
• Paul S. LaFata, J. Ben Rosen:
  An interactive display for approximation by linear programming. 651-659
  
• Vincent Y. Lum:
  Multi-Attribute Retrieval with Combined Indexes. 660-665
  
• Charles J. Mifsud:
  A multiple-precision division algorithm. 666-668
  
• Kenneth Conrow, Ronald G. Smith:
  NEATER2: a PL/I source statement reformatter. 669-675
  
• James R. Bell, Charles H. Kaman:
  The linear quotient hash code. 675-676
  
• C. J. Cheney:
  A Nonrecursive List Compacting Algorithm. 677-678
  
• C. Kerpelman:
  Recorded magnetic tape for information interchange (1600 CPI, phase encoded). 679-685
  
• M. Stuart Lynn:
  Unrecorded magnetic tape for information interchange (9 track-200 and 800 CPI, NRZI and 1600 CPI, P.E.). 686-692
  
• Paul Bratley:
  Algorithms 401: an improved algorithm to produce complex primes. 693
  
• Maarten H. van Emden:
  Algorithms 402: Increasing the efficiency of quicksort. 693-694
  
• William Knight:
  Remark on algorithm 343: Eigenvalues and eigenvectors of a real general matrix. 694-695
  
• Paul Bratley:
  Remarks on algorithms 372: Algorithm 401: An algorithm to produce complex primes, csieve: an improved algorithm to produce complex primes. 695
  
• William J. Wilson:
  A generalized method for generating argument/function values. 696-697
  
• John R. Ehrman:
  Correction to "logical" arithmetric on computers with two's complement binary arithmetic. 697-698
  
• Arthur J. Bernstein:
  Comment on the working set model for program behavior. 698-699
  
• Jon G. Rokne:
  Condition numbers of Pei matrices. 699
  

Volume 13, Number 12, December 1970

• M. Stuart Lynn:
  ACM president's letter: "decade for dialogue". 713
  
• Walter M. Carlson:
  ACM forum. 714
  
• M. V. Mathews, F. R. Moore:
  GROOVE - a program to compose, store, and edit functions of time. 715-721
  
• James C. Tiernan:
  An efficient search algorithm to find the elementary circuits of a graph. 722-726
  
• Claude Bétourné, J. Boulenger, Jean Ferrié, Claude Kaiser, Sacha Krakowiak, Jacques Mossière:
  Process management and resource sharing in the multiaccess system in ESOPE. 727-733
  
• Howard L. Morgan:
  An interrupt based organization for management information systems. 734-739
  
• Robert J. Thompson:
  Improving round-off in Runge-Kutta computations with Gill's method. 739-740
  
• Stuart C. Shapiro:
  The list set generator: a construct for evaluating set expressions. 741-744
  
• Neville A. Black:
  Optimum merging from mass storage. 745-749
  
• Arthur H. J. Sale:
  Remark on algorithms 352: characteristic values and associated solutions of Mathieu's differential equation. 750
  
• K. A. Redish:
  Remark on algorithm 385: exponential integral. 750
  
• G. W. Stewart:
  Remark on algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix. 750
  
• E. Fuchs, P. E. Jackson:
  Estimates of distributions of random variables for certain computer communications traffic models. 752-757
  
• Charles C. Pinter:
  On decomposing a Boolean function and simplfying the components separately. 758
  
• William J. Raduchel:
  Efficient handling of binary data. 758-759
  
• Robert A. Wagner:
  Finiteness assumptions and intellectual isolation of computer scientists. 759-760
  

Last update Sat May 25 15:33:39 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page