%A Thomas C. Lowe %T Automatic segmentation of cyclic program structures based on connectivity and processor timing %J Communications of the ACM %K cacm %V 13 %N 1 %D January 1970 %P 3-6 %A Walter Gautch %A Bruce J. Klein %T Recursive computation of certain derivatives - a study of error propagation %J Communications of the ACM %K cacm %V 13 %N 1 %D January 1970 %P 7-9 %A A.I. Mullery %A G.C. Driscoll %T A processor allocation method for time-sharing %J Communications of the ACM %K cacm %V 13 %N 1 %D January 1970 %P 10-14 %A Robert F. Simmons %T Natural language question-answering systems: 1969 %J Communications of the ACM %K cacm %V 13 %N 1 %D January 1970 %P 15-30 %A Edgar T. Irons %T Experience with an extensible language %J Communications of the ACM %K cacm %V 13 %N 1 %D January 1970 %P 31-40 %A U. Montanari %T A note on minimal length polynomial approximation to a digitized contour %J Communications of the ACM %K cacm %V 13 %N 1 %D January 1970 %P 41-54 %Q ANSI X3 %T Proposed American National Standard: representation of calendar date for machine-to-machine interchange %J Communications of the ACM %K cacm %V 13 %N 1 %D January 1970 %P 55 %Q ANSI X3 %T Proposed American National Standard: interchange rolls of perforated tape for information interchange %J Communications of the ACM %K cacm %V 13 %N 1 %D January 1970 %P 56 %A W.H. Payne %T Fortran Tausworthe pseudorandom number generator (short communication) %J Communications of the ACM %K cacm %V 13 %N 1 %D January 1970 %P 57 %A David K. Hsiao %A Frank Harary %T A formal system for information retrieval from files %J Communications of the ACM %K cacm %V 13 %N 2 %D February 1970 %P 67-73 %A Ernst von\ Glaserfeld %A Pier Paolo Pisani %T A multistore parser for hierarchical syntactic structures %J Communications of the ACM %K cacm %V 13 %N 2 %D February 1970 %P 74-82 %A Steven Vere %T Translation equations %J Communications of the ACM %K cacm %V 13 %N 2 %D February 1970 %P 83-89 %A Howard L. Morgan %T Spelling correction in systems programs %J Communications of the ACM %K cacm %V 13 %N 2 %D February 1970 %P 90- %A Earley %T An efficient context-free parsing algorithm %J Communications of the ACM %K cacm %V 13 %N 2 %D February 1970 %P 94- %A Radke %T The use of quadratic residue research %J Communications of the ACM %K cacm %V 13 %N 2 %D February 1970 %P 103- %A Jones %T A variation on sorting by address calculation %J Communications of the ACM %K cacm %V 13 %N 2 %D February 1970 %P 105- %A Bell %T The quadratic quotient method: a hash code eliminating secondary clustering %J Communications of the ACM %K cacm %V 13 %N 2 %D February 1970 %P 107- %A Ness %A Green %A Martin %A Moulton %T Computer education in a graduate school of management %J Communications of the ACM %K cacm %V 13 %N 2 %D February 1970 %P 110- %A Robbins %A Beyer %T An interactive computer system using graphical flowchart input %J Communications of the ACM %K cacm %V 13 %N 2 %D February 1970 %P 115- %A Fenichel %A Weizenbaum %A Yochelson %T A program to teach programming %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 141- %A Slage %A Dixon %T Experiments with the M&N tree-searching program %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 147- %A Batson %A Ju %A Wood %T Measurements of segment size %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 155- %A Watson %T On an algorithm for nonlinear minimax approximation %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 160- %A Schewikert %T A comparison of error improvement estimates for adaptive trapezoid integration %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 163- %A Schwarcz %A Burger %A Simmons %T A deductive question-answerer for natural language inference %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 167- %A Cardenas %A Karplus %T PDEL - a language for partial differential equations %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 184- %A Pager %T A number system for the permutations (short communication) %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 193 %A Kailas %T Another method of converting from hexadecimal to decimal %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 193 %A Dempster %T Comment on a paging anomaly (short communication) %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 193 %A Maurer %T A note on the complement of inherently ambiguous context-free languages (short communication) %J Communications of the ACM %K cacm %V 13 %N 3 %D March 1970 %P 194 %A Desalvio %A Purdy %A Rau %T Creation and control of internal data base under a fortran programming environment %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 211- %A Mills %T Syntax-directed documentation for PL360 %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 216- %A Bayer %A Witzgall %T Some complete calculi for matrices %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 223- %A Per Brinch\ Hansen %T The nucleus of a multiprogramming system %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 238- %K RC 4000, message passing %A Eastman %T Representations for space planning %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 242- %A Pomeranz %A Weil,\ Jr. %T The cyclical majority problem %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 251- %A Nilson %T Cubic splines on uniform meshes %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 255- %A Heess,\ Jr. %T Comments on a paper by Wallace and Mason (short communication) %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 264- %A Smith %T Comments on multiprogramming under a page-on-demand strategy (short communication) %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 265- %A de\ Vries %T Comment on Lawler's multilevel Boolean minimization (short communication) %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 265- %A Knight %T An Algol construction for procedures as parameters of procedures (short communication) %J Communications of the ACM %K cacm %V 13 %N 4 %D April 1970 %P 266- %A Hodes %T A programming system for the on-line analysis of biomedical images %J Communications of the ACM %K cacm %V 13 %N 5 %D May 1970 %P 279-283 %A G.A. Sitton %T Operations on generalized arrays with the Genie compiler %J Communications of the ACM %K cacm %V 13 %N 5 %D May 1970 %P 284-286 %A W. Earl Sasser %A Donald S. Burdick %A Daniel A. Graham %A Thomas H. Naylor %T The application of sequential sampling to simulation: an example inventory model %J Communications of the ACM %K cacm %V 13 %N 5 %D May 1970 %P 287-296 %A Jacques Loeckx %T An algorithm for the construction of bounded-context parsers %J Communications of the ACM %K cacm %V 13 %N 5 %D May 1970 %P 297-307 %A John C. Reynolds %T Gedanken - a simple typeless language based on the principle of completeness and the reference concept %J Communications of the ACM %K cacm %V 13 %N 5 %D May 1970 %P 308-313 %A S. Crespi-Reghizzi %A R. Morpurgo %T A language for treating graphs %J Communications of the ACM %K cacm %V 13 %N 5 %D May 1970 %P 319-327 %A Howard A. Elder %T On the feasibility of voice input to an on-line computer processing system %J Communications of the ACM %K cacm %V 13 %N 6 %D June 1970 %P 339-346 %A C.R. Muthukrishnan %A V. Rajaraman %T On the conversion of decision tables to computer programs %J Communications of the ACM %K cacm %V 13 %N 6 %D June 1970 %P 347-351 %A Joseph E. Grimes %T Scheduling to reduce conflict in meetings %J Communications of the ACM %K cacm %V 13 %N 6 %D June 1970 %P 351-352 %A Donald G. Frantz %T A PL/I program to assist the comparative linguist %J Communications of the ACM %K cacm %V 13 %N 6 %D June 1970 %P 356-356 %A Peter Linz %T Accurate floating-point summation %J Communications of the ACM %K cacm %V 13 %N 6 %D June 1970 %P 361-2 %A K.E. Hillstrom %T Comparison of several adaptive Newton-Cotes quadrature routines in evaluating definite integrals with peaked integrands %J Communications of the ACM %K cacm %V 13 %N 6 %D June 1970 %P 362-365 %A G.W. Stewart %T Incorporating origin shifts into the QR algorithm for symmetric tridiagonal matrices %J Communications of the ACM %K cacm %V 13 %N 6 %D June 1970 %P 365-367 %A E.F. Codd %T A relational model of data for large shared data banks %J Communications of the ACM %K cacm %V 13 %N 6 %D June 1970 %P 377-387 %K data bank, data base, data structure, data organization, hierarchies of data, networks of data, relations, derivability, redundancy, consistency, composition, join, retrieval language, predicate calculus, security, data integrity %O reprinted in CACM 26:1, JAN 1983 %A Charles A. Grant %T An interactive command generating facility %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 403-406 %A Mary Allen Wilkes %T Conversational access to a 2048-word machine %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 407-414 %A W.M. Waite %T The mobile programming system: STAGE2 %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 415-421 %A Burton H. Bloom %T Space-time trade-offs in hash coding with allowable errors %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 422-426 %A E.G. Coffman,\ Jr. %A J. Eve %T File structures using hash functions %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 427-432 %A Gordon H. Bradley %T Algorithm and bound for the greatest common divisor of N integers %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 433-436 %A William A. Woods %T Context-sensitive parsing %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 437-445 %A Kirk Sattley %A Robert Willstein %T Comments on a paper by Lowe (short communication) %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 450-451 %A H.D. Baecker %T A note on data base deadlocks (short communication) %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 451 %A John F. Pomeranz %T A note on an anomaly in paging (short communication) %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 451 %A D.R. Hunt %T A note on axiomatic approaches to programming (short communication) %J Communications of the ACM %K cacm %V 13 %N 7 %D July 1970 %P 452 %A Norman R. Nielsen %T The allocation of computer resources - is pricing the answer ? %J Communications of the ACM %K cacm %V 13 %N 8 %D August 1970 %P 467-474 %A G. Nagy %A N. Tuong %T Normalization techniques for handprinted numerals %J Communications of the ACM %K cacm %V 13 %N 8 %D August 1970 %P 475-481 %A A. Colin Day %T Full table quadratic searching for scatter storage %J Communications of the ACM %K cacm %V 13 %N 8 %D August 1970 %P 481-482 %A Barbara S. Brawn %A Frances G. Gustavson %A Efrem S. Mankin %T Sorting in a paging environment %J Communications of the ACM %K cacm %V 13 %N 8 %D August 1970 %P 483-494 %A Jerome H. Saltzer %A John W. Gintell %T The instrumentation of Multics %J Communications of the ACM %K cacm %V 13 %N 8 %D August 1970 %P 495-500 %A J.D. Ichbiah %A S.P. Morse %T A technique for generating almost optimal Floyd-Evans productions for precedence grammars %J Communications of the ACM %K cacm %V 13 %N 8 %D August 1970 %P 501-508 %Q ANSI X3 %T Proposed American National Standard: Identification of states of the United States (including the District of Columbia) for information interchange %J Communications of the ACM %K cacm %V 13 %N 8 %D August 1970 %P 514-515 %Q ANSI X3 %T Proposed American National Standard: proposed revision of American National Standard X3.21-1967, "Rectangular holes in twelve-row punched cards" %J Communications of the ACM %K cacm %V 13 %N 8 %D August 1970 %P 515 %A W. Jack Bouknight %T A procedure for generation of three-dimensional half-toned computer graphics presentations %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 527-536 %A Giampia Bracchi %A Mario Somalvico %T An interactive software system for computer-aided design: an application to circuit project %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 537-545 %A Ian Hirschsohn %T AMESPLOT - a higher level data plotting software system %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 546-555 %A Cleve B. Moler %A Lewis P. Solomon %T Integrating square roots %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 556-557 %A G.W. Kimble %T A variation of the Goddman-Lance method for the solution of two-point boundary value problems %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 557-558 %A M. Wayne Wilson %T Optimal starting approximations for generating square root for slow or no divide %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 559-560 %A L.W. Ehrlich %T Complex matrix inversion versus real %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 561-562 %A M.H. van\ Emden %T Increasing the efficiency of quicksort %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 563-67 %A Leslie Lamport %T Comment on Bell's quadratic quotient method for hash code searching (short communication) %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 573-574 %A Zamir Bavel %T On the number of automorphisms of a singly generated automaton (short communication) %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 574-575 %A C.D. Dunham %T Remarks on algorithms with numerical constants (short communication) %J Communications of the ACM %K cacm %V 13 %N 9 %D September 1970 %P 575 %A W.A. Woods %T Transition network grammars for natural language analysis %J Communications of the ACM %K cacm %V 13 %N 10 %D October 1970 %P 591-596 %A Jay Earley %A Howard Sturgis %T A formalism for translator interactions %J Communications of the ACM %K cacm %V 13 %N 10 %D October 1970 %P 607-617 %A C.B. Smith %T The use of interactive graphics to solve numerical problems %J Communications of the ACM %K cacm %V 13 %N 10 %D October 1970 %P 625-634 %A P. LaFata %A J.B. Rosen %T An interactive display for approximation by linear programming %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 651-659 %A V.Y. Lim %T Multi-attribute retrieval with combined indexes %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 660-665 %A Charles J. Mifsud %T A multiple-precision division algorithm %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 666-668 %A Kenneth Conrow %A Ronald G. Smith %T NEATER2: a PL/I source statement reformatter %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 669-675 %A James R. Bell %A Charles H. Kaman %T The linear quotient hash code %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 675-676 %A C.J. Cheney %T A nonrecursive list compacting algorithm %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 677-678 %Q ANSI X3 %T Proposed American National Standard: recorded magnetic tape for information interchange %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 679-685 %Q ANSI X3 %T Proposed American National Standard: unrecorded magnetic tape for information interchange %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 686-692 %A William J. Wilson %T A generalized method for generating argument/function values (short communication) %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 696-697 %A John R. Ehrman %T Correction to "logical" arithmetic on computers with two's complement binary arithmetic (short communication) %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 697-698 %A Arthur Bernstein %T Comment on the working set model for program behaviour (short communication) %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 698-699 %A Jon Rokne %T Condition numbers of PEI matrices (short communication) %J Communications of the ACM %K cacm %V 13 %N 11 %D November 1970 %P 699 %A M.V. Mathews %A F.R. Moore %T Groove: a program to compose, store and edit functions of time %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 715-721 %A James C. Tiernan %T An efficient search algorithm to find the elementary circuits of a graph %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 722-726 %A C. Betourne %A J. Boulenger %A J. Ferrie %A C. Kaiser %A S. Krakowiak %A J. Mossier %T Process management and resource sharing in the multi-access system ESOPE %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 727-733 %A Howard Lee Morgan %T An interrupt based organization for management information systems %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 734-739 %A Robert J. Thompson %T Improving round-off in Runge-Kutta computations with Gill's method %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 739-740 %A Stuart C. Shapiro %T The list set generator: a construct for evaluating set expressions %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 741-744 %A Neville A. Black %T Optimum merging from mass storage %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 745-749 %A E. Fuchs %A P.E. Jackson %T Estimates of distributions of random variables for certain computer communication traffic models (short communication) %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 752-757 %A Charles C. Pinter %T On decomposing a Boolean function and simplifying the components separately (short communication) %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 758 %A William J. Raduchel %T Efficient handling of binary data (short communication) %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 758-759 %A Robert A. Wagner %T Finiteness assumptions and intellectual isolation of computer scientists (short communication) %J Communications of the ACM %K cacm %V 13 %N 12 %D December 1970 %P 759-766 %A Carl Hammer %T Signature simulation and certain cryptographic codes %J Communications of the ACM %K cacm %V 14 %N 1 %D January 1971 %P 1-14 %A Allen Klinger %T Pattern width at a given angle %J Communications of the ACM %K cacm %V 14 %N 1 %D January 1971 %P 15-20 %A Shi-Kuo Chang %T The reconstruction of binary patterns from their projections %J Communications of the ACM %K cacm %V 14 %N 1 %D January 1971 %P 21-25 %A C. Bracchi %A D. Ferrari %T A language for treating geometric patterns in a two-dimensional space %J Communications of the ACM %K cacm %V 14 %N 1 %D January 1971 %P 26-31 %A R.A. Broucke %T Construction of rational and negative powers of a formal series %J Communications of the ACM %K cacm %V 14 %N 1 %D January 1971 %P 32-35 %A Richard C. Holt %T Comments on prevention of system deadlock %J Communications of the ACM %K cacm %V 14 %N 1 %D January 1971 %P 36-38 %A C.A.R. Hoare %T Proof of a program FIND %J Communications of the ACM %K cacm %V 14 %N 1 %D January 1971 %P 39-45 %A L.G. Proll %T Further evidence for the analysis of algorithms for the zero-one programming problem %J Communications of the ACM %K cacm %V 14 %N 1 %D January 1971 %P 46-47 %A Keith Swayder %T Conversion of limited-entry decision tables to computer programs - a proposed modification to Pollack's algorithm %J Communications of the ACM %K cacm %V 14 %N 2 %D February 1971 %P 69-73 %A A.J. Bernstein %A J.C. Sharp %T A policy-driven scheduler for a time-sharing system %J Communications of the ACM %K cacm %V 14 %N 2 %D February 1971 %P 74-78 %A Norman R. Nielsen %T An analysis of some time-sharing techniques %J Communications of the ACM %K cacm %V 14 %N 2 %D February 1971 %P 79-90 %A James R. Slagle %A Carl D. Farrell %T Experiments in automatic learning for a multipurpose heuristic program %J Communications of the ACM %K cacm %V 14 %N 2 %D February 1971 %P 91-98 %A H. Hurwitz,\ Jr. %T On the probabilistic distribution of the values of binary trees %J Communications of the ACM %K cacm %V 14 %N 2 %D February 1971 %P 99-102 %A James R. Slagle %A Richard C.T. Lee %T Application of game tree searching techniques to sequential pattern recognition %J Communications of the ACM %K cacm %V 14 %N 2 %D February 1971 %P 103-110 %A Jon Rokne %A P. Lancaster %T Complex interval arithmetic %J Communications of the ACM %K cacm %V 14 %N 2 %D February 1971 %P 111-112 %A A. Michael Noll %T Scanned-display computer graphics %J Communications of the ACM %K cacm %V 14 %N 3 %D March 1971 %P 143-150 %A Zohar Manna %A Richard P. Waldinger %T Toward automatic program synthesis %J Communications of the ACM %K cacm %V 14 %N 3 %D March 1971 %P 151-165 %A W.K. Winters %T A scheduling algorithm for a computer assisted registration system %J Communications of the ACM %K cacm %V 14 %N 3 %D March 1971 %P 166-171 %A John G. Williams %T Storage utilization in a memory hierarchy when storage assignment is performed by a hashing algorithm %J Communications of the ACM %K cacm %V 14 %N 3 %D March 1971 %P 172-175 %A C.W. Gear %T The automatic integration of ordinary differential equations %J Communications of the ACM %K cacm %V 14 %N 3 %D March 1971 %P 176-179 %A Niklaus Wirth %T Program development by stepwise refinement %J Communications of the ACM %K cacm %V 14 %N 4 %D April 1971 %P 221-227 %A V.Y. Lum %A P.S.T. Yuen %A M. Dodd %T Key-to-address transform techniques: a fundamental performance study on large existing formatted files %J Communications of the ACM %K cacm %V 14 %N 4 %D April 1971 %P 228-239 %A Allen B. Tucker %A Michael J. Flynn %T Dynamic microprogramming: processor organization and programming %J Communications of the ACM %K cacm %V 14 %N 4 %D April 1971 %P 240-250 %A Peggy Anne Talbot %A John W. Carr,\ III %A Richard R. Couler,\ Jr. %A Rosa C. Hwang %T Animator: an on-line two-dimensional film animation system %J Communications of the ACM %K cacm %V 14 %N 4 %D April 1971 %P 251-259 %A Marvin L. Stein %A William D. Munro %T On complement division %J Communications of the ACM %K cacm %V 14 %N 4 %D April 1971 %P 260-264 %Q Codasyl Systems Committee %T Introduction to feature analysis of generalized data base management systems %J Communications of the ACM %K cacm %V 14 %N 5 %D May 1971 %P 308-318 %A Norman R. Nielsen %T The merit of regional computing networks %J Communications of the ACM %K cacm %V 14 %N 5 %D May 1971 %P 319-326 %A Patrick Krolak %A Wayne Felts %A George Marble %T A man-machine approach toward solving the traveling salesman problem %J Communications of the ACM %K cacm %V 14 %N 5 %D May 1971 %P 327-334 %A Ugo Montanari %T On the optimal detection of curves in noisy pictures %J Communications of the ACM %K cacm %V 14 %N 5 %D May 1971 %P 335-345 %A Donald L. Richards %T How to keep addresses short %J Communications of the ACM %K cacm %V 14 %N 5 %D May 1971 %P 346-348 %A Robert R. Fenichel %T On implementation of label variables %J Communications of the ACM %K cacm %V 14 %N 5 %D May 1971 %P 349-350 %A James H. Morris,\ Jr. %T Another recursion induction principle %J Communications of the ACM %K cacm %V 14 %N 5 %D May 1971 %P 351-354 %A Kaziraki Harada %T Generation of rosary permutations expressed in Hamiltonian circuits %J Communications of the ACM %K cacm %V 14 %N 6 %D June 1971 %P 373-379 %A James D. Foley %T An approach to the optimum design of computer graphics systems %J Communications of the ACM %K cacm %V 14 %N 6 %D June 1971 %P 380-390 %A Saul Amarel %T Computer science: a conceptual framework for curriculum planning %J Communications of the ACM %K cacm %V 14 %N 6 %D June 1971 %P 391-401 %A W.E. Bosarge,\ Jr. %A O.G. Johnsson %T Numerical properties of the Ritz-Trefftz algorithm for optimal control %J Communications of the ACM %K cacm %V 14 %N 6 %D June 1971 %P 402-406 %A H. Tim Gladwin %T A note on compiling fixed point binary multiplications %J Communications of the ACM %K cacm %V 14 %N 6 %D June 1971 %P 407-408 %A A.G. Fraser %T On the meaning of names in programming systems %J Communications of the ACM %K cacm %V 14 %N 6 %D June 1971 %P 409-416 %A R.J. Walker %T Binary summation (short communication) %J Communications of the ACM %K cacm %V 14 %N 6 %D June 1971 %P 417 %A Marvin Zelkowitz %T Interrupt driven programming (short communication) %J Communications of the ACM %K cacm %V 14 %N 6 %D June 1971 %P 417 %A J.L. McKenney %A F.M. Tong %T The state of computer oriented curricula in business schools 1970 %J Communications of the ACM %K cacm %V 14 %N 7 %D July 1971 %P 443-448 %A Arthur J. Bernstein %T A program training project %J Communications of the ACM %K cacm %V 14 %N 7 %D July 1971 %P 449-452 %A Franklin L. DeRemer %T Simple LR(k) grammars %J Communications of the ACM %K cacm %V 14 %N 7 %D July 1971 %P 453-459 %A Terrence W. Pratt %A Daniel P. Friedman %T A language extension for graph processing and its formal semantics %J Communications of the ACM %K cacm %V 14 %N 7 %D July 1971 %P 460-467 %A Keith Paton %T An algorithm for the blocks and cutnodes of a graph %J Communications of the ACM %K cacm %V 14 %N 7 %D July 1971 %P 468-475 %A David E. Ferguson %T Buffer allocation in merge sorting %J Communications of the ACM %K cacm %V 14 %N 7 %D July 1971 %P 476-478 %A C.V. Ramamoorthy %A M.J. Gonzalez %T Subexpression ordering in the execution of arithmetic expressions %J Communications of the ACM %K cacm %V 14 %N 7 %D July 1971 %P 479-485 %A D.G. McVitie %A L.B. Wilson %T The stable marriage problem %J Communications of the ACM %K cacm %V 14 %N 7 %D July 1971 %P 486-490 %A Anthony C. Hearn %T Applications of symbol manipulation in theoretical physics %J Communications of the ACM %K cacm %V 14 %N 8 %D August 1971 %P 511-516 %A Andrew D. Hall,\ Jr. %T The Altran system for rational function manipulation - a survey %J Communications of the ACM %K cacm %V 14 %N 8 %D August 1971 %P 517-521 %A Robert R. Fenichel %T List tracing in systems allowing multiple cell types %J Communications of the ACM %K cacm %V 14 %N 8 %D August 1971 %P 522-526 %A Joel Moses %T Algebraic simplification: a guide for the perplexed %J Communications of the ACM %K cacm %V 14 %N 8 %D August 1971 %P 527-537 %A William H. Jefferys %T Automated algebraic manipulation in celestial mechanics %J Communications of the ACM %K cacm %V 14 %N 8 %D August 1971 %P 538-541 %A D. Barton %A J.P. Fitch %T General relativity and the application of algebraic manipulative systems %J Communications of the ACM %K cacm %V 14 %N 8 %D August 1971 %P 542-547 %A Joel Moses %T Symbolic integration: the stormy decade %J Communications of the ACM %K cacm %V 14 %N 8 %D August 1971 %P 548 %E Daniel Teichroew %T Education related to the use of computers in organizations %J Communications of the ACM %K cacm %V 14 %N 9 %D September 1971 %P 573-588 %A Sadabiro Osada %A Elichi Goto %A Izumi Kimura %T An efficient bit table technique for dynamic storage allocation of 2^n-word blocks %J Communications of the ACM %K cacm %V 14 %N 9 %D September 1971 %P 589-591 %A Eugene Wong %A T.C. Chiang %T Canonical structure in attribute based file organization %J Communications of the ACM %K cacm %V 14 %N 9 %D September 1971 %P 593-597 %A David L. Philips %T A note on best one-sided approximations %J Communications of the ACM %K cacm %V 14 %N 9 %D September 1971 %P 598 %A W. Liniger %T A stopping criterion for the Newton-Rhapson method in implicit multistep integration algorithms for nonlinear systems of ordinary differential equations %J Communications of the ACM %K cacm %V 14 %N 9 %D September 1971 %P 600 %A Ivan Flores %A George Madpis %T Average binary search length for dense ordered lists %J Communications of the ACM %K cacm %V 14 %N 9 %D September 1971 %P 602 %A Robert R. Fenichel %T Comment on Cheney's list-compaction algorithm %J Communications of the ACM %K cacm %V 14 %N 9 %D September 1971 %P 603 %A Jay Earley %T Toward an understanding of data structures %J Communications of the ACM %K cacm %V 14 %N 10 %D October 1971 %P 617-627 %Q ANSI Subcommittee X3J3 %T Clarification of Fortran standards - second report %J Communications of the ACM %K cacm %V 14 %N 10 %D October 1971 %P 628-642 %A A.L. Oldehoeft %A S.D. Conte %T Experiments with an automated instructional system for numerical methods %J Communications of the ACM %K cacm %V 14 %N 10 %D October 1971 %P 643-650 %A William M. Newman %T Display procedures %J Communications of the ACM %K cacm %V 14 %N 10 %D October 1971 %P 651-660 %A Alan G. Nemeth %A Paul D. Rovner %T User program measurement in a time-shared environment %J Communications of the ACM %K cacm %V 14 %N 10 %D October 1971 %P 661-666 %A P.J. Courtois %A R. Heymans %A D.L. Parnas %T Concurrent control with "readers" and "writers" %J Communications of the ACM %K cacm %V 14 %N 10 %D October 1971 %P 667-668 %A P. Branquart %A J. Lewi %A M. Sintzoff %A P.L. Wodon %T The composition of semantics in Algol 68 %J Communications of the ACM %K cacm %V 14 %N 11 %D November 1971 %P 697- %A J.W. Hamblen %T Using computers in higher education: past recommendations, status, and needs %J Communications of the ACM %K cacm %V 14 %N 11 %D November 1971 %P ? %A D.L. Shell %T Optimizing the polyphase sort %J Communications of the ACM %K cacm %V 14 %N 11 %D November 1971 %P ? %A I. Aramaki %A T. Kawabata %A K. Arimoto %T Automation of etching-pattern layout %J Communications of the ACM %K cacm %V 14 %N 11 %D November 1971 %P 720- %A M.A. Malcolm %T On accurate floating-point summation %J Communications of the ACM %K cacm %V 14 %N 11 %D November 1971 %P 731- %A Richard Gordon %A Gabor T. Herman %T Reconstruction of pictures from their projections %J Communications of the ACM %K cacm %V 14 %N 12 %D December 1971 %P 759-768 %A E.L. Amidon %A G.S. Akin %T Algorithmic selection of the best method for compressing map data structures %J Communications of the ACM %K cacm %V 14 %N 12 %D December 1971 %P 769-774 %A James K. Mullin %T Retrieval-update tradeoffs using combined indices %J Communications of the ACM %K cacm %V 14 %N 12 %D December 1971 %P 775-776 %A Malcolm G. Harrison %T Implementation of the substring test by hashing %J Communications of the ACM %K cacm %V 14 %N 12 %D December 1971 %P 777-779 %A W.S. Wulf %A D.B. Russell %A A.N. Habermann %T BLISS: a language for systems programming %J Communications of the ACM %K cacm %V 14 %N 12 %D December 1971 %P 780-790 %A Arnold Rochfeld %T New Lisp techniques for a paging environment %J Communications of the ACM %K cacm %V 14 %N 12 %D December 1971 %P 791-795 %A John W. Blomberg %A Clinton R. Foulk %T A note on a modification of Nordsieck's method using an off-step point (short communication) %J Communications of the ACM %K cacm %V 14 %N 12 %D December 1971 %P 796 %A Sven-Ake Gustafson %T Rapid computation of general interpolation formulas and mechanical quadrature rules %J Communications of the ACM %K cacm %V 14 %N 12 %D December 1971 %P 797-801 %A Francois Bourgeois %A Jean-Claude Lassalle %T An extension of the Munkres algorithm for the assignment problem to rectangular matrices %J Communications of the ACM %K cacm %V 14 %N 12 %D December 1971 %P 802-804 %A Arthur M. Lesk %T Pictorial pattern recognition and the phase problem of X-ray crystallography %J Communications of the ACM %K cacm %V 15 %N 1 %D January 1972 %P 3-6 %A S. Levialdi %T On shrinking binary picture patterns %J Communications of the ACM %K cacm %V 15 %N 1 %D January 1972 %P 7-10 %A Richard O. Duda %A Peter E. Hart %T Use of the Hough transformation to detect lines and curves in pictures %J Communications of the ACM %K cacm %V 15 %N 1 %D January 1972 %P 11-15 %A Edgar T. Irons %A Frans M. Djorp %T A CRT editing system %J Communications of the ACM %K cacm %V 15 %N 1 %D January 1972 %P 16-20 %A T.A. Dwyer %T Teacher/student authored CAI using the newbasic system %J Communications of the ACM %K cacm %V 15 %N 1 %D January 1972 %P 21-28 %A Gordon I. McCalla %A Jeffrey R. Sampson %T MUSE: a model to understand simple English %J Communications of the ACM %K cacm %V 15 %N 1 %D January 1972 %P 29-40 %A Richard I. Shrager %T Quadratic programming for nonlinear regression %J Communications of the ACM %K cacm %V 15 %N 1 %D January 1972 %P 41-45 %A Herbert E. Salzer %T On ordering +-f(+-f(+-f(... +-f(x) ...))) when f(x) is positive monotonic (short communication) %J Communications of the ACM %K cacm %V 15 %N 1 %D January 1972 %P 45-46 %A David Pager %T A proposal for a computer-based interactive scientific community %J Communications of the ACM %K cacm %V 15 %N 2 %D February 1972 %P 71-75 %A Charles M. Eastman %T Preliminary report on a system for general space planning %J Communications of the ACM %K cacm %V 15 %N 2 %D February 1972 %P 76-77 %A W.A. Martin %A D.N. Ness %T Optimizing binary trees grown with a sorting algorithm %J Communications of the ACM %K cacm %V 15 %N 2 %D February 1972 %P 88-93 %A B.E. Oldehoeft %A M.H. Halstead %T Maximum computing power and cost factors in the centralization problem %J Communications of the ACM %K cacm %V 15 %N 2 %D February 1972 %P 94-103 %A James Anderson Moorer %T Music and computer composition %J Communications of the ACM %K cacm %V 15 %N 2 %D February 1972 %P 104-113 %A Daniel G. Bobrow %A Jerry D. Burchfiel %A Daniel L. Murphy %A Raymond S. Tomlinson %T TENEX, a paged time sharing system for the PDP-10 %J Communications of the ACM %K cacm %V 15 %N 3 %D March 1972 %P 135-143 %A Barbara H. Liskov %T The design of the Venus operating system %J Communications of the ACM %K cacm %V 15 %N 3 %D March 1972 %P 144-149 %A R. Gaines Gaines %T An operating system based on the concept of a supervisory computer %J Communications of the ACM %K cacm %V 15 %N 3 %D March 1972 %P 150-156 %A Michael D. Shroeder %A Jerome H. Saltzer %T A hardware architecture for implementing protection rings %J Communications of the ACM %K cacm %V 15 %N 3 %D March 1972 %P 157-170 %A A. Nico Habermann %T Synchronization of concurrent processes %J Communications of the ACM %K cacm %V 15 %N 3 %D March 1972 %P 171-176 %A Toby J. Teorey %A Tad B. Pinkerton %T A comparative analysis of disk scheduling policies %J Communications of the ACM %K cacm %V 15 %N 3 %D March 1972 %P 177-184 %A Coffman,\ Jr. %A Thomas A. Ryan,\ Jr. %T A study of storage partitioning using a mathematical model of locality %J Communications of the ACM %K cacm %V 15 %N 3 %D March 1972 %P 185-190 %A Peter J. Denning %A Stuart C. Schwartz %T Properties of the working-set model %J Communications of the ACM %K cacm %V 15 %N 3 %D March 1972 %P 191-198 %A R.W. Conway %A W.L. Maxwell %A H.L. Morgan %T On the implementation of security measures in information systems %J Communications of the ACM %K cacm %V 15 %N 4 %D April 1972 %P 211-220 %A David C. Walden %T A system for interprocess communication in a resource sharing computer network %J Communications of the ACM %K cacm %V 15 %N 4 %D April 1972 %P 221-230 %A N.M. Herbst %A P.M. Will %T An experimental laboratory for pattern recognition and signal processing %J Communications of the ACM %K cacm %V 15 %N 4 %D April 1972 %P 231-244 %A Yukata Matsushita %T Hidden lines elimination for a rotating object %J Communications of the ACM %K cacm %V 15 %N 4 %D April 1972 %P 245-252 %A Stephen M. Chase %T An implemented graph algorithm for winning Shannon switching games %J Communications of the ACM %K cacm %V 15 %N 4 %D April 1972 %P 253-261 %A E. Horowitz %A H.L. Morgan %A A.L. Shaw %T Computers and society: a proposed course for computer scientists %J Communications of the ACM %K cacm %V 15 %N 4 %D April 1972 %P 257-261 %A Hirando Kuki %T Complex gamma function with error control %J Communications of the ACM %K cacm %V 15 %N 4 %D April 1972 %P 262-267 %A Cleve B. Moler %T Matrix computations with fortran and paging %J Communications of the ACM %K cacm %V 15 %N 4 %D April 1972 %P 268-270 %A David C. Walden %T A note on Cheney's nonrecursive list-compacting algorithm (short communication) %J Communications of the ACM %K cacm %V 15 %N 4 %D April 1972 %P 275 %A T.C. Hu %T A comment on the double-chained tree %J Communications of the ACM %K cacm %V 15 %N 4 %D April 1972 %P 276- %A James K. Mullin %T An improved index sequential access method using hashed overflow %J Communications of the ACM %K cacm %V 15 %N 5 %D May 1972 %P 301-307 %A A. Bensoussan %A C.T. Clingen %A R.C. Daley %T The Multics virtual memory: concepts and design %J Communications of the ACM %K cacm %V 15 %N 5 %D May 1972 %P 308-318 %A Ronald D. Christman %T MUX, a simple approach to on-line computing %J Communications of the ACM %K cacm %V 15 %N 5 %D May 1972 %P 319-329 %A D.L. Parnas %T A technique for software module specification with examples %J Communications of the ACM %K cacm %V 15 %N 5 %D May 1972 %P 330-336 %A W. Morven Gentleman %T Implementing Clenshaw-Curtis quadrature, I. methodology and experience %J Communications of the ACM %K cacm %V 15 %N 5 %D May 1972 %P 337-342 %A W. Morven Gentleman %T Implementing Clenshaw-Curtis quadrature, II. computing the cosine transformation %J Communications of the ACM %K cacm %V 15 %N 5 %D May 1972 %P 343-346 %A D. Greenspan %A D. Schultz %T Fast finite-difference solution of biharmonic problems %J Communications of the ACM %K cacm %V 15 %N 5 %D May 1972 %P 347-350 %A C.B. Dunham %T Minimax nonlinear approximation by approximation on subsets (short communication) %J Communications of the ACM %K cacm %V 15 %N 5 %D May 1972 %P 351 %A Richard Harter %T The optimality of Winograd's formula (short communication) %J Communications of the ACM %K cacm %V 15 %N 5 %D May 1972 %P 352 %E L.L. Ashenhurst %T Curriculum recommendations for graduate programs in information systems %J Communications of the ACM %K cacm %V 15 %N 5 %D May 1972 %P 363-398 %A J. Blatny %A S.R. Clark %A T.A. Rourke %T On the optimization of performance of time-sharing systems by simulation %J Communications of the ACM %K cacm %V 15 %N 6 %D June 1972 %P 411-420 %A Thomas R. Spacek %T A proposal to establish a pseudo virtual memory via writable overlays %J Communications of the ACM %K cacm %V 15 %N 6 %D June 1972 %P 421-426 %A Philip Gilbert %A W.J. Chandler %T Interference between communicating parallel processes %J Communications of the ACM %K cacm %V 15 %N 6 %D June 1972 %P 427-437 %A James F. Gimpel %T Blocks - a new datatype for SNOBOL4 %J Communications of the ACM %K cacm %V 15 %N 6 %D June 1972 %P 438-47 %A David F. Marti %T A Boolean matrix method for the computation of linear precedence functions %J Communications of the ACM %K cacm %V 15 %N 6 %D June 1972 %P 448-454 %A Robert T. O'Reagan %T Computer-assisted codes from verbal responses %J Communications of the ACM %K cacm %V 15 %N 6 %D June 1972 %P 455-459 %A Ken Iguchi %T A starting method for solving nonlinear Volterra integral equations of the second kind %J Communications of the ACM %K cacm %V 15 %N 6 %D June 1972 %P 460-461 %A Ira Pohl %T A sorting problem and its complexity %J Communications of the ACM %K cacm %V 15 %N 6 %D June 1972 %P 462-464 %A Abraham Kandel %T Computer science - a vicious circle (short communication) %J Communications of the ACM %K cacm %V 15 %N 6 %D June 1972 %P 470-471 %A Elliot B. Koffman %T Individualizing instruction in a generative CAI tutor (short communication) %J Communications of the ACM %K cacm %V 15 %N 6 %D June 1972 %P 472-473 %A Lee Revens %T The first twenty-five years %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 485-490 %A Eric A. Weiss %T Publications in computing: an informal review %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 491-497 %A A.P. Ershov %T Aesthetics and the human factor in programming %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 501-505 %A Michael A. Arbib %T Toward an automata theory of brains %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 521-527 %A Zohar Manna %A Jean Voullemin %T Fixpoint approach to the theory of computation %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 528-536 %A J.F. Traub %T Numerical mathematics and computer science %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 537-541 %A David F. Shanno %A Roman L. Weil %T Management science: a view from nonlinear programming %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 542-549 %A Joel Moses %T Toward a general theory of special functions %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 550-554 %A Caxton C. Foster %T A view of computer architecture %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 557-565 %A A.G. Fraser %T On the interface between computers and data communications systems %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 566-573 %A Per Brinch\ Hansen %T Structured multiprogramming %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 574-577 %A W.C. Lynch %T Operating system performance %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 579-585 %A Stephen L. Kimbleton %T The role of computer system models in performance evaluation %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 586-590 %A Saul Rosen %T Programming systems and languages %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 591-600 %A Jean E. Sammet %T Programming languages: history and future %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 601-610 %A Lloyd D. Fosdick %T The production of better mathematical software %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 611-617 %A Daniel G. Bobrow %T Requirements for advanced programming systems for list processing %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 618-627 %A Charles W. Bachman %T The evolution of storage structures %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 628-636 %A John R. Rice %T On the present and future of scientific computation %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 637-639 %A Robert I. Benjamin %T A generational perspective of information system development %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 640-643 %A Sally Yeates Sedelow %T Language analysis in the humanities %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 644-647 %A Karl L. Zinn %T Computers in the instructional process: directions for research and development %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 648-651 %A Gerald M. Sturman %T Computers and urban society %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 652-657 %A Gerald Salton %T Dynamic document processing %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 658-668 %A Donald E. Knuth %T Ancient Babylonian algorithms %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 671-677 %A F.L. Bauer %A H. Wossner %T The "Plankalkul" of Konrad Zuse: a forerunner of today's programming languages %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 678-685 %A Richard E. Sprague %T A western view of computer history %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 686-692 %A Franz L. Alt %T Archaeology of computers %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 693-694 %A A. Borodin %A C.C. Gotlieb %T Computers and employment %J Communications of the ACM %K cacm %V 15 %N 7 %D July 1972 %P 695-702 %A David Crowe %T Generating parsers for affix grammars %J Communications of the ACM %K cacm %V 15 %N 8 %D August 1972 %P 728-734 %A Robert E. Helbig %A Patrick K. Orr %A Robert R. Roediger %T Political redistricting by computer %J Communications of the ACM %K cacm %V 15 %N 8 %D August 1972 %P 735-741 %A Arthur J. Benjamin %T An extensible editor for a small machine with disk storage %J Communications of the ACM %K cacm %V 15 %N 8 %D August 1972 %P 742-747 %A Robert F. Rosin %A Gideon Frieder %A Richard H. Eckhouse,\ Jr. %T An environment for research in microprogramming and emulation %J Communications of the ACM %K cacm %V 15 %N 8 %D August 1972 %P 748-760 %A P.M. Oden %A G.S. Shedler %T A model of memory contention in a paging machine %J Communications of the ACM %K cacm %V 15 %N 8 %D August 1972 %P 761-771 %A Herbert J. Bernstein %T Compiling fixed-point multiplications (short communication) %J Communications of the ACM %K cacm %V 15 %N 8 %D August 1972 %P 772 %A Wm. van\ der\ Poel %T Comment on the composition of semantics in Algol 68 (short communication) %J Communications of the ACM %K cacm %V 15 %N 8 %D August 1972 %P 772 %A James H. Morris,\ Jr. %T A bonus from van\ Wijngaarden's device %J Communications of the ACM %K cacm %V 15 %N 8 %D August 1972 %P 773 %A Peter R. Jones %T Comment on average binary tree search length %J Communications of the ACM %K cacm %V 15 %N 8 %D August 1972 %P 774 %A Ronald C. Read %T A note on the generation of rosary permutations (short communication) %J Communications of the ACM %K cacm %V 15 %N 8 %D August 1972 %P 775 %A K.N. Levitt %A W.H. Kautz %T Cellular arrays for the solution of graph problems %J Communications of the ACM %K cacm %V 15 %N 9 %D September 1972 %P 789-801 %A Sakti P. Ghosh %T File organization: the consecutive retrieval property %J Communications of the ACM %K cacm %V 15 %N 9 %D September 1972 %P 802-808 %A M. Mor %A T. Lamdan %T A new approach to automatic scanning of contour maps %J Communications of the ACM %K cacm %V 15 %N 9 %D September 1972 %P 809-812 %A Paul L. Richman %T Automatic error analysis for determining precision %J Communications of the ACM %K cacm %V 15 %N 9 %D September 1972 %P 813-817 %A E.S. Deutsch %T Thinning algorithms on rectangular, hexagonal, and triangular arrays %J Communications of the ACM %K cacm %V 15 %N 9 %D September 1972 %P 827-827 %A James Gregory %T A comparison of floating point summation methods (short communication) %J Communications of the ACM %K cacm %V 15 %N 9 %D September 1972 %P 838 %A Halem M. Khalil %T The eigenproblem of block tridiagonal matrices (short communication) %J Communications of the ACM %K cacm %V 15 %N 9 %D September 1972 %P 839- %A D.L. Parnas %A A.N. Habermann %T Comment on deadlock prevention method (short communication) %J Communications of the ACM %K cacm %V 15 %N 9 %D September 1972 %P 840-841 %A Richard Rubinstein %A Julian Feldman %T A controller for a Braille terminal (short communication) %J Communications of the ACM %K cacm %V 15 %N 9 %D September 1972 %P 841-842 %A K.C. Tan %T On Foster's information storage and retrieval using AVL trees (short communication) %J Communications of the ACM %K cacm %V 15 %N 9 %D September 1972 %P 843 %A Edsger W. Dijkstra %T The humble programmer %J Communications of the ACM %K cacm %V 15 %N 10 %D October 1972 %P 859-866 %A James B. Morris %T Demand paging through utilization of working sets on the Maniac II %J Communications of the ACM %K cacm %V 15 %N 10 %D October 1972 %P 867-872 %A J.H. Ahrens %A V. Dieter %T Computer methods for sampling from the exponential and normal distributions %J Communications of the ACM %K cacm %V 15 %N 10 %D October 1972 %P 873-882 %A Richard J. Hanson %T Integral equations of immunology %J Communications of the ACM %K cacm %V 15 %N 10 %D October 1972 %P 883-890 %A R. Simmons %A J. Slocum %T Generating English discourse from semantic networks %J Communications of the ACM %K cacm %V 15 %N 10 %D October 1972 %P 891-905 %A Gert Dathe %T Conversion of decision tables by rule mask method without rule mask %J Communications of the ACM %K cacm %V 15 %N 10 %D October 1972 %P 906-909 %A W.D. Frazer %A C.K. Wong %T Sorting by natural selection %J Communications of the ACM %K cacm %V 15 %N 10 %D October 1972 %P 910-913 %A Phyllis Fox %T A comparative study of computer programs for integrating differential equations %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 941-948 %A Micael A. Malcolm %T Algorithms to reveal properties of floating-point arithmetic %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 949-951 %A Merrel L. Patrick %T A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 952-955 %A Henry F. Ledgard %T A model for type checking - with an application to Algol 60 %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 956-966 %A Peter Henderson %T Derived semantics for some programming language constructs %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 967-973 %A I.J. Verhelst %T The conversion of limited-entry decision tables to optimal and near-optimal flowcharts: two new algorithms %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 974-980 %A H.D. Baecker %T Garbage collection for virtual memory computer systems %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 981-986 %A John S. Ramberg %A Bruce W. Schmeiser %T An approximate method for generating symmetric random variables %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 987-990 %A V.Y. Lum %A P.S.T. Yuen %T Additional results on key-to-address transform techniques: a fundamental performance study on large existing formatted files (short communication) %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 996-997 %A Murray A. Eisenberg %A Michael R. McGuire %T Further comments on Dijkstra's concurrent programming control problem (short communication) %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 999 %A Stephen W. Smoliar %T Comments on Moorer's: Music and computer composition (short communication) %J Communications of the ACM %K cacm %V 15 %N 11 %D November 1972 %P 1000-1001 %A J. Richard Phillips %A H.C. Adams %T Dynamic partitioning for array languages %J Communications of the ACM %K cacm %V 15 %N 12 %D December 1972 %P 1023-1032 %A R. Bayer %A C. Witzgall %T Inner ranges for matrix calculi %J Communications of the ACM %K cacm %V 15 %N 12 %D December 1972 %P 1033-1039 %A Jay Earley %A Paul Caizergues %T A method for incrementally compiling languages with nested statement structure %J Communications of the ACM %K cacm %V 15 %N 12 %D December 1972 %P 1040-1044 %A Fabrizio Luccio %T Weighted increment linear search for scatter tables %J Communications of the ACM %K cacm %V 15 %N 12 %D December 1972 %P 1045-1047 %A Ronlad R. Barr %A Norman L. Slezak %T A comparison of multivariate normal generators %J Communications of the ACM %K cacm %V 15 %N 12 %D December 1972 %P 1048-1049 %A John Moore %A Prentis Robinson %T A new method for the solution of the Cauchy problem for parabolic equations %J Communications of the ACM %K cacm %V 15 %N 12 %D December 1972 %P 1050-1052 %A D.L. Parnas %T On the criteria to be used in decomposing systems into modules %J Communications of the ACM %K cacm %V 15 %N 12 %D December 1972 %P 1053-1058 %A P.J. Brown %T Levels of language for portable software %J Communications of the ACM %K cacm %V 15 %N 12 %D December 1972 %P 1059-1062 %A Stephen Sherman %A Forrest Baskett,\ III %A J.C. Browne %T Trace-driven modeling and analysis of CPU scheduling in multiprogramming system %J Communications of the ACM %K cacm %V 15 %N 12 %D December 1972 %P 1063-1069 %A G.S. Shedler %T A queueing model of a multiprogrammed computer with a two-level storage system %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 3-10 %A Carter Bays %T The reallocation of hash-coded tables %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 11-14 %A James H. Morris,\ Jr. %T Protection in programming languages %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 15-21 %A Yoichi Muraoka %A David J. Kuck %T On the time required for a sequence of matrix products %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 22-26 %A E.B. James %A D.P. Partridge %T Adaptive correction of program statements %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 27-37 %A P.L. Richman %T Variable-precision exponentiation %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 38-40 %A C.R. Crawford %T Reduction of a band-symmetric generalized eigenvalue problem %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 41-44 %A Sumner E. Blount %A Louis Fein %T The practical aspect of computer science education - discussion (short communication) %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 45-46 %A Carter Bays %T A note on when to chain overflow items within a direct-access table (short communication) %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 46-47 %A M. Stella Atkins %T Mutual recursion in Algol 60 using restricted compilers (short communication) %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 47-48 %A Michael A. Duggan %T Patents on programs ? The Supreme Court says no - a comment %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 60-62 %A James P. Titus %T Supreme Court ruling fails to settle issue of patenting computer programs %J Communications of the ACM %K cacm %V 16 %N 1 %D January 1973 %P 63-64 %A C.D. Merrill %T Representation of contours and regions for efficient computer search %J Communications of the ACM %K cacm %V 16 %N 2 %D February 1973 %P 69-82 %A S. Crespi-Reghizzi %A M.A. Melkanoff %A L. Lichten %T The use of grammatical inference for designing programming languages %J Communications of the ACM %K cacm %V 16 %N 2 %D February 1973 %P 83-90 %A J.F. Gimpel %T A theory of discrete patterns and their implementation in SNOBOL4 %J Communications of the ACM %K cacm %V 16 %N 2 %D February 1973 %P 91-100 %A J. Rokne %T Automatic errorbounds for simple zeros of analytic functions %J Communications of the ACM %K cacm %V 16 %N 2 %D February 1973 %P 101-104 %A Richard P. Brent %T Reducing the retrieval time of scatter storage techniques %J Communications of the ACM %K cacm %V 16 %N 2 %D February 1973 %P 105-109 %A Robert M. Graham %A Gerald J. Clancy,\ Jr. %A David B. DeVaney %T A software design and evaluation system %J Communications of the ACM %K cacm %V 16 %N 2 %D February 1973 %P 110-116 %A R.M. Balzer %T An overview of the ISPL computer system design %J Communications of the ACM %K cacm %V 16 %N 2 %D February 1973 %P 117-122 %A Richard H. Austing %A Gerald L. Engel %T A computer science course program for small colleges %J Communications of the ACM %K cacm %V 16 %N 3 %D March 1973 %P 139-147 %A Robert A. Wagner %T Common phrases and minimal-space text storage %J Communications of the ACM %K cacm %V 16 %N 3 %D March 1973 %P 148-152 %A Y. Feinroth %A E. Franceshini %A M. Goldstein %T Telecommunications using a front-end minicomputer %J Communications of the ACM %K cacm %V 16 %N 3 %D March 1973 %P 153-160 %A Charles P. Pack %T The effects of multiplexing on a computer-communications system %J Communications of the ACM %K cacm %V 16 %N 3 %D March 1973 %P 161-168 %A Richard W. Conway %A Thomas R. Wilcox %T Design and implementation of a diagnostic compiler for PL/I %J Communications of the ACM %K cacm %V 16 %N 3 %D March 1973 %P 169-179 %A Herbert E. Salzer %T Gray code and the +- sign sequence when +-f(+-f(+-f(...+-f(x)...))) is ordered (short communication) %J Communications of the ACM %K cacm %V 16 %N 3 %D March 1973 %P 180 %A Abraham Bookstein %T On Harrison's substring testing technique (short communication) %J Communications of the ACM %K cacm %V 16 %N 3 %D March 1973 %P 180-181 %A W.H. Payne %T Graduate education: the Ph.D. glut (short communication) %J Communications of the ACM %K cacm %V 16 %N 3 %D March 1973 %P 181-182 %A A. Hassitt %A J.W. Lageschulte %A L.E. Lyon %T Implementation of a high level language machine %J Communications of the ACM %K cacm %V 16 %N 4 %D April 1973 %P 199-212 %A John G. Williams %T Asymmetric memory hierarchies %J Communications of the ACM %K cacm %V 16 %N 4 %D April 1973 %P 213-222 %A H. Kuki %A W.J. Cody %T A statistical study of the accuracy of floating point number systems %J Communications of the ACM %K cacm %V 16 %N 4 %D April 1973 %P 223-229 %A W.A. Burkhard %A R.M. Keller %T Some approaches to best-match file searching %J Communications of the ACM %K cacm %V 16 %N 4 %D April 1973 %P 230-236 %A James P. Strong,\ III %A Azriel Rosenfeld %T A region coloring technique for scene analysis %J Communications of the ACM %K cacm %V 16 %N 4 %D April 1973 %P 237-246 %A Juan Rodriguez-Rosell %A Jean Claude Dupuy %T The design, implementation, and evaluation of a working-set dispatcher %J Communications of the ACM %K cacm %V 16 %N 4 %D April 1973 %P 247-253 %A David Pager %T The problem of communicating complex information %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 275-281 %A David W. Low %T Programming by questionnaire: an effective way to use decision tables %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 282-286 %A P.J.H. King %A R.G. Johnson %T Some comments on the use of ambiguous decision tables and their conversion to computer programs %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 287-290 %A John Salasin %T Hierarchical storage in information retrieval %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 291-295 %A D.G. Corneil %A C.C. Gotleib %A Y.M. Lee %T Minimal event-name network of project precedence relations %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 296-298 %A Andrew Mercer %A Azriel Rosenfeld %T An array grammar programming system %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 299-305 %A Edward M. Reingold %T A nonrecursive list moving algorithm %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 305-307 %A Mohit Kumer Roy %T Reflection-free permutations, rosary permutations, and adjacent transposition algorithms (short communication) %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 312-313 %A Clyde H. McMorrow %T Concerning music and computer composition in computational linguistics (short communication) %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 313 %A R.L. Wexelblat %T Another comment on computer music (short communication) %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 313-314 %A Robert H. Estell %T A comment on the practical aspects of computer science education (short communication) %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 314 %A Roger Fajman %A John Borgelt %T WYLBUR: an interactive text editing and remote job entry system %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 314-324 %A Dennis J. Frailey %T A practical approach to managing resources and avoiding deadlocks %J Communications of the ACM %K cacm %V 16 %N 5 %D May 1973 %P 325-329 %A R.J. Hamlet %T Efficient multiprogramming resource allocation and accounting %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 337-340 %A Erol Gelenbe %A J.C.A. Boekhorst %A J.L.W. Ressels %T Minimizing wasted space in partitioned segmentation %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 341-349 %A J. Carver Will %T Synchronizing processors with memory-content-generated interrupts %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 350-351 %A Harold S. Stone %A Samuel H. Fuller %T On the near-optimality of the shortest-latency-time-first drum scheduling discipline %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 352-353 %A Peter F. Stockhausen %T Adapting optimal code generation for arithmetic expressions to the instruction sets available on present day computers (short communication) %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 353-354 %A Robert F. Ling %T A computer generated aid for cluster analysis %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 355-361 %A Ben Scheiderman %T Optimum data base reorganization points %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 362-365 %A Horst Strunz %T The development of decision tables via parsing complex decision situations %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 366-369 %A James R. Bell %T Threaded code %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 370-372 %A J. Ferguson %A P.A. Staley %T Least squares piecewise cubic curve fitting %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 380-382 %A W.P. Hoskins %T Cubic spline solutions to fourth-order boundary value problems %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 382-385 %A Franz L. Alt %A Judith Yuni Kirk %T Computer photocomposition of technical text %J Communications of the ACM %K cacm %V 16 %N 6 %D June 1973 %P 386-391 %A Richard L. Nolan %T Managing the computer resource: a stage hypothesis %J Communications of the ACM %K cacm %V 16 %N 7 %D July 1973 %P 399-405 %A J.C. Huang %T A note on information organization and storage %J Communications of the ACM %K cacm %V 16 %N 7 %D July 1973 %P 406-410 %A Edward W. Kozdrowicki %A Dennis W. Cooper %T Coko III: the Cooper-Koz chess program %J Communications of the ACM %K cacm %V 16 %N 7 %D July 1973 %P 411-426 %A John H. Howard,\ Jr. %T Mixed solutions to the deadlock problem %J Communications of the ACM %K cacm %V 16 %N 7 %D July 1973 %P 427-430 %A Erol Gelenbe %T The distributed of a program in primary and fast buffer storage %J Communications of the ACM %K cacm %V 16 %N 7 %D July 1973 %P 431-434 %A Robert F. Rosin %T Teaching "about programming" %J Communications of the ACM %K cacm %V 16 %N 7 %D July 1973 %P 435-439 %A F. Warren McFarlan %A Richard L. Nolan %T Curriculum recommendations for graduate professional programs in information systems: recommended addendum on information systems administration %J Communications of the ACM %K cacm %V 16 %N 7 %D July 1973 %P 439-440 %A Abraham Kandel %T Computer science - seminars for undergraduates %J Communications of the ACM %K cacm %V 16 %N 7 %D July 1973 %P 442 %A G.V. Bochmann %T Multiple exits from a loop without the goto (short communication) %J Communications of the ACM %K cacm %V 16 %N 7 %D July 1973 %P 443-444 %A Patrick A.V. Hall %T Equivalence between AND/OR graphs and context-free grammars (short communication) %J Communications of the ACM %K cacm %V 16 %N 7 %D July 1973 %P 444-445 %A Michael H. Smith %T A learning program which which plays partnership dominoes %J Communications of the ACM %K cacm %V 16 %N 8 %D August 1973 %P 462-467 %A D.J. MacLennan %T FEN - an axiomatic basis for program semantics %J Communications of the ACM %K cacm %V 16 %N 8 %D August 1973 %P 468-474 %A David Misunas %T Petri nets and speed independent design %J Communications of the ACM %K cacm %V 16 %N 8 %D August 1973 %P 474-481 %A Zohar Manna %A Stephen Ness %A Jean Vuillemin %T Inductive methods for proving properties of programs %J Communications of the ACM %K cacm %V 16 %N 8 %D August 1973 %P 491-502 %A W.W. Peterson %A T. Kasami %A N. Tokura %T On the capabilities of while, repeat, and exit statements %J Communications of the ACM %K cacm %V 16 %N 8 %D August 1973 %P 503-512 %A Caxton C. Foster %T A generalization of AVL trees %J Communications of the ACM %K cacm %V 16 %N 8 %D August 1973 %P 513-517 %A Jeffrey P. Buzen %T Computational algorithms for closed queueing networks with exponential servers %J Communications of the ACM %K cacm %V 16 %N 9 %D September 1973 %P 527-531 %A S. Ganapathy %A V. Rajaraman %T Information theory applied to the conversion of decision tables to computer programs %J Communications of the ACM %K cacm %V 16 %N 9 %D September 1973 %P 532-539 %A Alfonso F. Cardenas %T Evaluation and selection of file organization - a model and system %J Communications of the ACM %K cacm %V 16 %N 9 %D September 1973 %P 540-548 %A R.G. Casey %T Design of tree structures for efficient querying %J Communications of the ACM %K cacm %V 16 %N 9 %D September 1973 %P 549-556 %A Juan Rodriguez-Rosell %T Empirical working-set behaviour %J Communications of the ACM %K cacm %V 16 %N 9 %D September 1973 %P 556-560 %A Geoffrey W. Gates %A David A. Poplawski %T A simple technique for structured variable lookup %J Communications of the ACM %K cacm %V 16 %N 9 %D September 1973 %P 561-565 %A M.V. Zelkowitz %T Reversable execution (short communication) %J Communications of the ACM %K cacm %V 16 %N 9 %D September 1973 %P 566 %A Robert E. Barnhill %A David T. Pilcher %T Sard kernels for certain bivariate cubatures %J Communications of the ACM %K cacm %V 16 %N 9 %D September 1973 %P 567-570 %A Morton C. Jacobs %T Patents for software inventions: the Supreme Court's computer programming decision - a comment %J Communications of the ACM %K cacm %V 16 %N 10 %D October 1973 %P 586 %A John S. McGeachie %T Multiple terminals under user program control in a time-sharing environment %J Communications of the ACM %K cacm %V 16 %N 10 %D October 1973 %P 587-590 %A Daniel G. Bobrow %A Ben Wegbreit %T A model and stack implementation of stack environments %J Communications of the ACM %K cacm %V 16 %N 10 %D October 1973 %P 591-602 %A V.Y. Lum %T General performance analysis of key-to-address transformation methods using an abstract file concept %J Communications of the ACM %K cacm %V 16 %N 10 %D October 1973 %P 603-612 %A Butler W. Lampson %T A note on the confinement problem %J Communications of the ACM %K cacm %V 16 %N 10 %D October 1973 %P 613-615 %A Daniel S. Hirschberg %T A class of dynamic memory allocation algorithms %J Communications of the ACM %K cacm %V 16 %N 10 %D October 1973 %P 615-618 %A B.G. Prieve %T Using page residency to select the working set parameter %J Communications of the ACM %K cacm %V 16 %N 10 %D October 1973 %P 619-620 %A Robert E. Millstein %T Control structures in Illiac IV fortran %J Communications of the ACM %K cacm %V 16 %N 10 %D October 1973 %P 621-627 %A Charles W. Bachman %T The programmer as navigator %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 653-658 %A R.S. Fabry %T Dynamic verification of operating system decisions %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 659-668 %A M.D. Mickunas %A N.M. Schneider %T A parser-generating system for constructing compressed compilers %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 669-676 %A B.W. Jordan,\ Jr. %A R.C. Barrett %T A scan conversion algorithm with reduced storage requirements %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 676-682 %A James R. Slagle %A Lewis M. Norton %T Experiments with an automatic theorem-prover having partial ordering inference rules %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 682-688 %A Peter J. Denning %A G. Scott Graham %T A note on subexpression ordering in the execution of arithmetic expressions %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 700-702 %A Jerome A. Feldman %A James R. Low %T Comment on Brent's scatter storage algorithm (short communication) %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 703 %A Eberhard Wegner %T Tree-structured programs (short communication) %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 704-705 %A Herbert E. Salzer %T A recurrence scheme for converting from one orthogonal expansion into another %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 705-707 %A Frank Stenger %T An algorithm for the approximate solution of Wiener-Hopf integral equations %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 708-710 %A L.W. Ehrlich %T Solving the biharmonic equation in a square: a direct versus a semidirect method %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 711-714 %A Ellis Horowitz %T Computers, society, and the law - the role of legal education %J Communications of the ACM %K cacm %V 16 %N 11 %D November 1973 %P 715-726 %A Daniel Couger %T Curriculum recommendations for undergraduate programs in information systems %J Communications of the ACM %K cacm %V 16 %N 12 %D December 1973 %P 727-749 %A Edgar H. Sibley %A Robert W. Taylor %T A data definition and mapping language %J Communications of the ACM %K cacm %V 16 %N 12 %D December 1973 %P 750-759 %A Gordon Lyon %T Syntax-directed least-errors analysis for context-free languages: a practical approach %J Communications of the ACM %K cacm %V 17 %N 1 %D January 1974 %P 3-14 %A Michael A. Malcolm %A John Palmer %T A fast methods for solving a class of tridiagonal linear systems %J Communications of the ACM %K cacm %V 17 %N 1 %D January 1974 %P 14-17 %A Hiroshi Akima %T A method of bivariate interpolation and fitting based on smooth surface local procedures %J Communications of the ACM %K cacm %V 17 %N 1 %D January 1974 %P 18-20 %A Norman E. Gibbs %A William G. Poole,\ Jr. %T Tridiagonalization by permutations %J Communications of the ACM %K cacm %V 17 %N 1 %D January 1974 %P 20-24 %A Ivan E. Sutherland %A Gary W. Hodgman %T Reentrant polygon clipping %J Communications of the ACM %K cacm %V 17 %N 1 %D January 1974 %P 32-42 %A P.J.H. King %A R.G. Johnson %T Comments on the algorithms of Verhelst for the conversion of limited-entry decision tables to flowcharts (short communication) %J Communications of the ACM %K cacm %V 17 %N 1 %D January 1974 %P 43-45 %A Gary D. Knott %T A numbering system for combinations (short communication) %J Communications of the ACM %K cacm %V 17 %N 1 %D January 1974 %P 45-46 %A Henry C. Lucas,\ Jr. %T A CRT report generating system (short communication) %J Communications of the ACM %K cacm %V 17 %N 1 %D January 1974 %P 47-48 %A James B. Rothnie,\ Jr. %A Tomas Lozano %T Attribute based file organization in a paged memory environment %J Communications of the ACM %K cacm %V 17 %N 2 %D February 1974 %P 63-69 %A D.W. Jordan,\ Jr. %A R.C. Barrett %T A cell organized raster display for line drawings %J Communications of the ACM %K cacm %V 17 %N 2 %D February 1974 %P 70-77 %A John S. Ramberg %A Bruce W. Schmeiser %T An approximate method for generating asymmetric random variables %J Communications of the ACM %K cacm %V 17 %N 2 %D February 1974 %P 78-82 %A Leslie Lamport %T The parallel execution of DO loops %J Communications of the ACM %K cacm %V 17 %N 2 %D February 1974 %P 83-93 %A Henry F. Ledgard %T Productions systems: or can we do better than BNF ? %J Communications of the ACM %K cacm %V 17 %N 2 %D February 1974 %P 94-102 %A Ben Wegbreit %T The synthesis of loop predicates %J Communications of the ACM %K cacm %V 17 %N 2 %D February 1974 %P 102-112 %A K. Sreenivasan %A A.J. Kleinman %T On the construction of a representative synthetic workload %J Communications of the ACM %K cacm %V 17 %N 3 %D March 1974 %P 127-132 %A E. Balkowitz %A W. Chiu %A L. Presser %A R. Wood %T Dynamic memory repacking %J Communications of the ACM %K cacm %V 17 %N 3 %D March 1974 %P 133-138 %A Howard Lee Morgan %T Optimal space allocation on disk storage devices %J Communications of the ACM %K cacm %V 17 %N 3 %D March 1974 %P 139-142 %A R.C. Barrett %A B.W. Jordan,\ Jr. %T Scan conversion algorithms for a cell organized raster display %J Communications of the ACM %K cacm %V 17 %N 3 %D March 1974 %P 157- %A A. Frank Ackerman %T Quadratic search for hash tables of size p^n (short communication) %J Communications of the ACM %K cacm %V 17 %N 3 %D March 1974 %P 164 %A Stephen W. Smoliar %T Emotional content considered dangerous (short communication) %J Communications of the ACM %K cacm %V 17 %N 3 %D March 1974 %P 164-165 %A Harold S. Stone %T A note on the combinatorial problem of Burnett and Coffman (short communication) %J Communications of the ACM %K cacm %V 17 %N 3 %D March 1974 %P 165-166 %A Fred T. Krogh %T Efficient implementation of a variable projection algorithm for nonlinear least squares problems %J Communications of the ACM %K cacm %V 17 %N 3 %D March 1974 %P 167-169 %A Jerome H. Saltzer %T A simple linear model of demand paging programming %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 181-186 %A M.A. Franklin %A R.K. Gupta %T Computation of page fault probability from program transition diagram %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 186-191 %A John W. Boyse %T Execution characteristics of programs in a page-on-demand system %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 192-196 %A Graham Smith %A Ian M. Sefton %T On Lions' counter example for Gotlieb's method for the construction of school timetables %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 196-197 %A Gary Lindstrom %T Copying list structures using bounded workspace %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 198-202 %A Shimon Even %T Parallelism in tape-sorting %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 202-204 %A Henry C. Lucas,\ Jr. %A David B. Montgomery %A Jean Claude Larreche %T A study of computer use in a graduate school of business (short communication) %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 205-206 %A Peter Freeman %A Michael A. Malcolm %A William H. Payne %T Graduate education: the Ph.D. glut: response and rebuttal %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 206-207 %A Theodor D. Sterling %A Seymour V. Pollack %T Ideal teaching machines - a solution to the pedagogic language problem (short communication) %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 207-208 %A Paul W. Abrahams %T Some remarks on lookup of structured variables (short communication) %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 209-210 %A A. Balfour %T An alternative approach to mutual recursion in Algol 60 using restricted compilers (short communication) %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 210 %A R.C.T. Lee %A C.L. Chang %A Richard J. Waldinger %T An improved program-synthesizing algorithm and its correctness %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 211-217 %A A.R. Cline %T Scalar- and planar-valued curve fitting using splines under tension %J Communications of the ACM %K cacm %V 17 %N 4 %D April 1974 %P 218-220 %A Mary Shaw %T Reduction of compilation costs through language contraction %J Communications of the ACM %K cacm %V 17 %N 5 %D May 1974 %P 245-250 %A Ben Wegbreit %T The treatment of data types in EL1 %J Communications of the ACM %K cacm %V 17 %N 5 %D May 1974 %P 251-264 %A Robert A. Wagner %T Order-n correction for regular languages %J Communications of the ACM %K cacm %V 17 %N 5 %D May 1974 %P 265-268 %A Nainkuan Tsao %T On the distributions of significant digits and roundoff errors %J Communications of the ACM %K cacm %V 17 %N 5 %D May 1974 %P 269-271 %A M.C. Wunderlich %A J.L. Selfridge %T A design for a number theory package with an optimized trial division routine %J Communications of the ACM %K cacm %V 17 %N 5 %D May 1974 %P 272-276 %A W. Morven Gentleman %A Scott J. Marovich %T More on algorithms that reveal properties of floating point arithmetic units (short communication) %J Communications of the ACM %K cacm %V 17 %N 5 %D May 1974 %P 276-277 %A D.E. Gold %A D.J. Kuck %T A model for masking rotational latency by dynamic disk allocation %J Communications of the ACM %K cacm %V 17 %N 5 %D May 1974 %P 278-288 %A Jacques Cohen %A Carl Zuckerman %T Two languages for estimating program efficiency %J Communications of the ACM %K cacm %V 17 %N 6 %D June 1974 %P 301-308 %A L. Henschen %A Ross Overbeek %A L. Wos %T A theorem-proving language for experimentation %J Communications of the ACM %K cacm %V 17 %N 6 %D June 1974 %P 308- %A James F. Gimpel %T The minimization of spatially-multiplexed character sets %J Communications of the ACM %K cacm %V 17 %N 6 %D June 1974 %P 315-318 %A William D. Slysz %T An evaluation of statistical software in the social sciences %J Communications of the ACM %K cacm %V 17 %N 6 %D June 1974 %P 326-332 %A John Adams %A John Gary %T Compact representation of contour plots for phone line transmission %J Communications of the ACM %K cacm %V 17 %N 6 %D June 1974 %P 333-336 %A W. Wulf %A E. Cohen %A W. Corwin %A A. Jones %A R. Levin %A C. Pierson %A F. Pollack %T Hydra: a kernel of a multiprocessor operating system %J Communications of the ACM %K cacm %V 17 %N 6 %D June 1974 %P 337-345 %A Ian J. Barton %A Susan E. Creasey %A Michael F. Lynch %A Michael J. Snell %T An information-theoretic approach to text searching in direct access systems %J Communications of the ACM %K cacm %V 17 %N 6 %D June 1974 %P 345-350 %A Edward Minieka %T On computing sets of shortest paths in a graph %J Communications of the ACM %K cacm %V 17 %N 6 %D June 1974 %P 351-353 %A Dennis M. Ritchie %A Ken Thompson %T The Unix time-sharing system %J Communications of the ACM %K cacm %V 17 %N 7 %D July 1974 %P 365-375 %A Samuel H. Fuller %T Minimal total processing time drum and disk scheduling disciplines %J Communications of the ACM %K cacm %V 17 %N 7 %D July 1974 %P 376-381 %A J. Bruno %A E.G. Coffman,\ Jr. %A R. Sethi %T Scheduling independent tasks to reduce mean finishing time %J Communications of the ACM %K cacm %V 17 %N 7 %D July 1974 %P 382-387 %A Jerome H. Saltzer %T Protection and the control of information sharing in Multics %J Communications of the ACM %K cacm %V 17 %N 7 %D July 1974 %P 388-402 %A R.S. Fabry %T Capability-based addressing %J Communications of the ACM %K cacm %V 17 %N 7 %D July 1974 %P 403-412 %A Gerald J. Popek %A Robert P. Goldberg %T Formal requirements for virtualizable third generation architectures %J Communications of the ACM %K cacm %V 17 %N 7 %D July 1974 %P 412-421 %A Bruce Hahn %T A new technique for compression and storage of data %J Communications of the ACM %K cacm %V 17 %N 8 %D August 1974 %P 434-436 %A Arthur Evans,\ Jr. %A William Kantrowitz %A Edwin Weiss %T A user authentication scheme not requiring secrecy in the computer %J Communications of the ACM %K cacm %V 17 %N 8 %D August 1974 %P 437-441 %A G.B. Purdy %T A high security log-in procedure %J Communications of the ACM %K cacm %V 17 %N 8 %D August 1974 %P 442-445 %A Theodore D. Friedman %A Lance J. Hoffman %T Execution time requirements for encipherment programs %J Communications of the ACM %K cacm %V 17 %N 8 %D August 1974 %P 445-449 %A G.A. Neufeld %A J.Tartar %T Graph coloring conditions for the existence of solutions to the timetable problem %J Communications of the ACM %K cacm %V 17 %N 8 %D August 1974 %P 450-453 %A Leslie Lamport %T A new solution to Dijkstra's concurrent programming problem %J Communications of the ACM %K cacm %V 17 %N 8 %D August 1974 %P 453-455 %A John C. Cavouras %T On the conversion of programs to decision tables: methods and objectives %J Communications of the ACM %K cacm %V 17 %N 8 %D August 1974 %P 456-462 %A A.H. Stroud %T Gauss harmonic interpolation formulas %J Communications of the ACM %K cacm %V 17 %N 8 %D August 1974 %P 471-475 %A Rolf A.E. Lagerlof %T Interpolation with rounded ramp functions %J Communications of the ACM %K cacm %V 17 %N 8 %D August 1974 %P 476-479 %A Forman S. Acton %T Recurrence relations for the Fresnel integral and similar integrals %J Communications of the ACM %K cacm %V 17 %N 8 %D August 1974 %P 480-481 %E Daniel D. McCracken %T A problem-list of issues concerning computers and public policy %J Communications of the ACM %K cacm %V 17 %N 9 %D September 1974 %P 495-503 %A I.M. Willers %T A new integration algorithm for ordinary differential equations based on continued fraction approximations %J Communications of the ACM %K cacm %V 17 %N 9 %D September 1974 %P 504-508 %A Oliver Aberth %T A precise numerical analysis program %J Communications of the ACM %K cacm %V 17 %N 9 %D September 1974 %P 509-513 %A To-Yet Cheung %T An interactive graphics display for region partitioning by linear programming %J Communications of the ACM %K cacm %V 17 %N 9 %D September 1974 %P 513-516 %A Mario Schkolnick %T The equivalence of reducing transition languages and deterministic languages %J Communications of the ACM %K cacm %V 17 %N 9 %D September 1974 %P 517-519 %A John W. Young %T A first order approximation to the optimum checkpoint interval (short communication) %J Communications of the ACM %K cacm %V 17 %N 9 %D September 1974 %P 530-531 %A Keith Shwayder %T Extending the information theory approach to converting limited-entry decision tables to computer programs %J Communications of the ACM %K cacm %V 17 %N 9 %D September 1974 %P 532-537 %A C.A.R. Hoare %T Monitors: an operating system structuring concept %J Communications of the ACM %K cacm %V 17 %N 10 %D October 1974 %P 549-557 %A Kenneth K. Shen %A James L. Peterson %T A weighed buddy method for dynamic storage allocation %J Communications of the ACM %K cacm %V 17 %N 10 %D October 1974 %P 558-562 %A D.R. Slutz %A I.L. Traiger %T A note on the calculation of average working set size %J Communications of the ACM %K cacm %V 17 %N 10 %D October 1974 %P 563-565 %A Ben Schneiderman %A Peter Scheuermann %T Structured data structures %J Communications of the ACM %K cacm %V 17 %N 10 %D October 1974 %P 566-574 %A R.M. Canaday %A R.D. Harrison %A E.L. Ivie %A J.L. Ryder %A L.A. Wehr %T A back-end computer for data base management %J Communications of the ACM %K cacm %V 17 %N 10 %D October 1974 %P 575-582 %A A. Charnes %A W.M. Ratke %A J.D. Stutz %A A.S. Walters %T On generation of test problems for linear programming codes %J Communications of the ACM %K cacm %V 17 %N 10 %D October 1974 %P 583-591 %A Bruce Gilchrist %A Richard E. Weber %T Enumerating full-time programmers %J Communications of the ACM %K cacm %V 17 %N 10 %D October 1974 %P 592-608 %A Theodor D. Sterling %T Guidelines for humanizing computerized information systems: a report from Stanley House %J Communications of the ACM %K cacm %V 17 %N 11 %D November 1974 %P 609-613 %A Domenico Ferrari %T Improving locality by critical working sets %J Communications of the ACM %K cacm %V 17 %N 11 %D November 1974 %P 614-620 %A Perry Lowell Miller %T A locally-organized parser for spoken input %J Communications of the ACM %K cacm %V 17 %N 11 %D November 1974 %P 621-630 %A Gary M. Rader %T A method for composing simple traditional music by computer %J Communications of the ACM %K cacm %V 17 %N 11 %D November 1974 %P 631-638 %A R.A. Freiburghouse %T Register allocation via usage counts %J Communications of the ACM %K cacm %V 17 %N 11 %D November 1974 %P 638-642 %A Edsger W. Dijkstra %T Self-stabilizing systems in spite of distributed control (short communication) %J Communications of the ACM %K cacm %V 17 %N 11 %D November 1974 %P 643-644 %A J.A. Brown %A Bernard Werner %T An on-site data management system application in field archaeology (short communication) %J Communications of the ACM %K cacm %V 17 %N 11 %D November 1974 %P 644-647 %A David R. Hanson %T Simple technique for representing string in fortran IV (short communication) %J Communications of the ACM %K cacm %V 17 %N 11 %D November 1974 %P 646-647 %A C.J. van\ Rijsbergen %T The best-match problem in document retrieval (short communication) %J Communications of the ACM %K cacm %V 17 %N 11 %D November 1974 %P 648-649 %A R.V. Evans %T Multiple exits from a loop using neither goto nor labels %J Communications of the ACM %K cacm %V 17 %N 11 %D November 1974 %P 650 %A Donald E. Knuth %T Computer programming as an art %J Communications of the ACM %K cacm %V 17 %N 12 %D December 1974 %P 667- %A Lawrence I. Press %T Arguments for a moratorium on the construction of a community information utility %J Communications of the ACM %K cacm %V 17 %N 12 %D December 1974 %P 674-678 %A J.C. Strauss %T An analytic model of the HASP execution task monitor %J Communications of the ACM %K cacm %V 17 %N 12 %D December 1974 %P 679-685 %A Thomas L. Adam %A K.M. Chandy %A J.R. Dickson %T A comparison of list schedules for parallel processing systems %J Communications of the ACM %K cacm %V 17 %N 12 %D December 1974 %P 685-690 %A N.D. Wallace %T Computer generation of gamma random variates with non-integral shape parameters %J Communications of the ACM %K cacm %V 17 %N 12 %D December 1974 %P 691-695 %A A. Salazar %A R.V. Oakford %T A graph formulation of a school scheduling algorithm %J Communications of the ACM %K cacm %V 17 %N 12 %D December 1974 %P 696-698 %A Sherwood C. Chu %A Mones Berman %T An exponential method for the solution of systems of ordinary differential equations %J Communications of the ACM %K cacm %V 17 %N 12 %D December 1974 %P 699-702 %A C. William Skinner %T A heuristic approach to inductive inference in fact retrieval systems %J Communications of the ACM %K cacm %V 17 %N 12 %D December 1974 %P 707-712 %A Aaron Finerman %T Professionalism in the computing field %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 4-9 %A F.L. Bauer %T Positivity and norms %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 9-13 %A John Todd %T The lemniscate constants %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 14-19 %A G. Peters %A J.H. Wilkinson %T On the stability of Gauss-Jordan elimination with pivoting %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 20-24 %A Garrett Birkhoff %T Two Hadamard numbers for matrices %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 25-29 %A A. van\ der\ Sluis %T Perturbations of eigenvalues of non-normal matrices %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 30-36 %A Marvin Marcus %A Herbert Robinson %T Elementary divisors of tensor products %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 36-39 %A Magnus R. Hestenes %T Pseudoinverses and conjugate gradients %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 40-43 %A Harlan D. Mills %T The new math and computer programming %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 43 %A Tien Chi Chen %A Irving T. Ho %T Storage-efficient representation of decimal data %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 49-52 %A Werner Liniger %T Connections between accuracy and stability properties of linear multistep formulas %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 53-56 %A Richard J. Hanson %T Stably updating mean and standard deviation of data %J Communications of the ACM %K cacm %V 18 %N 1 %D January 1975 %P 57-58 %A G.J. Burnett %A E.G. Coffman,\ Jr. %T Analysis of interleaved memory systems using blockage buffers %J Communications of the ACM %K cacm %V 18 %N 2 %D February 1975 %P 91-95 %A Neil M. Goldman %T Sentence paraphrasing from a conceptual base %J Communications of the ACM %K cacm %V 18 %N 2 %D February 1975 %P 96-106 %A Gordon J. Vandenburg %A Jack Minker %T State-space, problem reduction, and theorem-proving %J Communications of the ACM %K cacm %V 18 %N 2 %D February 1975 %P 107-116 %A Carolyn Kimme %A Dana Ballard %A Jack Sklansky %T Finding circles by an array of accumulators (short communication) %J Communications of the ACM %K cacm %V 18 %N 2 %D February 1975 %P 120-122 %A H.C. Johnston %A C.A.R. Hoare %T Matrix reduction - an efficient method %J Communications of the ACM %K cacm %V 18 %N 3 %D March 1975 %P 141-150 %A Brian W. Kernighan %A Lorinda L. Cherry %T A system for typesetting mathematics %J Communications of the ACM %K cacm %V 18 %N 3 %D March 1975 %P 151-157 %A D.H. Lawrie %A T. Layman %A D. Baer %A J.M. Randal %T Glypnir - a programming language for ILLIAC IV %J Communications of the ACM %K cacm %V 18 %N 3 %D March 1975 %P 157-164 %A Robert W. Floyd %A Ronald L. Rivest %T Expected time bounds for selection %J Communications of the ACM %K cacm %V 18 %N 3 %D March 1975 %P 165-172 %A Richard Alan Karp %T A reply to Gentleman and Marovich %J Communications of the ACM %K cacm %V 18 %N 3 %D March 1975 %P 174 %A Jerry D. Whitt %A A. Gale Sullenberger %T The algorithm sequential access method: an alternative to index sequential (short communication) %J Communications of the ACM %K cacm %V 18 %N 3 %D March 1975 %P 174-176 %A A.M. Erisman %A W.F. Tinney %T On computing certain elements of the inverse of a sparse matrix %J Communications of the ACM %K cacm %V 18 %N 3 %D March 1975 %P 177-179 %A L.F. Shampine %T Discrete least squares polynomial fits %J Communications of the ACM %K cacm %V 18 %N 3 %D March 1975 %P 179-180 %A D.L. Parnas %T On a solution to the cigarette smoker's problem (without conditional statements) %J Communications of the ACM %K cacm %V 18 %N 3 %D March 1975 %P 181-183 %A Jack A. Chambers %A Ray V. Poore %T Computer networks in higher education: socio-economic-political factors %J Communications of the ACM %K cacm %V 18 %N 4 %D April 1975 %P 193-199 %A Graham Smith %T On maintenance of the opportunity list for class-teacher timetable problems %J Communications of the ACM %K cacm %V 18 %N 4 %D April 1975 %P 203-208 %A I.C. Braid %T The synthesis of solids bounded by many faces %J Communications of the ACM %K cacm %V 18 %N 4 %D April 1975 %P 209-216 %A Vladimir Batagelj %T The quadratic hash method when the table size is not a prime number %J Communications of the ACM %K cacm %V 18 %N 4 %D April 1975 %P 216-217 %A Henry S. Warren,\ Jr. %T A modification of Warshall's algorithm for the transitive closure of binary relations %J Communications of the ACM %K cacm %V 18 %N 4 %D April 1975 %P 218-220 %A James A. Hinds %T An algorithm for locating adjacent storage blocks in the buddy system %J Communications of the ACM %K cacm %V 18 %N 4 %D April 1975 %P 221-222 %A Jean G. Vaucher %A Pierre Duval %T A comparison of simulation event list algorithms %J Communications of the ACM %K cacm %V 18 %N 4 %D April 1975 %P 223-230 %A David A. Fisher %T Copying cyclic list structures in linear time using bounded workspace %J Communications of the ACM %K cacm %V 18 %N 5 %D May 1975 %P 251-252 %A Alfonso F. Cardenas %T Analysis and performance of inverted data base structures %J Communications of the ACM %K cacm %V 18 %N 5 %D May 1975 %P 253-263 %A Yorick Wilks %T An intelligent analyzer and understander of English %J Communications of the ACM %K cacm %V 18 %N 5 %D May 1975 %P 264-274 %A D.J. Evans %A M. Hatzopoulos %T A note on the LU factorization of a symmetric matrix (short communication) %J Communications of the ACM %K cacm %V 18 %N 5 %D May 1975 %P 278-279 %A B.L. Fox %T More on the kth shortest paths (short communication) %J Communications of the ACM %K cacm %V 18 %N 5 %D May 1975 %P 279 %A Anthony I. Wasserman %T A problem-list of public policy issues concerning computers and health care (short communication) %J Communications of the ACM %K cacm %V 18 %N 5 %D May 1975 %P 279-280 %A Steven L. Horowitz %T A syntactic algorithm for peak detection in waveforms with applications to cardiography %J Communications of the ACM %K cacm %V 18 %N 5 %D May 1975 %P 281-285 %A Charles E. Pfefferkorn %T A heuristic problem solving design system for equipment or furniture layouts %J Communications of the ACM %K cacm %V 18 %N 5 %D May 1975 %P 286-297 %A Bui Tuong Phong %T Illumination for computer generated pictures %J Communications of the ACM %K cacm %V 18 %N 6 %D June 1975 %P 311-317 %A V.Y. Lum %A M.E. Senko %A C.P. Wang %A H. Ling %T A cost oriented algorithm for data set allocation in storage hierarchies %J Communications of the ACM %K cacm %V 18 %N 6 %D June 1975 %P 318-322 %A Alan F. Babich %A John Grason %A David L. Parnas %T Significant event simulation %J Communications of the ACM %K cacm %V 18 %N 6 %D June 1975 %P 323-329 %A Robert B.K. Dewar %T Indirect threaded code %J Communications of the ACM %K cacm %V 18 %N 6 %D June 1975 %P 330-331 %A Ben Cranston %A Rick Thomas %T A simplified recombination scheme for the Fibonacci buddy system %J Communications of the ACM %K cacm %V 18 %N 6 %D June 1975 %P 331-322 %A Alfred V. Aho %A Margaret J. Corasick %T Efficient string matching: an aid to bibliographic search %J Communications of the ACM %K cacm %V 18 %N 6 %D June 1975 %P 333-340 %A D.S. Hirschberg %T A linear space algorithm for computing maximal common subsequences %J Communications of the ACM %K cacm %V 18 %N 6 %D June 1975 %P 341-343 %A Stephen Soule %T Addition in an arbitrary base without radix conversion %J Communications of the ACM %K cacm %V 18 %N 6 %D June 1975 %P 344-346 %A L.H. Harper %A T.H. Payne %A J.E. Savage %A E. Straus %T Sorting X+Y (short communication) %J Communications of the ACM %K cacm %V 18 %N 6 %D June 1975 %P 347-349 %A F. Paul Wyman %T Improved event-scanning mechanisms for discrete event simulation %J Communications of the ACM %K cacm %V 18 %N 6 %D June 1975 %P 350-353 %A P.J. Courtois %T Decomposability, instabilities and saturation in multiprogramming systems %J Communications of the ACM %K cacm %V 18 %N 7 %D July 1975 %P 371-377 %A Soren Lauesen %T A large semaphore based operating system %J Communications of the ACM %K cacm %V 18 %N 7 %D July 1975 %P 377-389 %A Naomi Sager %A Ralph Grishman %T The restriction language for computer grammars of natural language %J Communications of the ACM %K cacm %V 18 %N 7 %D July 1975 %P 390-400 %A D.L. Parnas %A D.P. Siewiorek %T Use of the concept of transparency in the design of hierarchically structured systems %J Communications of the ACM %K cacm %V 18 %N 7 %D July 1975 %P 401-408 %A H. Freeman %A R. Shapira %T Determining the minimum-area encasing rectangle for an arbitrary closed curve %J Communications of the ACM %K cacm %V 18 %N 7 %D July 1975 %P 409-413 %A Daniel G. Bobrow %T A note on hash linking %J Communications of the ACM %K cacm %V 18 %N 7 %D July 1975 %P 413-415 %A Richard E. Weber %A Bruce Gilchrist %T Discrimination in the employment of women in the computer industry %J Communications of the ACM %K cacm %V 18 %N 7 %D July 1975 %P 416-418 %A John E. Shore %T On the external storage fragmentation produced by first-fit and best-fit allocation strategies %J Communications of the ACM %K cacm %V 18 %N 8 %D August 1975 %P 433-440 %A A.V. Aho %A S.C. Johnson %A J.D. Ullman %T Deterministic parsing of ambiguous grammars %J Communications of the ACM %K cacm %V 18 %N 8 %D August 1975 %P 441-452 %A Edsger W. Dijkstra %T Guarded commands, indeterminacy and formal derivation of programs %J Communications of the ACM %K cacm %V 18 %N 8 %D August 1975 %P 453-457 %A Ira W. Cotton %T Remark on stably updating mean and starnard deviation of data (short communication) %J Communications of the ACM %K cacm %V 18 %N 8 %D August 1975 %P 458 %A Stuart C. Shapiro %A Stanley C. Kwasny %T Interactive consulting via natural language (short communication) %J Communications of the ACM %K cacm %V 18 %N 8 %D August 1975 %P 459-462 %A Alan Jay Smith %T Comments on a paper by T.C. Chen and I.T. Ho (short communication) %J Communications of the ACM %K cacm %V 18 %N 8 %D August 1975 %P 463 %A Sakti P. Ghosh %T Consecutive storage of relevant records with redundancy %J Communications of the ACM %K cacm %V 18 %N 8 %D August 1975 %P 464-471 %A Leslie Lamport %T Multiple byte processing with fullword instructions %J Communications of the ACM %K cacm %V 18 %N 8 %D August 1975 %P 471-475 %A Keith Shwayder %T Combining decision rules in a decision table %J Communications of the ACM %K cacm %V 18 %N 8 %D August 1975 %P 476-480 %A Guy L. Steele,\ Jr. %T Multiprocessing compactifying garbage collection %J Communications of the ACM %K cacm %V 18 %N 9 %D September 1975 %P 496-508 %A Jon Louis Bentley %T Multidimensional binary search trees used for associative searching %J Communications of the ACM %K cacm %V 18 %N 9 %D September 1975 %P 509-517 %A R. Mark Claudson %T The digital simulation of river plankton dynamics %J Communications of the ACM %K cacm %V 18 %N 9 %D September 1975 %P 517-523 %A William F. Piepmeier %T Optimal balancing of I/O requests to disks %J Communications of the ACM %K cacm %V 18 %N 9 %D September 1975 %P 524-527 %A Ben Wegbreit %T Mechanical program analysis %J Communications of the ACM %K cacm %V 18 %N 9 %D September 1975 %P 528-539 %A Rob Gerritsen %T A preliminary system for the design of DBTG data structures %J Communications of the ACM %K cacm %V 18 %N 10 %D October 1975 %P 551-557 %A Nan C. Shu %A Barron C. Housel %A Vincent Y. Lum %T Convert: a high level translation definition language for data conversion %J Communications of the ACM %K cacm %V 18 %N 10 %D October 1975 %P 557-567 %A John Miles Smith %A Philip Yen-Tang Chang %T Optimizing the performance of a relational algebra database interface %J Communications of the ACM %K cacm %V 18 %N 10 %D October 1975 %P 568-579 %A M.M. Astrahan %A D.D. Chamberlin %T Implementation of a structured English query language %J Communications of the ACM %K cacm %V 18 %N 10 %D October 1975 %P 580-588 %A Fanica Gavril %T Merging with parallel processors %J Communications of the ACM %K cacm %V 18 %N 10 %D October 1975 %P 588-591 %A M. Reiser %A H. Kobayashi %T Horner's rule for the evaluation of general closed queueing networks %J Communications of the ACM %K cacm %V 18 %N 10 %D October 1975 %P 592-593 %A G. Salton %A A. Wong %A C.S. Yang %T A vector space model for automatic indexing %J Communications of the ACM %K cacm %V 18 %N 11 %D November 1975 %P 613-620 %A Raymod F. Boyce %A Donald D. Chamberlin %A W. Frank King,\ III %A Michael M. Hammer %T Specifying queries as relational expressions: the square data sublanguage %J Communications of the ACM %K cacm %V 18 %N 11 %D November 1975 %P 621-628 %A Henry F. Ledgard %A Michael Marcotty %T A genealogy of control structures %J Communications of the ACM %K cacm %V 18 %N 11 %D November 1975 %P 629-639 %A Susan L. Graham %A Steven P. Rhodes %T Practical syntax error recovery %J Communications of the ACM %K cacm %V 18 %N 11 %D November 1975 %P 639-650 %A James R. Betner %A Edward M. Reingold %T Backtrack programming techniques %J Communications of the ACM %K cacm %V 18 %N 11 %D November 1975 %P 651-656 %A Lawrence T. Kou %A C.K. Wong %T A note on the set basis problem related to the compaction of character sets %J Communications of the ACM %K cacm %V 18 %N 11 %D November 1975 %P 656-657 %A Peter Naur %T Programming languages, natural languages, and mathematics %J Communications of the ACM %K cacm %V 18 %N 12 %D December 1975 %P 676-683 %A John B. Goodenough %T Exception handling: issues and proposed notation %J Communications of the ACM %K cacm %V 18 %N 12 %D December 1975 %P 683-696 %A Mehdi Jazayeri %A William F. Ogden %A William C. Rounds %T The intrinsically exponential complexity of the circularity problem for attribute grammars %J Communications of the ACM %K cacm %V 18 %N 12 %D December 1975 %P 697-706 %A Harry B. Hunt,\ III %A Thomas G. Szymanski %A Jeffrey D. Ullman %T On the complexity of LR(k) testing %J Communications of the ACM %K cacm %V 18 %N 12 %D December 1975 %P 707-716 %A Susan L. Graham %A Mark Wegman %T A fast and usually linear algorithm for global flow analysis (abstract only) %J Communications of the ACM %K cacm %V 18 %N 12 %D December 1975 %P 716 %A Richard J. Lipton %T Reduction: a method of proving properties of parallel programs %J Communications of the ACM %K cacm %V 18 %N 12 %D December 1975 %P 717-721 %A J.T. Schwartz %T Automatic data structure choice in a language of very high level %J Communications of the ACM %K cacm %V 18 %N 12 %D December 1975 %P 722-728 %A Leonard Kleinrock %A William E. Naylor %A Holger Opderbeck %T A study of line overhead in the ARPANET %J Communications of the ACM %K cacm %V 19 %N 1 %D January 1976 %P 3-13 %A Neil C. Wilhelm %T An anomaly in disk scheduling: a comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses %J Communications of the ACM %K cacm %V 19 %N 1 %D January 1976 %P 13-17 %A Carson E. Agnew %T On quadratic adaptive routing algorithms %J Communications of the ACM %K cacm %V 19 %N 1 %D January 1976 %P 18-22 %A P.L. Karlton %A S.H. Fuller %A R.E. Scroggs %A E.B. Kaehler %T Performance of height-balanced trees %J Communications of the ACM %K cacm %V 19 %N 1 %D January 1976 %P 23-28 %A J.J. Florentin %T Information reference coding %J Communications of the ACM %K cacm %V 19 %N 1 %D January 1976 %P 29-33 %A Charles R. Litecky %A Gordon B. Davis %T A study of errors, error proneness, and error diagnosis in Cobol %J Communications of the ACM %K cacm %V 19 %N 1 %D January 1976 %P 33-37 %A Gregor V. Bochmann %T Semantics evaluation from left to right %J Communications of the ACM %K cacm %V 19 %N 2 %D February 1976 %P 55-62 %A Ronald Rivest %T On self-organizing sequential search heuristics %J Communications of the ACM %K cacm %V 19 %N 2 %D February 1976 %P 63-67 %A F.M. Ives %T Permutation enumeration: four new permutation algorithms %J Communications of the ACM %K cacm %V 19 %N 2 %D February 1976 %P 68-72 %A Alberto Martelli %T An application of heuristics search methods to edge and contour detection %J Communications of the ACM %K cacm %V 19 %N 2 %D February 1976 %P 73-83 %A Kenneth F. Siler %T A stochastic evaluation model for database organizations in data retrieval systems %J Communications of the ACM %K cacm %V 19 %N 2 %D February 1976 %P 84-95 %A Ronald Fagin %T A counterintuitive example of computer paging %J Communications of the ACM %K cacm %V 19 %N 2 %D February 1976 %P 96-97 %A Ehud Artzy %A James A. Hinds %A Harry J. Saal %T A fast division technique for constant divisors %J Communications of the ACM %K cacm %V 19 %N 2 %D February 1976 %P 98-101 %A Allen Newell %A Herbert A. Simon %T Computer science as empirical enquiry: symbols and search %J Communications of the ACM %K cacm %V 19 %N 3 %D March 1976 %P 113-126 %A Jair M. Babad %A Mario M. Moidano %T Joining policies in a multipriority multiclass batch computer system %J Communications of the ACM %K cacm %V 19 %N 3 %D March 1976 %P 127-136 %A F.E. Allen %A J. Cocke %T A program data flow analysis procedure %J Communications of the ACM %K cacm %V 19 %N 3 %D March 1976 %P 137-147 %A Naftaly Minsky %T Intentional resolution of privacy protection in database systems %J Communications of the ACM %K cacm %V 19 %N 3 %D March 1976 %P 148-159 %A Oliver R. Smoot %T Development of an international system for legal protection of computer programs %J Communications of the ACM %K cacm %V 19 %N 3 %D March 1976 %P 171-174 %A Bennet P. Lientz %T A comparative evaluation of versions of Basic %J Communications of the ACM %K cacm %V 19 %N 4 %D April 1976 %P 175-181 %A J. Raymond %T LG: a language for analytic geometry %J Communications of the ACM %K cacm %V 19 %N 4 %D April 1976 %P 182-187 %A Shmuel Katz %A Zohar Manna %T Logical analysis of programs %J Communications of the ACM %K cacm %V 19 %N 4 %D April 1976 %P 188-206 %Q ACM Committee on self-assessment %T Self-assessment procedure I: three concept categories within the programming skills and techniques area %J Communications of the ACM %K cacm %V 19 %N 5 %D May 1976 %P 229-235 %A Dorothy E. Denning %T A lattice model of secure information flow %J Communications of the ACM %K cacm %V 19 %N 5 %D May 1976 %P 236-243 %A Jonathan K. Millen %T Security kernel validation in practice %J Communications of the ACM %K cacm %V 19 %N 5 %D May 1976 %P 243-250 %A Butler W. Lampson %A Howard E. Sturgis %T Reflections on an operating system design %J Communications of the ACM %K cacm %V 19 %N 5 %D May 1976 %P 251-265 %A A.N. Habermann %A Lawrence Flon %A Lee Cooprider %T Modularization and hierarchy in a family of operating systems %J Communications of the ACM %K cacm %V 19 %N 5 %D May 1976 %P 266-272 %A John H. Howard %T Proving monitors %J Communications of the ACM %K cacm %V 19 %N 5 %D May 1976 %P 273-279 %A Susan Owicki %A David Gries %T Verifying properties of parallel programs: an axiomatic approach %J Communications of the ACM %K cacm %V 19 %N 5 %D May 1976 %P 279-285 %A A. Wayne Madison %A Alan P. Batson %T Characteristics of program localities %J Communications of the ACM %K cacm %V 19 %N 5 %D May 1976 %P 285-294 %A Barton G. Prieve %A R.S. Fabry %T VMIN - an optimal variable-space page replacement algorithm %J Communications of the ACM %K cacm %V 19 %N 5 %D May 1976 %P 295-297 %A Wesley W. Chu %A Holger Opderbeck %T Analysis of the PFF replacement algorithm via a semi-Markov model %J Communications of the ACM %K cacm %V 19 %N 5 %D May 1976 %P 298-304 %A Orrin E. Taulbee %A Sam D. Conte %T Production and employment of Ph.D.'s in computer science %J Communications of the ACM %K cacm %V 19 %N 6 %D June 1976 %P 311-313 %A Dennis Severance %A Ricardo Duhne %T A practitioner's guide to addressing algorithms %J Communications of the ACM %K cacm %V 19 %N 6 %D June 1976 %P 314-326 %A Forest Baskett %A Alan Jay Smith %T Interference in multiprocessor computer systems with interleaved memory %J Communications of the ACM %K cacm %V 19 %N 6 %D June 1976 %P 327-334 %A Gideon Frieder %A Harry J. Saal %T A process for the determination of addresses in variable length addressing %J Communications of the ACM %K cacm %V 19 %N 6 %D June 1976 %P 335-338 %A David S. Wise %T Referencing lists by an edge %J Communications of the ACM %K cacm %V 19 %N 6 %D June 1976 %P 338-342 %A Helmut Schumacher %A Kenneth C. Sevcik %T The synthetic approach to decision table conversion %J Communications of the ACM %K cacm %V 19 %N 6 %D June 1976 %P 343-351 %A Douglas W. Clark %T An efficient list-moving algorithm using constant workspace %J Communications of the ACM %K cacm %V 19 %N 6 %D June 1976 %P 352-354 %A Gary D. Knott %T A numbering system for permutations of combinations (short communication) %J Communications of the ACM %K cacm %V 19 %N 6 %D June 1976 %P 355-356 %A S.D. Conte %A M.H. Halstead %T The technology of computer center machine: a proposed short course for graduate professional programs in computer science or infinite systems %J Communications of the ACM %K cacm %V 19 %N 7 %D July 1976 %P 369-370 %A Robert M. Keller %T Formal verification of parallel programs %J Communications of the ACM %K cacm %V 19 %N 7 %D July 1976 %P 371-384 %A James C. King %T Symbolic execution and program testing %J Communications of the ACM %K cacm %V 19 %N 7 %D July 1976 %P 385-394 %A Robert M. Metcalfe %A David R. Boggs %T Ethernet: distributed packet switching for local computer networks %J Communications of the ACM %K cacm %V 19 %N 7 %D July 1976 %P 395-404 %A Cheng-Wen Cheng %A Jonas Rabin %T Synthesis of decision rules %J Communications of the ACM %K cacm %V 19 %N 7 %D July 1976 %P 404-406 %A George S. Fishman %T Sampling from the gamma distribution on a computer %J Communications of the ACM %K cacm %V 19 %N 7 %D July 1976 %P 407-409 %A Kurt Maly %T Compressed tries %J Communications of the ACM %K cacm %V 19 %N 7 %D July 1976 %P 409-415 %A Warren Burton %T A buddy system variation for disk storage allocation %J Communications of the ACM %K cacm %V 19 %N 7 %D July 1976 %P 416-417 %A Gaston H. Gonnet %T Heaps applied to event driven mechanisms %J Communications of the ACM %K cacm %V 19 %N 7 %D July 1976 %P 417-418 %A John J. Donovan %T Tools and philosophy for software education %J Communications of the ACM %K cacm %V 19 %N 8 %D August 1976 %P 430-436 %A R.D. Tennent %T The denotational semantics of programming languages %J Communications of the ACM %K cacm %V 19 %N 8 %D August 1976 %P 437-453 %A James H. Clark %T Designing surface in 3-D %J Communications of the ACM %K cacm %V 19 %N 8 %D August 1976 %P 454-460 %A Michael A. Harrison %A Walter L. Ruzzo %A Jeffrey D. Ullman %T Protection in operating systems %J Communications of the ACM %K cacm %V 19 %N 8 %D August 1976 %P 461-471 %A D.S. Hirschberg %T An insertion technique for one-sided height-balanced trees %J Communications of the ACM %K cacm %V 19 %N 8 %D August 1976 %P 471-473 %A Philip L. Wadler %T Analysis of an algorithm for real time garbage collection %J Communications of the ACM %K cacm %V 19 %N 9 %D September 1976 %P 491-500 %A Chee K. Yap %T New upper bounds for selection %J Communications of the ACM %K cacm %V 19 %N 9 %D September 1976 %P 501-508 %A Michael C. Loui %T Weighted derivation trees %J Communications of the ACM %K cacm %V 19 %N 9 %D September 1976 %P 509-513 %A Kenneth G. Walter %T Recursion analysis for compiler optimization %J Communications of the ACM %K cacm %V 19 %N 9 %D September 1976 %P 514-516 %A James R. Bitner %A Gideon Erlich %A Edward M. Reingold %T Efficient generation of the binary reflected Gray code and its applications %J Communications of the ACM %K cacm %V 19 %N 9 %D September 1976 %P 517-521 %A L. Peter Deutsch %A Daniel G. Bobrow %T An efficient, incremental, automatic garbage collector %J Communications of the ACM %K cacm %V 19 %N 9 %D September 1976 %P 522-526 %A Ben Wegbreit %T Faster retrieval from contexts %J Communications of the ACM %K cacm %V 19 %N 9 %D September 1976 %P 526-529 %A James F. Blinn %A Martin E. Newell %T Texture and reflection in computer generated images %J Communications of the ACM %K cacm %V 19 %N 10 %D October 1976 %P 542-547 %A James H. Clark %T Hierarchical geometric models for visible surface algorithms %J Communications of the ACM %K cacm %V 19 %N 10 %D October 1976 %P 547-554 %A Joshua Levin %T A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces %J Communications of the ACM %K cacm %V 19 %N 10 %D October 1976 %P 555-563 %A N. Burtnyk %A M. Wein %T Interactive selection techniques for enhancing motion dynamics in key frame automation %J Communications of the ACM %K cacm %V 19 %N 10 %D October 1976 %P 564-569 %A James W. Frane %T The BMD and BMDP series of statistical computer programs %J Communications of the ACM %K cacm %V 19 %N 10 %D October 1976 %P 570-576 %A C. Duong-Kien %A H.-J. Hoffmann %A D. Muth %T An improvement to Martin's algorithm for computation of linear precedence functions %J Communications of the ACM %K cacm %V 19 %N 10 %D October 1976 %P 576-577 %A Richard G. Montanelli %A Sandra A. Mamrak %T The status of women and minorities in academic computer science %J Communications of the ACM %K cacm %V 19 %N 10 %D October 1976 %P 578-581 %A Douglas T. Ross %T Homilies for humble standards %J Communications of the ACM %K cacm %V 19 %N 11 %D November 1976 %P 595-600 %A Henry F. Ledgard %A William C. Cave %T Cobol under control %J Communications of the ACM %K cacm %V 19 %N 11 %D November 1976 %P 601-608 %A Thomas R. Wilcox %A Alan M. Davis %A Michael H. Tindall %T The design and implementation of a table driven, interactive diagnostic programming system %J Communications of the ACM %K cacm %V 19 %N 11 %D November 1976 %P 609-616 %A Frank Rubin %T Experiments in text file compression %J Communications of the ACM %K cacm %V 19 %N 11 %D November 1976 %P 617-523 %A K.P. Eswaran %A J.N. Gray %A R.A. Lorie %A I.L. Traiger %T The notions of consistency and predicate locks in a database system %J Communications of the ACM %K cacm %V 19 %N 11 %D November 1976 %P 624-633 %A K. Maruyama %A S.E. Smith %T Optimal reorganization of distributed space disk files %J Communications of the ACM %K cacm %V 19 %N 11 %D November 1976 %P 634-642 %A Richard G. Hamlet %T High-level binding with low-level linkers %J Communications of the ACM %K cacm %V 19 %N 11 %D November 1976 %P 642-644 %A Jean E. Sammet %T Roster of programming languages for 1974-1975 %J Communications of the ACM %K cacm %V 19 %N 12 %D December 1976 %P 655-669 %A Bruce W. Arden %T The computer science and engineering research study (COSERS) %J Communications of the ACM %K cacm %V 19 %N 12 %D December 1976 %P 670-673 %A J.F. Nunamaker %A Benn R. Konsynski,\ Jr. %A Thomas Ho %A Carl Singer %T Computer-aided analysis and design of infinite systems %J Communications of the ACM %K cacm %V 19 %N 12 %D December 1976 %P 674-687 %A George Stockman %A Laveen Kanal %A M.C. Kyle %T Structural pattern recognition of carotid pulse waves using a general waveform parsing system %J Communications of the ACM %K cacm %V 19 %N 12 %D December 1976 %P 688-695 %A Allen Van\ Gelder %T Structured programming in Cobol: an approach for application programmers %J Communications of the ACM %K cacm %V 20 %N 1 %D January 1977 %P 2-12 %A Richard H. Austing %A Bruce H. Barnes %A Gerald L. Engel %T A survey of the literature in computer science education since Curriculum '68 %J Communications of the ACM %K cacm %V 20 %N 1 %D January 1977 %P 13-21 %A Jair M. Babad %T A record and file partitioning model %J Communications of the ACM %K cacm %V 20 %N 1 %D January 1977 %P 22-31 %A Albert L. Zobrist %A Frederick R. Carlson,\ Jr. %T Detection of combined occurrences %J Communications of the ACM %K cacm %V 20 %N 1 %D January 1977 %P 31-35 %A A.P. Batson %A R.E. Brundage %T Segment sizes and lifetimes in ALGOL 60 programs %J Communications of the ACM %K cacm %V 20 %N 1 %D January 1977 %P 36-44 %A Mervin E. Muller %T An approach to multidimensional data array processing by computer %J Communications of the ACM %K cacm %V 20 %N 2 %D February 1977 %P 63-77 %A Douglas W. Clark %A C. Cordell Green %T An empirical study of list structure in LISP %J Communications of the ACM %K cacm %V 20 %N 2 %D February 1977 %P 78-87 %A F.P. Preparata %A S.J. Hong %T Convex hulls of finite sets of points in two and three dimensions %J Communications of the ACM %K cacm %V 20 %N 2 %D February 1977 %P 87-93 %A M.C. Easton %A B.T. Bennett %T Transient-free working set statistics %J Communications of the ACM %K cacm %V 20 %N 2 %D February 1977 %P 93-99 %A Jack Bresenham %T A linear algorithm for incremental digital display of circular arcs %J Communications of the ACM %K cacm %V 20 %N 2 %D February 1977 %P 100-106 %A Thoddi C.T. Kotiah %A David I. Steinberg %T Occurrences of cycling and other phenomena arising in a class of linear programming models %J Communications of the ACM %K cacm %V 20 %N 2 %D February 1977 %P 107-112 %A Gary D. Knott %T A numbering system for binary trees (short communication) %J Communications of the ACM %K cacm %V 20 %N 2 %D February 1977 %P 113-115 %A Philip Clapson %T Improving the access time for random access files %J Communications of the ACM %K cacm %V 20 %N 3 %D March 1977 %P 127-135 %A C.T. Yu %A G. Salton %T Effective information retrieval using term accuracy %J Communications of the ACM %K cacm %V 20 %N 3 %D March 1977 %P 135-142 %A Amund Lunde %T Empirical evaluation of some features of instruction set processor architectures %J Communications of the ACM %K cacm %V 20 %N 3 %D March 1977 %P 143-153 %A R.M. Brown %A J.C. Browne %A K.M. Chandy %T Memory management and response time %J Communications of the ACM %K cacm %V 20 %N 3 %D March 1977 %P 153-165 %A Warren Burton %T Representation of many-sided polygons and polygonal lines for rapid processing %J Communications of the ACM %K cacm %V 20 %N 3 %D March 1977 %P 166-171 %A H.B. Hunt,\ III %A T.G. Szymanski %A J.D. Ullman %T Operations on sparse relations %J Communications of the ACM %K cacm %V 20 %N 3 %D March 1977 %P 171-176 %A Richard L. Nolan %T Effects of chargeout on user/manager attitudes %J Communications of the ACM %K cacm %V 20 %N 3 %D March 1977 %P 177-185 %A Israel Borovits %A Phillip Ein-dor %T Cost/utilization: a measure of system performance %J Communications of the ACM %K cacm %V 20 %N 3 %D March 1977 %P 185-191 %A Carter Bays %T A comparison of next-fit, first-fit and best-fit (short communication) %J Communications of the ACM %K cacm %V 20 %N 3 %D March 1977 %P 191-192 %A Eberhard Bertsch %T The storage requirement in precedence parsing (short communication) %J Communications of the ACM %K cacm %V 20 %N 3 %D March 1977 %P 192-194 %A James H. Morris,\ Jr. %A Ben Wegbreit %T Subgoal induction %J Communications of the ACM %K cacm %V 20 %N 4 %D April 1977 %P 209-222 %A Steven L. Tanimoto %A Theodosios Pavlidis %T The editing of picture segmentations using local analysis of graphs %J Communications of the ACM %K cacm %V 20 %N 4 %D April 1977 %P 223-229 %A Nicholas V. Findler %T Studies in machine cognition using the game of poker %J Communications of the ACM %K cacm %V 20 %N 4 %D April 1977 %P 230-245 %A K. Maruyama %A S.E. Smith %T Analysis of design alternatives for virtual memory indexes %J Communications of the ACM %K cacm %V 20 %N 4 %D April 1977 %P 245-254 %A Henry C. Lucas,\ Jr. %A Jimmy A. Sutton %T The stage hypothesis and the S-curve: some contradictory evidence %J Communications of the ACM %K cacm %V 20 %N 4 %D April 1977 %P 254-259 %A S.B. Yao %T Approximating block accesses in database organizations (short communication) %J Communications of the ACM %K cacm %V 20 %N 4 %D April 1977 %P 260-261 %A Clifford R. Hollander %T Remark on uniform insertion in structured data structures (short communication) %J Communications of the ACM %K cacm %V 20 %N 4 %D April 1977 %P 261-262 %A S.K. Bandyopahyay %T Comment on weighted increment linear search for scatter tables %J Communications of the ACM %K cacm %V 20 %N 4 %D April 1977 %P 262-263 %A C.D. Thompson %A H.T. Kung %T Sorting on a mesh-connected parallel computer %J Communications of the ACM %K cacm %V 20 %N 4 %D April 1977 %P 263-271 %A Lawrence Robinson %A Karl N. Levitt %T Proof techniques for hierarchically structured programs %J Communications of the ACM %K cacm %V 20 %N 4 %D April 1977 %P 271-283 %Q ACM Committee on self-assessment %T Self-assessment procedure II: system organization and control and information representation, handling and manipulation %J Communications of the ACM %K cacm %V 20 %N 5 %D May 1977 %P 297-300 %A R.C. Holt %A D.B. Wortman %A D.T. Barnard %A J.R. Cordy %T SP/k: a system for teaching computer programming %J Communications of the ACM %K cacm %V 20 %N 5 %D May 1977 %P 301-309 %A George S. Fishman %T Achieving accuracy in simulation output analysis %J Communications of the ACM %K cacm %V 20 %N 5 %D May 1977 %P 310-315 %A Howard L. Morgan %A K. Dan Levin %T Optimal program and data locations in computer networks %J Communications of the ACM %K cacm %V 20 %N 5 %D May 1977 %P 315-322 %A J.-L. Baer %A B. Schwab %T A comparison of tree-balancing algorithms %J Communications of the ACM %K cacm %V 20 %N 5 %D May 1977 %P 322-330 %A Neil J. Stillman %A P. Bruce Berra %T A comparison of hardware and software associative memories in the context of computer graphics %J Communications of the ACM %K cacm %V 20 %N 5 %D May 1977 %P 331-339 %A Marvin Shapiro %T The choice of reference points in best match file searching %J Communications of the ACM %K cacm %V 20 %N 5 %D May 1977 %P 339-343 %A Michael Z. Hanani %T An optimal evaluation of boolean expressions in an online query system (short communication) %J Communications of the ACM %K cacm %V 20 %N 5 %D May 1977 %P 344-347 %A Y. Milman %T Ab approach to optimal design of storage parameters in databases (short communication) %J Communications of the ACM %K cacm %V 20 %N 5 %D May 1977 %P 347-350 %A James W. Hunt %A Thomas G. Szymanski %T A fast algorithm for computing longest common subsequences %J Communications of the ACM %K cacm %V 20 %N 5 %D May 1977 %P 350-353 %A Orrin E. Taulbee %A S.D. Conte %T Production and employment of Ph.D.'s in computer science - 1976 %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 370-372 %A Ben Schneiderman %A Richard Mayer %A Don McKay %A Peter Heller %T Experimental investigations of the utility of detailed flowcharts in programming %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 373-381 %A Henry F. Ledgard %A Robert W. Taylor %T Two views of data abstraction %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 382-384 %A Moshe M. Zloof %A S. Peter de\ Jong %T A system for business automation (SBA): programming language %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 385-396 %A John Guttag %T Abstract data types and the development of data structures %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 396-404 %A John Miles Smith %A Diane C.P. Smith %T Database abstractions: aggregation %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 405-413 %A David Gries %A Narain Gehani %T Some ideas on data types in high-level languages %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 414-420 %A James L. Peterson %A Theodore A. Norman %T Buddy systems %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 421-431 %A J.M. Robson %T A bounded storage algorithm for copying cyclic structures %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 431-433 %A R.S. Bird %T Notes on recursion elimination %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 434-439 %A Henry S. Warren,\ Jr. %T Functions realizable with word-parallel logical and two's complement addition instructions (short communication) %J Communications of the ACM %K cacm %V 20 %N 6 %D June 1977 %P 439-441 %A Sandra A. Mamrak %T Dynamic response time prediction for computer networks %J Communications of the ACM %K cacm %V 20 %N 7 %D July 1977 %P 461-468 %A Manfred Ruschitzka %A R.S. Fabry %T A unifying approach to scheduling %J Communications of the ACM %K cacm %V 20 %N 7 %D July 1977 %P 469-477 %A William D.Tajibnapis %T A correctness proof of a topology information maintenance protocol for a distributed computer network %J Communications of the ACM %K cacm %V 20 %N 7 %D July 1977 %P 477-485 %A Paul G. Heckel %A Butler W. Lampson %T A terminal-oriented communication system %J Communications of the ACM %K cacm %V 20 %N 7 %D July 1977 %P 486-494 %A Ben Ross Schneider,\ Jr. %A Reid M. Watts %T SITAR: an interactive text processing system for small computers %J Communications of the ACM %K cacm %V 20 %N 7 %D July 1977 %P 495-499 %A J.L.W. Kessels %T An alternative to event queues for synchronization in monitors %J Communications of the ACM %K cacm %V 20 %N 7 %D July 1977 %P 500-503 %A Dorothy E. Denning %A Peter J. Denning %T Certification of programs for secure information flow %J Communications of the ACM %K cacm %V 20 %N 7 %D July 1977 %P 504-513 %A Jeffrey M. Barth %T Shifting garbage collection overhead to compile time %J Communications of the ACM %K cacm %V 20 %N 7 %D July 1977 %P 513-518 %A E.A. Ashcroft %A W.W. Wadge %T LUCID, a nonprocedural language with iteration %J Communications of the ACM %K cacm %V 20 %N 7 %D July 1977 %P 519-526 %A J. Nevil Brownlee %T An ALGOL-based implementation of SNOBOL4 patterns (short communication) %J Communications of the ACM %K cacm %V 20 %N 7 %D July 1977 %P 527-529 %A Charles M. Geschke %A James H. Morris,\ Jr. %A Edwin H. Satterwaite %T Early experience with Mesa %J Communications of the ACM %K cacm %V 20 %N 8 %D August 1977 %P 540-553 %A Mary Shaw %A William A. Wulf %A Ralph L. London %T Abstraction and verification in Alphard: defining and specifying iteration and generators %J Communications of the ACM %K cacm %V 20 %N 8 %D August 1977 %P 553-564 %A Barbara Liskov %A Alan Snyder %A Russell Atkinson %A Craig Schaffert %T Abstraction mechanisms in CLU %J Communications of the ACM %K cacm %V 20 %N 8 %D August 1977 %P 564-576 %A Niklaus Wirth %T Toward a discipline of real-time programming %J Communications of the ACM %K cacm %V 20 %N 8 %D August 1977 %P 577-583 %A J.D. Gannon %T An experimental evaluation of data type conventions %J Communications of the ACM %K cacm %V 20 %N 8 %D August 1977 %P 584-595 %A W.R. Franta %A Kurt Maly %T An efficient data structure for the simulation event set %J Communications of the ACM %K cacm %V 20 %N 8 %D August 1977 %P 596-602 %A Eugene L. Lawler %T Comment on computing the k shortest paths in a graph (short communication) %J Communications of the ACM %K cacm %V 20 %N 8 %D August 1977 %P 603-604 %A Nissim Francez %T Another advantage of keyboard notation for parameter communication with subprograms (short communication) %J Communications of the ACM %K cacm %V 20 %N 8 %D August 1977 %P 604-605 %Q ACM Committee on self-assessment %T Self-assessment procedure III: internal sorting %J Communications of the ACM %K cacm %V 20 %N 9 %D September 1977 %P 621-624 %A Michael O. Rabin %T Complexity of computations %J Communications of the ACM %K cacm %V 20 %N 9 %D September 1977 %P 625-633 %A Dana S. Scott %T Logic and programming languages %J Communications of the ACM %K cacm %V 20 %N 9 %D September 1977 %P 634-641 %A Richard H. Austing %T The GRE advanced test in computer science %J Communications of the ACM %K cacm %V 20 %N 9 %D September 1977 %P 642-645 %A Robert W. Scheifler %T An analysis of inline substitution for a structured programming language %J Communications of the ACM %K cacm %V 20 %N 9 %D September 1977 %P 647-654 %A David K. Gifford %T Hardware estimation of a process' primary memory requirements %J Communications of the ACM %K cacm %V 20 %N 9 %D September 1977 %P 655-663 %A Harry G. Mairson %T Some new upper bounds for the generation of prime numbers %J Communications of the ACM %K cacm %V 20 %N 9 %D September 1977 %P 664-669 %A Edward M. McCreight %T Pagination of B*-trees with variable length records %J Communications of the ACM %K cacm %V 20 %N 9 %D September 1977 %P 670-674 %A H. Fuchs %A Z.M. Kedem %A S.P. Uselton %T Optimal surface reconstruction from planar contours %J Communications of the ACM %K cacm %V 20 %N 10 %D October 1977 %P 693-702 %A Sheng-Chuan Wu %A John F. Abel %A Donald P. Greenberg %T An interactive computer graphics approach to surface representation %J Communications of the ACM %K cacm %V 20 %N 10 %D October 1977 %P 703-712 %A Barry K. Rosen %T High-level data flow analysis %J Communications of the ACM %K cacm %V 20 %N 10 %D October 1977 %P 712-724 %A C. Montanegro %A G. Pacini %A F. Turini %T Two-level control structure for nondeterministic programming %J Communications of the ACM %K cacm %V 20 %N 10 %D October 1977 %P 725-730 %A Wilf R. LaLonde %T Regular right part grammars and their parses %J Communications of the ACM %K cacm %V 20 %N 10 %D October 1977 %P 731-741 %A R. Devillers %T Game interpretation of the deadlock avoidance problem %J Communications of the ACM %K cacm %V 20 %N 10 %D October 1977 %P 741-745 %A Evan L. Ivie %T The programmer's workbench - a machine for software development %J Communications of the ACM %K cacm %V 20 %N 10 %D October 1977 %P 746-753 %A Alan Jay Smith %T Multiprocessor memory organization and memory interference %J Communications of the ACM %K cacm %V 20 %N 10 %D October 1977 %P 754-761 %A Robert S. Boyer %A J. Strother Moore %T A fast string searching algorithm %J Communications of the ACM %K cacm %V 20 %N 10 %D October 1977 %P 762-772 %A John A.N. Lee %T Considerations for future programming language standards activities %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 788-794 %A Rollins Turner %A Bill Strecker %T Use of the LRU stack depth distribution for simulation of paging behaviour %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 795-798 %A Franklin C. Crow %T The aliasing problem in computer-generated shaded images %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 799-805 %A Leslie Lamport %T Concurrent reading and writing %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 806-811 %A John E. Shore %T Anomalous behavior of the fifty-percent rule in dynamic memory allocation %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 812-820 %A G.C. Stockman %A A.K. Agrawala %T Equivalence of Hough curve detection to template matching (short communication) %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 820-822 %A Niklaus Wirth %T What can we do about the unnecessary diversity of notation for syntactic definitions (short communication) %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 822-823 %A Mohit Kumar Roy %T A note on reflection-free permutation enumeration (short communication) %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 823 %A Zohar Manna %A Adi Shamir %T The optimal approach to recursive programs %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 824-831 %A Michael Hammer %A W. Gerry Howe %A Vincent J. Kruskal %A Irving Wladawsky %T A very high level programming language for data processing applications %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 832-840 %A Renzo Sprugnoli %T Perfect hashing functions: a single probe retrieving method for static sets %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 841-850 %A John Cocke %A Ken Kennedy %T An algorithm for reduction of operator strength %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 850-856 %A R.S. Bird %T Improving programs by the introduction of recursion %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 856-863 %A Norman R. Nielsen %T Dynamic memory allocation in computer simulation %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 864-873 %A Micahel W. Blasgen %A Richard G. Casey %A Kapali P. Eswaran %T An encoding method for multifield sorting and indexing %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 874-878 %A Enrique Grapa %A Geneva G. Belford %T Some theorems to aid in solving the file allocation problem %J Communications of the ACM %K cacm %V 20 %N 11 %D November 1977 %P 878-882 %A A.A. Lopez %A Robert Raymond %A Robert Tardiff %T A survey of computer science offerings in small liberal arts colleges %J Communications of the ACM %K cacm %V 20 %N 12 %D December 1977 %P 902-906 %A J.L.W. Kessels %T A conceptual framework for a nonprocedural programming language %J Communications of the ACM %K cacm %V 20 %N 12 %D December 1977 %P 906-913 %A J. Lawrence Carter %T A case study of a new code generation technique for compilers %J Communications of the ACM %K cacm %V 20 %N 12 %D December 1977 %P 914-920 %A David Gries %T An exercise in proving parallel programs correct %J Communications of the ACM %K cacm %V 20 %N 12 %D December 1977 %P 921-930 %A Irene Greif %T A language for formal problem specification %J Communications of the ACM %K cacm %V 20 %N 12 %D December 1977 %P 931-935 %A Marchall D. Abrams %A Siegfried Treu %T A methodology for interactive computer service measurement %J Communications of the ACM %K cacm %V 20 %N 12 %D December 1977 %P 936-944 %A James N. Danzinger %A William H. Dutton %T Computers as an innovation in American local governments %J Communications of the ACM %K cacm %V 20 %N 12 %D December 1977 %P 950-956 %A S.H. Lavington %T The Manchester Mark I and Atlas: a historical perspective %J Communications of the ACM %K cacm %V 21 %N 1 %D January 1978 %P 4-12 %A R.N. Ibbett %A P.C. Capon %T The development of the MU5 computer system %J Communications of the ACM %K cacm %V 21 %N 1 %D January 1978 %P 13-24 %A B.R. Borgerson %A M.L. Hanson %A P.A. Hartley %T The evolution of the Sperry Univac 1100 series: a history, analysis and projection %J Communications of the ACM %K cacm %V 21 %N 1 %D January 1978 %P 25-43 %A C. Gordon Bell %A A. Kotok %A T.N. Hastings %A R. Hill %T The evolution of the DECsystem 10 %J Communications of the ACM %K cacm %V 21 %N 1 %D January 1978 %P 44-63 %A Richard M. Russell %T The Cray-1 computer system %J Communications of the ACM %K cacm %V 21 %N 1 %D January 1978 %P 63-72 %A Richard P. Case %A Andris Padegs %T Architecture of the IBM System/370 %J Communications of the ACM %K cacm %V 21 %N 1 %D January 1978 %P 73-96 %Q ACM Committee on self-assessment %T Self-assessment procedure IV: program development methods, data integrity, and file organization and processing %J Communications of the ACM %K cacm %V 21 %N 2 %D February 1978 %P 111-114 %A Sandra A. Mamrak %A Richard G. Montanelli,\ Jr. %T Computer science faculties: the current status of minorities and women %J Communications of the ACM %K cacm %V 21 %N 2 %D February 1978 %P 115-119 %A R.L. Rivert %A A. Shamir %A L. Adleman %T A method for obtaining digital signatures and public-key cryptosystems %J Communications of the ACM %K cacm %V 21 %N 2 %D February 1978 %P 120-126 %A M.A. Auslander %A H.R. Strong %T Systematic recursion removal %J Communications of the ACM %K cacm %V 21 %N 2 %D February 1978 %P 127-134 %A L.T. Kou %A L.J. Stockmeyer %A C.K. Wong %T Covering edges by cliques with regard to keyword conflicts and intersection graphs %J Communications of the ACM %K cacm %V 21 %N 2 %D February 1978 %P 135-138 %A Gerald Held %A Michael Stonebraker %T B-trees reexamined %J Communications of the ACM %K cacm %V 21 %N 2 %D February 1978 %P 139-143 %A William J. Stewart %T A comparison of numerical techniques in Markov modeling %J Communications of the ACM %K cacm %V 21 %N 2 %D February 1978 %P 144-152 %A Gabor T. Herman %A Arnold Lent %A Peter H. Lutz %T Relaxation methods for image reconstruction %J Communications of the ACM %K cacm %V 21 %N 2 %D February 1978 %P 152-158 %A Zohar Manna %A Richard Waldinger %T Is "sometime" sometimes better than "always" ? %J Communications of the ACM %K cacm %V 21 %N 2 %D February 1978 %P 159-172 %A Bruce J. Schachter %A Azriel Rosenfeld %T Some new methods of detecting step edges in digital pictures %J Communications of the ACM %K cacm %V 21 %N 2 %D February 1978 %P 172-176 %A Henry C. Lucas,\ Jr. %T The use of an interactive information storage and retrieval system in medical research %J Communications of the ACM %K cacm %V 21 %N 3 %D March 1978 %P 197-205 %A Wlliam H. Dutton %A Kenneth L. Kraemer %T Management utilization of computers in American local governments %J Communications of the ACM %K cacm %V 21 %N 3 %D March 1978 %P 206-218 %A Ronald E. Anderson %T Value orientation of computer science students %J Communications of the ACM %K cacm %V 21 %N 3 %D March 1978 %P 219-225 %A S. Rao Kossaraju %T Insertions and deletions in one-sided height-balanced trees %J Communications of the ACM %K cacm %V 21 %N 3 %D March 1978 %P 226-227 %A Riachrd A. DeMillo %A Stanley C. Eistenstat %A Richard J. Lipton %T Preserving average proximity in arrays %J Communications of the ACM %K cacm %V 21 %N 3 %P 228-231 %D March 1978 %A M.A. Franklin %A G. Scott Graham %A R.K. Gupta %T Anomalies with variable partition paging algorithms %J Communications of the ACM %K cacm %V 21 %N 3 %D March 1978 %P 232-236 %A Andrew S. Tanenbaum %T Implications of sructured programming for machine architecture %J Communications of the ACM %K cacm %V 21 %N 3 %D March 1978 %P 237-246 %A W.H. Payne %A K.L. McMillen %T Orderly enumeration of nonsingular binary matrices applied to text encryption %J Communications of the ACM %K cacm %V 21 %N 4 %D April 1978 %P 259-263 %A Paul Heckel %T A technique for isolating differences between files %J Communications of the ACM %K cacm %V 21 %N 4 %D April 1978 %P 264-268 %A Art Lew %T Optimal conversion of extended-entry decision tables with general cost criteria %J Communications of the ACM %K cacm %V 21 %N 4 %D April 1978 %P 269-279 %A Henry G. Baker,\ Jr. %T List processing in real time on a serial computer %J Communications of the ACM %K cacm %V 21 %N 4 %D April 1978 %P 280-294 %A Ralph C. Merkle %T Secure communications over insecure channels %J Communications of the ACM %K cacm %V 21 %N 4 %D April 1978 %P 294-299 %A Thomas G. Szymanski %T Assembling code for machines with span-dependent instructions %J Communications of the ACM %K cacm %V 21 %N 4 %D April 1978 %P 300-308 %A Jean Vuillemin %T A data structure for manipulating priority queues %J Communications of the ACM %K cacm %V 21 %N 4 %D April 1978 %P 309-315 %A S. Even %A M. Rodeh %T Economical encoding of commas between strings %J Communications of the ACM %K cacm %V 21 %N 4 %D April 1978 %P 315-317 %A R.C.H. Cheng %T Generating beta variates with nonintegral shape parameters %J Communications of the ACM %K cacm %V 21 %N 4 %D April 1978 %P 317-322 %A Douglas W. Clark %T A fast algorithm for copying list structures %J Communications of the ACM %K cacm %V 21 %N 5 %D May 1978 %P 351-357 %A Anita K. Jones %A Barbara H. Liskov %T A language extension for expressing constraints on data access %J Communications of the ACM %K cacm %V 21 %N 5 %D May 1978 %P 358-367 %A Matthew Geller %T Test data as an aid in proving program correctness %J Communications of the ACM %K cacm %V 21 %N 5 %D May 1978 %P 368-375 %A James R. Low %T Automatic data structure selection: an example and overview %J Communications of the ACM %K cacm %V 21 %N 5 %D May 1978 %P 376-385 %A Michael Karr %A David B. Loveman,\ III %T Incorporation of units into programming languages %J Communications of the ACM %K cacm %V 21 %N 5 %D May 1978 %P 385-391 %A David R. Hanson %A Ralph E. Griswold %T The SL5 procedure mechanism %J Communications of the ACM %K cacm %V 21 %N 5 %D May 1978 %P 392-400 %A Frederick Hayes-Roth %A John McDermott %T An interference matching technique for inducing abstractions %J Communications of the ACM %K cacm %V 21 %N 5 %D May 1978 %P 401-411 %A J.M. Fleischer %A R.R. Meyer %T New sufficient optimality conditions for integer programming and its applications %J Communications of the ACM %K cacm %V 21 %N 5 %D May 1978 %P 411-418 %A Pandu R. Tadikamalla %T Computer generation of gamma random variables %J Communications of the ACM %K cacm %V 21 %N 5 %D May 1978 %P 419-422 %A Richard L. Sites %T Optimal shift strategy for a block-transfer CCD memory %J Communications of the ACM %K cacm %V 21 %N 5 %D May 1978 %P 423-425 %A S.H. Zweben %A M.A. McDonald %T An optimal method for deletions in one-sided height-balanced trees %J Communications of the ACM %K cacm %V 21 %N 6 %D June 1978 %P 441-445 %A James R. Driscoll %A Y. Edmund Lien %T A selective traversal algorithm for binary search trees %J Communications of the ACM %K cacm %V 21 %N 6 %D June 1978 %P 445-447 %A Jacques Cohen %A Martin S. Roth %T Analyses of deterministic parsing algorithms %J Communications of the ACM %K cacm %V 21 %N 6 %D June 1978 %P 448-458 %A M. Dennis Mickunas %A John A. Modry %T Automatic error recovery for LR parsers %J Communications of the ACM %K cacm %V 21 %N 6 %D June 1978 %P 459-465 %A B.P. Lientz %A E.B. Swanson %A G.E. Tompkins %T Characterization of application software maintenance %J Communications of the ACM %K cacm %V 21 %N 6 %D June 1978 %P 466-471 %A Earl Chrysler %T Some basic determinants of computer programming productivity %J Communications of the ACM %K cacm %V 21 %N 6 %D June 1978 %P 472-483 %A Rob Kling %T Automated welfare client-tracking and service integration: the political economy of computing %J Communications of the ACM %K cacm %V 21 %N 6 %D June 1978 %P 484-493 %A E. Gelenbe %A D. Derochette %T Performance of rollback recovery systems under intermittent failures %J Communications of the ACM %K cacm %V 21 %N 6 %D June 1978 %P 493-499 %A Toby J. Teorey %T General equations for idealized CPU-I/O overlap configurations %J Communications of the ACM %K cacm %V 21 %N 6 %D June 1978 %P 500-507 %A David L. Waltz %T An English language question answering system for a large relational database %J Communications of the ACM %K cacm %V 21 %N 7 %D July 1978 %P 526-539 %A Michael L. Fredman %A Bruce Weide %T On the complexity of computing the measure of union(Ai, Bi) %J Communications of the ACM %K cacm %V 21 %N 7 %D July 1978 %P 540-544 %A Francis Y. Chin %T An O(n) algorithm for determining the near-optimal computation order of matrix chain products %J Communications of the ACM %K cacm %V 21 %N 7 %D July 1978 %P 544-549 %A Yehoshua Perl %A Alon Itai %A Haim Avni %T Interpolation search - a log logn search %J Communications of the ACM %K cacm %V 21 %N 7 %D July 1978 %P 550-553 %A Constantine Halatsis %A George Philokyprou %T Pseudochaining in hash tables %J Communications of the ACM %K cacm %V 21 %N 7 %D July 1978 %P 554-557 %A Leslie Lamport %T Time, clocks, and the ordering of events in a distributed system %J Communications of the ACM %K cacm %V 21 %N 7 %D July 1978 %P 558-565 %A Henry G. Baker,\ Jr. %T Shallow binding in LISP 1.5 %J Communications of the ACM %K cacm %V 21 %N 7 %D July 1978 %P 565-569 %A Hanan Samet %T Proving the correctness of heuristically optimized code %J Communications of the ACM %K cacm %V 21 %N 7 %D July 1978 %P 570-782 %A Robert E. Shostak %T An algorithm fo reasoning about equality %J Communications of the ACM %K cacm %V 21 %N 7 %D July 1978 %P 583-585 %A Rahul Chattergy %A Udo W. Pooch %T Analysis of the availability of computer systems using computer-aided algebra %J Communications of the ACM %K cacm %V 21 %N 7 %D July 1978 %P 586-591 %A John Backus %T Can programming be liberated from the von Neumann style ? a functional style and its algebra of programs %J Communications of the ACM %K cacm %V 21 %N 8 %D August 1978 %P 613-641 %A Rob Kling %T Value conflicts and social choice in electronic funds transfer system developments %J Communications of the ACM %K cacm %V 21 %N 8 %D August 1978 %P 642-657 %A D.S. Hirschberg %T Fast parallel sorting algorithms %J Communications of the ACM %K cacm %V 21 %N 8 %D August 1978 %P 657-661 %A F. Lockwood Morris %T A time- and space-efficient garbage compaction algorithm %J Communications of the ACM %K cacm %V 21 %N 8 %D August 1978 %P 662-665 %A C.A.R. Hoare %T Communicating sequential processes %J Communications of the ACM %K cacm %V 21 %N 8 %D August 1978 %P 666-677 %A Richard S. Brice %A J.C. Browne %T Feedback coupled resource allocation policies in the multiprogramming-multiprocessor computer system %J Communications of the ACM %K cacm %V 21 %N 8 %D August 1978 %P 678-686 %A Peter Scheuermann %A C. Robert Carlson %T Self-assessment procedure V: database systems %J Communications of the ACM %K cacm %V 21 %N 8 %D August 1978 %P 687-693 %A R.A. Harris %A J.D. Zund %T An algorithm using symbolic techniques for the Bel-Petrov classification of gravitational fields %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 715-717 %A H.D. Schwetman %T Hybrid simulation models of computer systems %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 718-723 %A Jeffrey M. Barth %T A practical interprocedural data-flow analysis algorithm %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 724-736 %A Gerald J. Popek %A David A. Farber %T A model for verification of data security in operating systems %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 737-749 %A Peter J. Denning %A Donald R. Slutz %T Generalized working sets for segment reference strings %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 750-759 %A Glenford J. Myers %T A controlled experiment in program testing and code walkthroughs/inspections %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 760-768 %A Th. Ottmann %A H.W. Six %A D. Wood %T Right brother trees %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 769-776 %A Ernst G. Ulrich %T Event manipulation for discrete simulations requiring large numbers of events %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 777-785 %A Kurt Maly %T A note on virtual memory indexes (short communication) %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 786-787 %A Stephen A. Ward %T Real-time plotting of approximate contour graphs %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 788-790 %A Aaron Tenenbaum %T Simulations of dynamic sequential search algorithms (short communication) %J Communications of the ACM %K cacm %V 21 %N 9 %D September 1978 %P 790-791 %E Walt Brainerd %T Fortran 77 %J Communications of the ACM %K cacm %V 21 %N 10 %D October 1978 %P 806-820 %A D. Towsley %A K.M. Chandy %A J.C. Browne %T Models for parallel processing within programs: application to CPU:I/O and I/O:I/O overlap %J Communications of the ACM %K cacm %V 21 %N 10 %D October 1978 %P 821-831 %A Ben Schneiderman %T Jump searching: a fast sequential search technique %J Communications of the ACM %K cacm %V 21 %N 10 %D October 1978 %P 831-834 %A Shi-Kuo Chang %A Yan-Wah Wong %T Optimal histogram matching by monotone gray level transformation %J Communications of the ACM %K cacm %V 21 %N 10 %D October 1978 %P 835-840 %A Robert Morris %T Counting large numbers of events in small registers %J Communications of the ACM %K cacm %V 21 %N 10 %D October 1978 %P 840-842 %A Colin L. McMaster %T An analysis of algorithms for the Dutch national flag problem %J Communications of the ACM %K cacm %V 21 %N 10 %D October 1978 %P 842-846 %A Robert Sedgewick %T Implementing quicksort programs %J Communications of the ACM %K cacm %V 21 %N 10 %D October 1978 %P 847-857 %A Gordon Lyon %T Packed scatter tables %J Communications of the ACM %K cacm %V 21 %N 10 %D October 1978 %P 857-865 %A Malcolm E. Easton %A Ronald Fagin %T Cold-start vs. warm-start miss ratios %J Communications of the ACM %K cacm %V 21 %N 10 %D October 1978 %P 866-872 %A W.R. Franta %A Kurt Maly %T A comparison of heaps and the TL structure for the simulation event set (short communication) %J Communications of the ACM %K cacm %V 21 %N 10 %D October 1978 %P 873-875 %A Norman R. Lyons %T Systems design education: a gaming approach %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 889-895 %A J.W. Wendorf %T A simply extended and modified batch environment graphical system (SEMBEGS) %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 897-904 %A B. Kumar %A E.S. Davidson %T Performance evaluation of highly concurrent computers by deterministic simulation %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 904-913 %A Berthold K.P. Horn %A Brett L. Bachman %T Using synthetic images with surface models %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 914-924 %A Pandu R. Tadikamalla %T Computer generation of gamma random variables II %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 925-928 %A G. David Ripley %T A simple recovery-only procedure for simple precedence parsers %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 928-930 %A Daniel P. Friedman %A David S. Wise %T A note on conditional expressions %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 931-933 %A Per Brinch\ Hansen %T Distributed processes: a concurrent programming concepts %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 934-941 %A Fabrizio Luccio %A Linda Pagli %T Power trees %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 941-947 %A B.A. Sheil %T Median split trees %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 947-958 %A Eugene C. Freuder %T Synthesizing constraint expressions %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 958-966 %A Edsger W. Dijkstra %A Leslie Lamport %A A.J. Martin %A C.S. Scholten %A E.F.M. Steffens %T On-the-fly garbage collection: an exercise in cooperation %J Communications of the ACM %K cacm %V 21 %N 11 %D November 1978 %P 966-975 %A Roger M. Needham %A Michael D. Schroeder %T Using encryption for authentication in large networks of computers %J Communications of the ACM %K cacm %V 21 %N 12 %D December 1978 %P 993-999 %A David Gries %A Jayadev Misra %T A linear sieve algorithm for finding prime numbers %J Communications of the ACM %K cacm %V 21 %N 12 %D December 1978 %P 999-1003 %A James L. Peterson %A James R. Bitner %A John H. Howard %T The selection of optimal tab settings %J Communications of the ACM %K cacm %V 21 %N 12 %D December 1978 %P 1004-1007 %A James C. Wetherbe %A V. Thomas Dock %T A strategic planning methodology for the computing effort in higher education: an empirical evaluation %J Communications of the ACM %K cacm %V 21 %N 12 %D December 1978 %P 1008-1015 %A M. Ibramsha %A V. Rajaraman %T Detection of logical errors in decision table programs %J Communications of the ACM %K cacm %V 21 %N 12 %D December 1978 %P 1016-1025 %A Alberto Martelli %A Ugo Montanari %T Optimizing decision trees through heuristically guided search %J Communications of the ACM %K cacm %V 21 %N 12 %D December 1978 %P 1025-1039 %A Yogen K. Dalal %A Robert M. Metcalfe %T Reverse path forwarding of broadcast packets %J Communications of the ACM %K cacm %V 21 %N 12 %D December 1978 %P 1040-1048 %A John V. Guttag %A Ellis Horowitz %A David R. Musser %T Abstract data types and software validation %J Communications of the ACM %K cacm %V 21 %N 12 %D December 1978 %P 1048-1064 %A Jay M. Spitzen %A Karl N. Levitt %A Lawrence Robinson %T An example of hierarchical design and proof %J Communications of the ACM %K cacm %V 21 %N 12 %D December 1978 %P 1064-1075 %A John W. Boyse %T Interference detection among solids and surfaces %J Communications of the ACM %K cacm %V 22 %N 1 %D January 1979 %P 3-9 %A Kent W. Colton %T The impact and use of computer technology by the police %J Communications of the ACM %K cacm %V 22 %N 1 %D January 1979 %P 10-20 %A Gian Carlo Bongiovanni %A Fabrizio Luccio %T Permutation of data blocks in a bubble memory %J Communications of the ACM %K cacm %V 22 %N 1 %D January 1979 %P 21-25 %A Charles H. Sauer %A K. Mani Chandy %T The impact of distributions and disciplines on multiple processor systems %J Communications of the ACM %K cacm %V 22 %N 1 %D January 1979 %P 25-34 %A J.P. Banatre %A J.P. Routeau %A L. Trilling %T An event-driven compiling technique %J Communications of the ACM %K cacm %V 22 %N 1 %D January 1979 %P 34-54 %A Orrin E. Taulbee %A S.D. Conte %T Production and employment of Ph.D.'s in computer science - 1977 and 1978 %J Communications of the ACM %K cacm %V 22 %N 2 %D February 1979 %P 75-76 %A Richard E. Fairley %T Employment characteristics of doctoral level computer scientists %J Communications of the ACM %K cacm %V 22 %N 2 %D February 1979 %P 77-78 %A W.E. Gull %A M.A. Jenkins %T Recursive data structures in APL %J Communications of the ACM %K cacm %V 22 %N 2 %D February 1979 %P 79-96 %A E. Morel %A C. Renvoise %T Global optimization by suppression of partial redundancies %J Communications of the ACM %K cacm %V 22 %N 2 %D February 1979 %P 96-103 %A M.R. Anderson %A M.G. Anderson %T Comments on perfect hashing functions: a single probe retrieving method for static sets %J Communications of the ACM %K cacm %V 22 %N 2 %D February 1979 %P 104 %A David R. Cheriton %A Michael A. Malcolm %A Lawrence S. Melen %A Gary R. Sager %T Thoth, a portable real-time operating system %J Communications of the ACM %K cacm %V 22 %N 2 %D February 1979 %P 105-115 %A David P. Reed %A Rajendra K. Kanodia %T Synchronization with eventcounter and sequencers %J Communications of the ACM %K cacm %V 22 %N 2 %D February 1979 %P 115-123 %A Haim Mendelson %A Joseph S. Pliskin %A Uri Yechiali %T Optimal storage allocation for serial files %J Communications of the ACM %K cacm %V 22 %N 2 %D February 1979 %P 124-130 %E Richard H. Austing %E Bruce H. Barnes %E Della T. Bonnette %E Gerald L. Engel %E Gordon Stokes %T Curriculum '78 - recommendations for the undergraduate program in computer science %J Communications of the ACM %K cacm %V 22 %N 3 %D March 1979 %P 147-166 %A Albert D. Edgar %A Samuel C. Lee %T FOCUS microcomputer number system %J Communications of the ACM %K cacm %V 22 %N 3 %D March 1979 %P 166-177 %A James Slagle %T Experiments with some algorithms that find central solutions for pattern classification %J Communications of the ACM %K cacm %V 22 %N 3 %D March 1979 %P 178-183 %A Amaryllis Deliyanni %A Robert A. Kowalski %T Logic and semantic networks %J Communications of the ACM %K cacm %V 22 %N 3 %D March 1979 %P 184-192 %A Dalia Motzkin %T The use of normal multiplication tables for information storage and retrieval %J Communications of the ACM %K cacm %V 22 %N 3 %D March 1979 %P 193-207 %A Arthur M. Lesk %T Detection of three-dimensional patterns of atoms in chemical structures %J Communications of the ACM %K cacm %V 22 %N 4 %D April 1979 %P 219-224 %A E.G. Cale %A L.L. Gremillion %A J.L. McKeeney %T Price/performance patterns of U.S. computer systems %J Communications of the ACM %K cacm %V 22 %N 4 %D April 1979 %P 225-233 %A Giacomo Bucci %A Donald N. Streeter %T A methodology for the design of distributed information systems %J Communications of the ACM %K cacm %V 22 %N 4 %D April 1979 %P 233-245 %A Richard J. Hanson %A John A. Wisniewski %T A mathematical programming updating method using modified Givens transformations and applied to LP problems %J Communications of the ACM %K cacm %V 22 %N 4 %D April 1979 %P 245-251 %A Daniel Brelaz %T New methods to color the vertices of a graphs %J Communications of the ACM %K cacm %V 22 %N 4 %D April 1979 %P 251-256 %A Richard A. De\ Millo %A Richard J. Lipton %A Alan J. Perlis %T Social processes and proofs of theorems and programs %J Communications of the ACM %K cacm %V 22 %N 5 %D May 1979 %P 271-280 %A Ernest Chang %A Rosemary Roberts %T An improved algorithm for decentralized extrema-finding in circular configurations of processes %J Communications of the ACM %K cacm %V 22 %N 5 %D May 1979 %P 281-283 %A T.D. Sterling %T Consumer difficulties with computerized transactions: an empirical investigation %J Communications of the ACM %K cacm %V 22 %N 5 %D May 1979 %P 283-289 %A John C. Reynolds %T Reasoning about arrays %J Communications of the ACM %K cacm %V 22 %N 5 %D May 1979 %P 290-299 %A Michael J. Manthey %T A model for discussion of multi-interpreter systems %J Communications of the ACM %K cacm %V 22 %N 5 %D May 1979 %P 299-309 %A Ronald S. Lemos %T An implementation of structured walk-throughs in teaching cobol programming %J Communications of the ACM %K cacm %V 22 %N 6 %D June 1979 %P 335-340 %A Stavros N. Busenberg %A Wing C. Tam %T An academic program providing realistic training in software engineering %J Communications of the ACM %K cacm %V 22 %N 6 %D June 1979 %P 341-345 %A Steven Alter %T A model for automating file and program design in business application systems %J Communications of the ACM %K cacm %V 22 %N 6 %D June 1979 %P 345-353 %A Jerome A. Feldman %T High level programming for distributed computing %J Communications of the ACM %K cacm %V 22 %N 6 %D June 1979 %P 353-368 %O Based on primitive notions of module, message, and transaction key, a methodology is shown to be independent of machines and languages. Uses assertions. Known as PLITS. %A R. Shapira %A H. Freeman %T The cyclic order property of vertices as an aid in scene analysis %J Communications of the ACM %K cacm %V 22 %N 6 %D June 1979 %P 368-374 %A Terry Winograd %T Beyond programming languages %J Communications of the ACM %K cacm %V 22 %N 7 %D July 1979 %P 391-401 %A F.P. Preparata %T An optimal real-time algorithm for planar convex hulls %J Communications of the ACM %K cacm %V 22 %N 7 %D July 1979 %P 402-405 %A Patrick C. Fischer %A Robert L. Probert %T Storage reorganization techniques for matrix computation in a paging environment %J Communications of the ACM %K cacm %V 22 %N 7 %D July 1979 %P 405-415 %A J.H. Hine %A I. Mitrani %A S. Tsur %T The control of response times in multi-class systems by memory allocation %J Communications of the ACM %K cacm %V 22 %N 7 %D July 1979 %P 415-424 %A Robert Kowalski %T Algorithm = logic + control %J Communications of the ACM %K cacm %V 22 %N 7 %D July 1979 %P 424-436 %K control language, logic programming, nonprocedural language, programming methodology, program specification, relational data structures %A J.W. Wong %A G. Scott Graham %T Self-assessment procedure VI: queueing network models of computer systems %J Communications of the ACM %K cacm %V 22 %N 8 %D August 1979 %P 449-454 %A Robert W. Floyd %T The paradigms of programming %J Communications of the ACM %K cacm %V 22 %N 8 %D August 1979 %P 455-460 %A D.S. Hirschberg %A A.K. Chandra %A D.V. Sarwate %T Computing connected components on parallel computers %J Communications of the ACM %K cacm %V 22 %N 8 %D August 1979 %P 461-464 %A Nachum Dershowitz %A Zohar Manna %T Proving termination with multiset orderings %J Communications of the ACM %K cacm %V 22 %N 8 %D August 1979 %P 465-476 %A Dorothy E. Denning %T Secure personal computing in an insecure network %J Communications of the ACM %K cacm %V 22 %N 8 %D August 1979 %P 476-482 %A Lloyd S. Nelson %T Further remark on stably updating mean and standard deviation estimates %J Communications of the ACM %K cacm %V 22 %N 8 %D August 1979 %P 483 %A Jerome A. Feldman %A William R. Sutherland %T Rejuvenating experimental computer science %J Communications of the ACM %K cacm %V 22 %N 9 %D September 1979 %P 497-502 %A Daniel D. McCracken %A Peter J. Denning %A David H. Brandin %T An ACM Executive Committee position on the crisis in experimental computer science %J Communications of the ACM %K cacm %V 22 %N 9 %D September 1979 %P 503-504 %A Zvi Galil %T On improving the worst case running time of the Boyer-Moore string matching algorithm %J Communications of the ACM %K cacm %V 22 %N 9 %D September 1979 %P 505-508 %A Kari-Jouko Raiha %A Stuart H. Zweben %T An optimal insertion algorithm for one-sided height-balanced binary search trees %J Communications of the ACM %K cacm %V 22 %N 9 %D September 1979 %P 508-512 %A Wilfred J. Hansen %T Progressive acyclic digraphs - a tool for database integrity %J Communications of the ACM %K cacm %V 22 %N 9 %D September 1979 %P 513-518 %A George Nagy %A Sharad G. Wagle %T Approximation of polygonal maps by cellular maps %J Communications of the ACM %K cacm %V 22 %N 9 %D September 1979 %P 518-525 %A Tony F. Chan %A John Gregg Lewis %T Computing standard deviations: accuracy %J Communications of the ACM %K cacm %V 22 %N 9 %D September 1979 %P 526-531 %A D.H.D. West %T Updating mean and variance estimates: an improved method %J Communications of the ACM %K cacm %V 22 %N 9 %D September 1979 %P 532-535 %A P.D. Laird %T Comment on "An optimal evaluation of boolean expressions in an online query system" %J Communications of the ACM %K cacm %V 22 %N 10 %D October 1979 %P 549-550 %A Ehud Gudes %A Anthony Hoffman %T A note on "An optimal evaluation of boolean expressions in an online query system" %J Communications of the ACM %K cacm %V 22 %N 10 %D October 1979 %P 550-553 %A Leslie Lamport %T On the proof of correctness of a calendar program %J Communications of the ACM %K cacm %V 22 %N 10 %D October 1979 %P 554-556 %A Paul Klint %T Line numbers made cheap %J Communications of the ACM %K cacm %V 22 %N 10 %D October 1979 %P 557-559 %A Tomas Lozano-Perez %A Michael A. Wesley %T An algorithm for planning collision-free paths among polyhedral obstacles %J Communications of the ACM %K cacm %V 22 %N 10 %D October 1979 %P 560-570 %A Richard E. Mayer %T A psychology of learning BASIC %J Communications of the ACM %K cacm %V 22 %N 11 %D November 1979 %P 589-593 %A Robert Morris %A Ken Thompson %T Password security: a case history %J Communications of the ACM %K cacm %V 22 %N 11 %D November 1979 %P 594-597 %A Shmuel Peleg %A Azriel Rosenfeld %T Breaking substitution ciphers using a relaxation algorithm %J Communications of the ACM %K cacm %V 22 %N 11 %D November 1979 %P 598-605 %A Robert Endre Tarjan %A Andrew Chi-Chih Yao %T Storing a sparse table %J Communications of the ACM %K cacm %V 22 %N 11 %D November 1979 %P 606-611 %A Adi Shamir %T How to share a secret %J Communications of the ACM %K cacm %V 22 %N 11 %D November 1979 %P 612-613 %A Rob Kling %T Introduction to the EFT symposium %J Communications of the ACM %K cacm %V 22 %N 12 %D December 1979 %P 639-640 %A Kenneth L. Kraemer %A Kent W. Colton %T Overview of the EFT symposium %J Communications of the ACM %K cacm %V 22 %N 12 %D December 1979 %P 641-643 %A Allen H. Lipis %T Cost of the current U.S. payments system %J Communications of the ACM %K cacm %V 22 %N 12 %D December 1979 %P 644-647 %A Robert H. Long %T Public protection and education with EFT %J Communications of the ACM %K cacm %V 22 %N 12 %D December 1979 %P 648-654 %A Donn B. Parker %T Vulnerabilities of EFTs to intentionally caused losses %J Communications of the ACM %K cacm %V 22 %N 12 %D December 1979 %P 654-660 %A Kenneth L. Kraemer %A Kent W. Colton %T Policy, values, and EFT research: anatomy of a research agenda %J Communications of the ACM %K cacm %V 22 %N 12 %D December 1979 %P 660-671 %A Paul O'Neill %A Avis O'Neill %T Performance statistics of a time sharing network at a small university %J Communications of the ACM %K cacm %V 23 %N 1 %D January 1980 %P 10-13 %A Lawrence J. Mazlack %T Identifying potential to acquire programming skill %J Communications of the ACM %K cacm %V 23 %N 1 %D January 1980 %P 14-17 %A Richard J. Cichelli %T Minimal perfect hash functions made simple %J Communications of the ACM %K cacm %V 23 %N 1 %D January 1980 %P 17-19 %A Harold Abelson %A Peter Andreae %T Information transfer and area-time tradeoffs for VLSI multiplication %J Communications of the ACM %K cacm %V 23 %N 1 %D January 1980 %P 20-23 %A James M. Lane %A Loren C. Carpenter %A Turner Whitted %A James F. Blinn %T Scan line methods for displaying parametrically defined surfaces %J Communications of the ACM %K cacm %V 23 %N 1 %D January 1980 %P 23-34 %A Anthony Ralston %A Mary Shaw %T Curriculum '78 - is computer science really that unmathematical? %J Communications of the ACM %K cacm %V 23 %N 2 %D February 1980 %P 67-70 %A M.D. Canon %A D.H. Fritz %A J.H. Howard %A T.D. Howell %A M.F. Mitoma %A J. Rodriguez-Rosell %T A virtual machine emulator for performance evaluation %J Communications of the ACM %K cacm %V 23 %N 2 %D February 1980 %P 71-80 %A David D. Redell %A Yogen K. Dalal %A Thomas R. Horsley %A Hugh C. Lauer %A William C. Lynch %A Pual R. McJones %A Hal G. Murray %A Stephen C. Purcell %T Pilot: an operating system for a personal computer %J Communications of the ACM %K cacm %V 23 %N 2 %D February 1980 %P 81-92 %A John K. Ousterhout %A Donald A. Scelza %A Pradeep S. Sindhu %T Medusa: an experiment in distributed operating system structure %J Communications of the ACM %K cacm %V 23 %N 2 %D February 1980 %P 92-105 %O Operating system to reflect the underlying distributed architecture, using send and receive on pipes %A Butler W. Lampson %A David D. Redell %T Experience with processes and monitors in MESA %J Communications of the ACM %K cacm %V 23 %N 2 %D February 1980 %P 105-117 %A Bruce J. Walker %A Richard A. Kemmerer %A Gerald J. Popek %T Specification and verification of the UCLA Unix security kernel %J Communications of the ACM %K cacm %V 23 %N 2 %D February 1980 %P 118-131 %A Robert F. Ling %T General considerations on the design of an interactive system for data analysis %J Communications of the ACM %K cacm %V 23 %N 3 %D March 1980 %P 147-154 %A Christopher W. Fraser %T A generalized text editor %J Communications of the ACM %K cacm %V 23 %N 3 %D March 1980 %P 154-158 %A K.P. Lee %T A linear algorithm for copying binary trees using bounded workspace %J Communications of the ACM %K cacm %V 23 %N 3 %D March 1980 %P 159-162 %A Hanan Samet %T Region representation: quadtrees from boundary codes %J Communications of the ACM %K cacm %V 23 %N 3 %D March 1980 %P 163-170 %A Charles R. Dyer %A Azriel Rosenfeld %A Hanan Samet %T Region representation: boundary codes from quadtrees %J Communications of the ACM %K cacm %V 23 %N 3 %D March 1980 %P 171-179 %A Charles L. Gold %A Seymour E. Goodman %A Benjamin G. Walker %T Software: recommendations for an export control policy %J Communications of the ACM %K cacm %V 23 %N 4 %D April 1980 %P 199-207 %A Ruven E. Brooks %T Studying programmer behaviour experimentally: the problems of proper methodology %J Communications of the ACM %K cacm %V 23 %N 4 %D April 1980 %P 207-213 %A Jon Louis Bentley %T Multidimensional divide-and-conquer %J Communications of the ACM %K cacm %V 23 %N 4 %D April 1980 %P 214-229 %A Jean Vuillemin %T A unifying look at data structures %J Communications of the ACM %K cacm %V 23 %N 4 %D April 1980 %P 229-239 %A Robert L. Glass %T Real-time: the "lost world" of software debugging and testing %J Communications of the ACM %K cacm %V 23 %N 5 %D May 1980 %P 264-271 %A Joshua Turner %T The structure of modular programs %J Communications of the ACM %K cacm %V 23 %N 5 %D May 1980 %P 272-277 %A I.K. Sethi %A B. Chatterjee %T Conversion of decision tables to efficient sequential testing procedures %J Communications of the ACM %K cacm %V 23 %N 5 %D May 1980 %P 279-285 %A Rik Maes %T An algorithmic approach to the conversion of decision grid charts into compressed decision tables %J Communications of the ACM %K cacm %V 23 %N 5 %D May 1980 %P 286-293 %A Arthur Gill %T Hierarchical binary search %J Communications of the ACM %K cacm %V 23 %N 5 %D May 1980 %P 294-300 %A Roger House %T Comments on program specification and testing %J Communications of the ACM %K cacm %V 23 %N 6 %D June 1980 %P 324-331 %A Jack A. Chambers %A Jerry W. Sprecher %T Computer assisted instruction: current trends and critical issues %J Communications of the ACM %K cacm %V 23 %N 6 %D June 1980 %P 332-342 %A Turner Whitted %T An improved illumination model for shaded display %J Communications of the ACM %K cacm %V 23 %N 6 %D June 1980 %P 343-349 %A John G. Fletcher %T A more general algorithm for computing closed semiring costs between vertices of a directed graph %J Communications of the ACM %K cacm %V 23 %N 6 %D June 1980 %P 350-351 %A Y. Banno %A H. Hirose %A Y. Karita %A H. Mawatari %A M. Murakami %A H. Takahashi %A S. Yashiro %A H. Yoshiki %A N. Nagiwara %A Y. Sakurai %T KEKOPEN, an open batch processing system at KEK %J Communications of the ACM %K cacm %V 23 %N 7 %D July 1980 %P 368-378 %A David Harel %T On folk theorems %J Communications of the ACM %K cacm %V 23 %N 7 %D July 1980 %P 379-389 %A R.C.H. Cheng %A G.M. Feast %T Gamma variate generators with increased shape parameter range %J Communications of the ACM %K cacm %V 23 %N 7 %D July 1980 %P 389-394 %A Fabrizio Luccio %A Linda Pagli %T Comment on generalized AVL trees %J Communications of the ACM %K cacm %V 23 %N 7 %D July 1980 %P 394-395 %A Stuart K. Card %A Thomas P. Moran %A Allen Newell %T The keystroke-level model for user performance time with interactive systems %J Communications of the ACM %K cacm %V 23 %N 7 %D July 1980 %P 396-410 %A J.M. Triance %A J.F.S. Yow %T MCOBOL - a prototype macro facility for cobol %J Communications of the ACM %K cacm %V 23 %N 8 %D August 1980 %P 432-439 %A Michael T. Compton %T Easing fault location in large systems %J Communications of the ACM %K cacm %V 23 %N 8 %D August 1980 %P 440-442 %A Kenneth E. Iverson %T Notation as a tool of thought %J Communications of the ACM %K cacm %V 23 %N 8 %D August 1980 %P 444-465 %O 1979 ACM Turing Award Lecture %A Giles Peterson %A Aaron B. Budgor %T The computer language Mathsy and applications to solid state physics %J Communications of the ACM %K cacm %V 23 %N 8 %D August 1980 %P 466-474 %A M.H. Halstead %A Victor Schneider %T Self-assessment procedure VII: software science %J Communications of the ACM %K cacm %V 23 %N 8 %D August 1980 %P 475-480 %A Dennis E. Hall %A Deborah K. Scherrer %A Joseph S. Sventek %T A virtual operating system %J Communications of the ACM %K cacm %V 23 %N 9 %D September 1980 %P 495-502 %A Hitohisa Asai %T An overrelaxation for a numerical inverse of a constant %J Communications of the ACM %K cacm %V 23 %N 9 %D September 1980 %P 503-510 %A B. Kumar %A E.S. Davidson %T Computer system design using a hierarchical approach to performance evaluation %J Communications of the ACM %K cacm %V 23 %N 9 %D September 1980 %P 511-521 %A John L. Pfaltz %A William J. Berman %A Edgar M. Cagley %T Partial-match retrieval using indexed descriptor files %J Communications of the ACM %K cacm %V 23 %N 9 %D September 1980 %P 522-528 %A Donald R. Chand %A Surya B. Yadav %T Logical construction of software %J Communications of the ACM %K cacm %V 23 %N 10 %D October 1980 %P 546-555 %A Henry Ledgard %A John A. Whiteside %A Andrew Singer %A William Seymour %T The natural language for interactive systems %J Communications of the ACM %K cacm %V 23 %N 10 %D October 1980 %P 556-563 %A Yonathan Bard %T A model of shared DASD and multipathing %J Communications of the ACM %K cacm %V 23 %N 10 %D October 1980 %P 564-572 %A K. Mani Chandy %A Charles H. Sauer %T Computational algorithms for product form queueing networks %J Communications of the ACM %K cacm %V 23 %N 10 %D October 1980 %P 573-583 %A D. Potier %A Ph. Leblane %T Analysis of locking policies in database management systems %J Communications of the ACM %K cacm %V 23 %N 10 %D October 1980 %P 584-593 %A Curtis R. Cook %A Do Jin Kim %T Best sorting algorithm for nearly sorted lists %J Communications of the ACM %K cacm %V 23 %N 11 %D November 1980 %P 620-624 %A M.L.V. Pitteway %A D.J. Watkinson %T Bresenham's algorithm with grey scale %J Communications of the ACM %K cacm %V 23 %N 11 %D November 1980 %P 625-626 %A D.S. Hirschberg %A J.B. Sinclair %T Decentralized extrema-finding in circular configurations of processors %J Communications of the ACM %K cacm %V 23 %N 11 %D November 1980 %P 627-628 %A Guy Lewis Steele,\ Jr. %A Gerald Jay Sussman %T Design of a LISP-based microprocessor %J Communications of the ACM %K cacm %V 23 %N 11 %D November 1980 %P 628-645 %A Micha Hofri %T Disk scheduling: FCFS vs. SSTF revisited %J Communications of the ACM %K cacm %V 23 %N 11 %D November 1980 %P 645-653 %A James L. Peterson %T Computer programs for detecting and correcting spelling errors %J Communications of the ACM %K cacm %V 23 %N 12 %D December 1980 %P 676-687 %A Patrick H. Winston %T Learning and reasoning by analogy %J Communications of the ACM %K cacm %V 23 %N 12 %D December 1980 %P 689-703 %A Hanan Samet %T Deletion in two-dimensional quad trees %J Communications of the ACM %K cacm %V 23 %N 12 %D December 1980 %P 703-710 %A John F. Shoch %A Jon A. Hupp %T Measured performance of an Ethernet local network %J Communications of the ACM %K cacm %V 23 %N 12 %D December 1980 %P 711-721 %A Barry Dwyer %T One more time - how to update a master file %J Communications of the ACM %K cacm %V 24 %N 1 %D January 1981 %P 3-8 %A Glenn Ricart %A Ashok K. Agrawala %T An optimal algorithm for mutual exclusion in computer networks %J Communications of the ACM %K cacm %V 24 %N 1 %D January 1981 %P 9-17 %A Paul Pritchard %T A sublinear additive sieve for finding prime numbers %J Communications of the ACM %K cacm %V 24 %N 1 %D January 1981 %P 18-23 %A Peter G.W. Keen %T Information systems and organizational change %J Communications of the ACM %K cacm %V 24 %N 1 %D January 1981 %P 24-33 %A Fred N. Krull %T Experience with ILIAD: a high-level process control language %J Communications of the ACM %K cacm %V 24 %N 2 %D February 1981 %P 66-72 %A Edward J. Gauss %T Built-in checklist reduces file destruction %J Communications of the ACM %K cacm %V 24 %N 2 %D February 1981 %P 73 %A Charles Anthont Richard Hoare %T The emperor's old clothes %J Communications of the ACM %K cacm %V 24 %N 2 %D February 1981 %P 75-83 %O 1980 ACM Turing Award Lecture %A David L. Chaum %T Untraceable electronic mail, return addresses, and digital pseudonyms %J Communications of the ACM %K cacm %V 24 %N 2 %D February 1981 %P 84-88 %A Arnold L. Rosenberg %T On uniformly inserting one data structure into another %J Communications of the ACM %K cacm %V 24 %N 2 %D February 1981 %P 88-90 %A Marylin Mantei %T The effect of programming team structures on programming tasks %J Communications of the ACM %K cacm %V 24 %N 3 %D March 1981 %P 106-113 %E Kenneth I. Magel %E Richard H. Austing %E Alfs Berztiss %E Gerald L. Engel %E John W. Hamblen %E A.A.J. Hoffmann %E Robert Mathis %T Recommendations for master's level programs in computer science %J Communications of the ACM %K cacm %V 24 %N 3 %D March 1981 %P 115-123 %E Jay F. Nunamaker,\ Jr. %T Educational programs in information systems %J Communications of the ACM %K cacm %V 24 %N 3 %D March 1981 %P 124-133 %A Gregory R. Andrews %T Parallel programs: proofs, principles, and practice %J Communications of the ACM %K cacm %V 24 %N 3 %D March 1981 %P 140-146 %A Abbe Mowshowitz %T On approaches to the study of social issues in computing %J Communications of the ACM %K cacm %V 24 %N 3 %D March 1981 %P 146-155 %A Richard E. Nance %T The time and state relationships in simulation modeling %J Communications of the ACM %K cacm %V 24 %N 4 %D April 1981 %P 173-179 %A Tuncer I. Oren %T Concepts and criteria to assess acceptability of simulation studies: a frame of reference %J Communications of the ACM %K cacm %V 24 %N 4 %D April 1981 %P 180-189 %A Osman Balci %A Robert G. Sargent %T A methodology for cost-risk analysis in the statistical validation of simulation models %J Communications of the ACM %K cacm %V 24 %N 4 %D April 1981 %P 190-197 %A K.M. Chandy %A J. Misra %T Asynchronous distributed simulation via a sequence of parallel computations %J Communications of the ACM %K cacm %V 24 %N 4 %D April 1981 %P 198-206 %A Gordon M. Clark %T Use of Polya distributions in approximate solutions to nonstationary M/M/s queues %J Communications of the ACM %K cacm %V 24 %N 4 %D April 1981 %P 206-217 %A Thomas J. Schriber %A Richard W. Andrews %T A conceptual framework for research in the analysis of simulation output %J Communications of the ACM %K cacm %V 24 %N 4 %D April 1981 %P 218-232 %A Phillip Heidelberger %A Peter D. Welch %T A spectral method for confidence interval generation and run length control in simulations %J Communications of the ACM %K cacm %V 24 %N 4 %D April 1981 %P 233-245 %A Lee W. Schruben %T Control of initialization bias in multivariate simulation response %J Communications of the ACM %K cacm %V 24 %N 4 %D April 1981 %P 246-252 %A James H. Donnelly %A Robert E. Shannon %T Minimum mean-squared-error estimators for simulation experiments %J Communications of the ACM %K cacm %V 24 %N 4 %D April 1981 %P 253-259 %A P. Heidelberger %A P.A.W. Lewis %T Regression-adjusted estimates for regenerative simulations, with graphics %J Communications of the ACM %K cacm %V 24 %N 4 %D April 1981 %P 260-273 %A Charles R. Litecky %A Larry E. Rittenberg %T The external auditor's review of computer controls %J Communications of the ACM %K cacm %V 24 %N 5 %D May 1981 %P 288-295 %A Peter Robinson %A Dave Singer %T Another spelling correction program %J Communications of the ACM %K cacm %V 24 %N 5 %D May 1981 %P 296-297 %A Robert Nix %T Experience with a space efficient way to store a dictionary %J Communications of the ACM %K cacm %V 24 %N 5 %D May 1981 %P 297-298 %A J. Inglis %T Updating a master file - yet one more time %J Communications of the ACM %K cacm %V 24 %N 5 %D May 1981 %P 299 %A Franco P. Preparata %A Jean Vuillemin %T The cube-connected cycles: a versatile network for parallel computation %J Communications of the ACM %K cacm %V 24 %N 5 %D May 1981 %P 300-309 %A Dana H. Ballard %T Strip trees: a hierarchical representation for curves %J Communications of the ACM %K cacm %V 24 %N 5 %D May 1981 %P 310-321 %A Dan W. Crockett %T Triform programs %J Communications of the ACM %K cacm %V 24 %N 6 %D June 1981 %P 344-350 %E J.F. Traub %T Quo vadimus: computer science in a decade %J Communications of the ACM %K cacm %V 24 %N 6 %D June 1981 %P 351-369 %O panel discussion at Snowbird, Utah, June 1978 %E Peter J. Denning %T A discipline in crisis %J Communications of the ACM %K cacm %V 24 %N 6 %D June 1981 %P 370-374 %O report on the meeting at Snowbird, Utah, July 1980 %A John A.N. Lee %T Response to the Federal Trade Commission's proposed ruling on standards and certification %J Communications of the ACM %K cacm %V 24 %N 6 %D June 1981 %P 375-380 %A Martin A. Fischler %A Robert C. Bolles %T Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography %J Communications of the ACM %K cacm %V 24 %N 6 %D June 1981 %P 381-395 %A Micahel Stonebraker %T Operating system support for database management %J Communications of the ACM %K cacm %V 24 %N 7 %D July 1981 %P 412-418 %A Harvey J. Greenberg %A Richard P. O'Neill %T Representing super-sparse matrices with perturbed values %J Communications of the ACM %K cacm %V 24 %N 7 %D July 1981 %P 451-456 %A Brian Billard %T Polynomial manipulation in APL %J Communications of the ACM %K cacm %V 24 %N 7 %D July 1981 %P 457-465 %A Ralph C. Merkle %A Martin E. Hellman %T On the security of multiple encryption %J Communications of the ACM %K cacm %V 24 %N 7 %D July 1981 %P 465-467 %A Richard A. Demers %T System design for usability %J Communications of the ACM %K cacm %V 24 %N 8 %D August 1981 %P 494-501 %A William L. Ash %T Mxec: parallel processing with an advanced macro facility %J Communications of the ACM %K cacm %V 24 %N 8 %D August 1981 %P 502-509 %A Richard E. Mayer %A Piraye Bayman %T Psychology of calculator languages: a framework for describing differences in user's knowledge %J Communications of the ACM %K cacm %V 24 %N 8 %D August 1981 %P 511-520 %A Alan Jay Smith %T Long term file migration: development and evaluation of algorithms %J Communications of the ACM %K cacm %V 24 %N 8 %D August 1981 %P 521-532 %A Dorothy E. Denning %A Giovanni Maria Sacco %T Timestamps in key distribution protocols %J Communications of the ACM %K cacm %V 24 %N 8 %D August 1981 %P 533-536 %A Barry Dwyer %T A user-friendly algorithm %J Communications of the ACM %K cacm %V 24 %N 9 %D September 1981 %P 556-561 %A Tim Teitelbaum %A Thomas Reps %T The Cornell program synthesizer: a syntax-directed programming environment %J Communications of the ACM %K cacm %V 24 %N 9 %D September 1981 %P 563-573 %A Joseph O'Rourke %T An on-line algorithm for fitting straight lines between data ranges %J Communications of the ACM %K cacm %V 24 %N 9 %D September 1981 %P 574-578 %A P. Quittner %A S. Csoka %A S. Halasz %A D. Kotsis %A K. Varnai %T Comparison of synonym handling and bucket organization methods %J Communications of the ACM %K cacm %V 24 %N 9 %D September 1981 %P 579-583 %A R.J. McEliece %A D.V. Sarwate %T On sharing secrets and Reed-Solomon codes %J Communications of the ACM %K cacm %V 24 %N 9 %D September 1981 %P 583-584 %A Jane Fedorowicz %T Comments on price/performance patterns of U.S. computer systems %J Communications of the ACM %K cacm %V 24 %N 9 %D September 1981 %P 585-586 %A Gail E. Kaiser %T Automatic extension of an ATN knowledge base %J Communications of the ACM %K cacm %V 24 %N 9 %D September 1981 %P 587-593 %O ACM 1979-1980 George E. Forsythe Student Paper Competition Award %A Christopher E. Rothe %T An abstract programming model %J Communications of the ACM %K cacm %V 24 %N 9 %D September 1981 %P 594-596 %O ACM 1979-1980 George E. Forsythe Student Paper Competition Award %A Jay Gischer %T Shuffle languages, Petri nets, and context-sensitive grammars %J Communications of the ACM %K cacm %V 24 %N 9 %D September 1981 %P 597-605 %O ACM 1979-1980 George E. Forsythe Student Paper Competition Award %A Donald D. Chamberlin %A Morton M. Astrahan %A Michael W. Blasgen %A James N. Gray %A W. Frank King %A Bruce G. Lindsay %A Raymond Lorie %A James W. Mehl %A Thomas G. Price %A Franco Putzolu %A Patricia Griffiths Selinger %A Mario Schkolnick %A Donald R. Slutz %A Irving L. Traiger %A Bradford W. Wade %A Robert A. Yost %T A history and evaluation of system R %J Communications of the ACM %K cacm %V 24 %N 10 %D October 1981 %P 632-646 %A Peter Wegner %T Self-assessment procedure VIII: the programming language Ada %J Communications of the ACM %K cacm %V 24 %N 10 %D October 1981 %P 647-677 %A Daniel Robey %T Computer information systems and organization structure %J Communications of the ACM %K cacm %V 24 %N 10 %D October 1981 %P 679-687 %A Peter J. Denning %A T. Don Dennis %A Jeffrey A. Brumfield %T Low contention semaphores and ready lists %J Communications of the ACM %K cacm %V 24 %N 10 %D October 1981 %P 687-699 %A David A. Patterson %T An experiment in high level language microprogramming and verification %J Communications of the ACM %K cacm %V 24 %N 10 %D October 1981 %P 699-709 %A Saul I. Gass %A Karla L. Hoffman %A Richard H.F. Jackson %A Lambert S. Joel %A Patsy B. Saunders %T Documentation for a model: a hierarchical approach %J Communications of the ACM %K cacm %V 24 %N 11 %D November 1981 %P 728-733 %A Michael A. Pechura %T Microcomputers as remote nodes of a distributed system %J Communications of the ACM %K cacm %V 24 %N 11 %D November 1981 %P 734-738 %A Starr Roxanne Hiltz %A Murray Turoff %T The evolution of user behaviour in a computerized conferencing system %J Communications of the ACM %K cacm %V 24 %N 11 %D November 1981 %P 739-751 %A Izak Benbasat %A Albert S. Dexter %A Paul S. Masulis %T An experimental study of the human/computer interface %J Communications of the ACM %K cacm %V 24 %N 11 %D November 1981 %P 752-762 %A Bennet P. Lientz %A E. Burton Swanson %T Problems in application software maintenance %J Communications of the ACM %K cacm %V 24 %N 11 %D November 1981 %P 763-769 %A Leslie Lamport %T Password authentication with insecure communication %J Communications of the ACM %K cacm %V 24 %N 11 %D November 1981 %P 770-772 %A Kellogg S. Booth %T Authentication of signatures using public key encryption %J Communications of the ACM %K cacm %V 24 %N 11 %D November 1981 %P 772-774 %A Leonard J. Bass %A Ralph E. Bunker %T A generalized user interface for applications programs %J Communications of the ACM %K cacm %V 24 %N 12 %D December 1981 %P 796-800 %A William M. McCormack %A Robert G. Sargent %T Analysis of future event set algorithms for discrete event simulation %J Communications of the ACM %K cacm %V 24 %N 12 %D December 1981 %P 801-812 %A Per Galle %T An algorithm for exhaustive generation of building floor plans %J Communications of the ACM %K cacm %V 24 %N 12 %D December 1981 %P 813-824 %A John H. Blackstone %A Gary L. Hogg %A Don T. Phillips %T A two-list synchronization procedure for discrete event simulation %J Communications of the ACM %K cacm %V 24 %N 12 %D December 1981 %P 825-828 %A G. Jaeschke %T Reciprocal hashing: a method for generating minimal perfect hashing functions %J Communications of the ACM %K cacm %V 24 %N 12 %D December 1981 %P 829-833 %A G.G. Gustafon %A R.J. Kerr %T Some practical experience with a software quality assurance program %J Communications of the ACM %K cacm %V 25 %N 1 %D January 1982 %P 4-12 %E Jean E. Sammet %E Anthony Ralston %T The new (1982) Computing Reviews classification system - final version %J Communications of the ACM %K cacm %V 25 %N 1 %D January 1982 %P 13-26 %A Jane J. Robinson %T DIAGRAM: a grammar for dialogues %J Communications of the ACM %K cacm %V 25 %N 1 %D January 1982 %P 27-46 %A J.H. Ahrens %A U. Dieter %T Generating gamma variates by a modified rejection technique %J Communications of the ACM %K cacm %V 25 %N 1 %D January 1982 %P 47-54 %A Ben Shneiderman %T Control flow and data structure documentation: two experiments %J Communications of the ACM %K cacm %V 25 %N 1 %D January 1982 %P 55-63 %A Jon Louis Bentley %A Mark G. Faust %A Franco P. Preparata %T Approximation algorithms for convex hulls %J Communications of the ACM %K cacm %V 25 %N 1 %D January 1982 %P 64-68 %A Howard Mozieco %T A human/computer interface to accommodate user learning stages %J Communications of the ACM %K cacm %V 25 %N 2 %D February 1982 %P 100-104 %A Lawrence A. Welsch %T Using electronic mail as a teaching tool %J Communications of the ACM %K cacm %V 25 %N 2 %D February 1982 %P 105-108 %A E.F. Codd %T Relational database: a practical foundation for productivity %J Communications of the ACM %K cacm %V 25 %N 2 %D February 1982 %P 109-117 %O 1981 ACM Turing Award Lecture %A Patrick G. Skelly %T The ACM position on standardization of the Ada language %J Communications of the ACM %K cacm %V 25 %N 2 %D February 1982 %P 118-120 %A Henry F. Ledgard %A Andrew Singer %T Scaling down Ada (or towards a standard Ada) %J Communications of the ACM %K cacm %V 25 %N 2 %D February 1982 %P 121-125 %A K. Mani Chandy %A Doug Neuse %T Linearizer: a heuristic algorithm for queueing network models of computing systems %J Communications of the ACM %K cacm %V 25 %N 2 %D February 1982 %P 126-133 %A John Zahorjan %A Kenneth C. Sevick %A Derek L. Eager %A Bruce Galler %T Balanced job bound analysis of queueing networks %J Communications of the ACM %K cacm %V 25 %N 2 %D February 1982 %P 134-141 %A Patricia A. Jacobson %A Edward D. Lazowska %T Analysing queueing networks with simultaneous resource possession %J Communications of the ACM %K cacm %V 25 %N 2 %D February 1982 %P 142-151 %A John F. Shoch %A Jon A. Hupp %T The "worm" programs - early experience with a distributed computation %J Communications of the ACM %K cacm %V 25 %N 3 %D March 1982 %P 172-180 %E Eric A. Weiss %T Self-assessment procedure IX: ethics in computing %J Communications of the ACM %K cacm %V 25 %N 3 %D March 1982 %P 181-195 %A Anthony I. Wasserman %A Steven Gutz %T The future of programming %J Communications of the ACM %K cacm %V 25 %N 3 %D March 1982 %P 196-206 %A Edward H. McCall %T Performance results of the simplex algorithm for a set of real-world linear programming models %J Communications of the ACM %K cacm %V 25 %N 3 %D March 1982 %P 207-212 %A Marvin L. Watkins %T A technique for testing command and control software %J Communications of the ACM %K cacm %V 25 %N 4 %D April 1982 %P 228-232 %A James G. Mitchell %A Jeremy Dion %T A comparison of two network file servers %J Communications of the ACM %K cacm %V 25 %N 4 %D April 1982 %P 233-245 %A Alfred Z. Spector %T Performing remote operations efficiently on a local computer network %J Communications of the ACM %K cacm %V 25 %N 4 %D April 1982 %P 246-259 %A Andrew D. Birrell %A Roy Levin %A Roger M. Needham %A Michael D. Schroeder %T Grapevine: an exercise in distributed computing %J Communications of the ACM %K cacm %V 25 %N 4 %D April 1982 %P 260-273 %A David K. Gifford %T Cryptographic sealing for information secrecy and authentication %J Communications of the ACM %K cacm %V 25 %N 4 %D April 1982 %P 274-286 %A William E. Howden %T Contemporary software development environments %J Communications of the ACM %K cacm %V 25 %N 5 %D May 1982 %P 318-329 %A Norihasa Suzuki %T Analysis of pointer "rotation" %J Communications of the ACM %K cacm %V 25 %N 5 %D May 1982 %P 330-335 %A Wm. Randolph Franklin %T On an improved algorithm for decentralized extrema finding in circular configurations of processors %J Communications of the ACM %K cacm %V 25 %N 5 %D May 1982 %P 336 %A Richard C. Morey %T Estimating and improving the quality of information in a MIS %J Communications of the ACM %K cacm %V 25 %N 5 %D May 1982 %P 337-342 %A Michael R. Levy %T Modularity and the sequential file update problem %J Communications of the ACM %K cacm %V 25 %N 6 %D June 1982 %P 362-367 %A D.J. Dodds %T Reducing dictionary size by using a hashing technique %J Communications of the ACM %K cacm %V 25 %N 6 %D June 1982 %P 368-370 %A Alain Fournier %A Don Fussell %A Loren Carpenter %T Computer rendering of stochastic models %J Communications of the ACM %K cacm %V 25 %N 6 %D June 1982 %P 371-384 %A James W. Brown %T Controlling the complexity of menu networks %J Communications of the ACM %K cacm %V 25 %N 7 %D July 1982 %P 412-418 %A Betrand Meyer %T Principles of package design %J Communications of the ACM %K cacm %V 25 %N 7 %D July 1982 %P 419-428 %A Greg Kearsley %T Authoring systems in computer based education %J Communications of the ACM %K cacm %V 25 %N 7 %D July 1982 %P 429-437 %A William Swartout %A Robert Balzer %T On the inevitable intertwining of specification and implementation %J Communications of the ACM %K cacm %V 25 %N 7 %D July 1982 %P 438-440 %A Bruce Gilchrist %A Arlaana Shenkin %T The impact of scanners on employment in supermarkets %J Communications of the ACM %K cacm %V 25 %N 7 %D July 1982 %P 441-445 %A Mark Weiser %T Programmers use slices when debugging %J Communications of the ACM %K cacm %V 25 %N 7 %D July 1982 %P 446-452 %A D. Tsichritzis %T Form management %J Communications of the ACM %K cacm %V 25 %N 7 %D July 1982 %P 453-478 %A Om Vikas %A V. Rajaraman %T Searching in a dynamic memory with fast sequential access %J Communications of the ACM %K cacm %V 25 %N 7 %D July 1982 %P 479-483 %A To-Yat Cheung %T Estimating block accesses and number of records in file management %J Communications of the ACM %K cacm %V 25 %N 7 %D July 1982 %P 484-487 %A James L. Elshoff %A Michael Marcotty %T Improving computer program readability to aid modification %J Communications of the ACM %K cacm %V 25 %N 8 %D August 1982 %P 512-521 %A Thomas N. Turba %T Length-segmented lists %J Communications of the ACM %K cacm %V 25 %N 8 %D August 1982 %P 522-526 %A Robert F. Simmons %A Daniel Chester %T Relating sentences and semantic networks with procedural logic %J Communications of the ACM %K cacm %V 25 %N 8 %D August 1982 %P 527-546 %A Toby Berk %A Lee Brownston %A Arie Kaufman %T A human factors study of color notation systems for computing graphics %J Communications of the ACM %K cacm %V 25 %N 8 %D August 1982 %P 547-549 %A M.S. Doyle %A J.W. Graham %T A study of superfluity in storage hierarchies %J Communications of the ACM %K cacm %V 25 %N 8 %D August 1982 %P 550-554 %A Clement W.H. Law %A Leonard H. Soicher %T Three new combination algorithms with the minimal change property %J Communications of the ACM %K cacm %V 25 %N 8 %D August 1982 %P 555-558 %A Judea Pearl %T The solution for the branching factor for the alpha-beta pruning algorithm and its optimality %J Communications of the ACM %K cacm %V 25 %N 8 %D August 1982 %P 559-563 %A Hanan Samet %T Heuristics for the line division problem in computer justified text %J Communications of the ACM %K cacm %V 25 %N 8 %D August 1982 %P 564-570 %A Johannes J. Martin %T An efficient garbage compaction algorithm %J Communications of the ACM %K cacm %V 25 %N 8 %D August 1982 %P 571-581 %A Lee L. Gremillion %T Designing a bloom filter for differential file access %J Communications of the ACM %K cacm %V 25 %N 9 %D September 1982 %P 600-604 %A Michael Pechura %T File archival techniques using data compression %J Communications of the ACM %K cacm %V 25 %N 9 %D September 1982 %P 605-609 %A Ben Shneiderman %T Designing computer system messages %J Communications of the ACM %K cacm %V 25 %N 9 %D September 1982 %P 610-612 %A S.E. Goodman %T U.S. computer export control policy: value conflicts and policy choices %J Communications of the ACM %K cacm %V 25 %N 9 %D September 1982 %P 613-624 %A David Chapman %T A program testing assistant %J Communications of the ACM %K cacm %V 25 %N 9 %D September 1982 %P 625-634 %O Winner of George E. Forsythe Student Paper Award %A Yong Tsui Lee %A Aristides A.G. Requicha %T Algorithms for computing the volume and other integral properties of solids, 1: known methods and open issues %J Communications of the ACM %K cacm %V 25 %N 9 %D September 1982 %P 635-641 %A Yong Tsui Lee %A Aristides A.G. Requicha %T Algorithms for computing the volume and other integral properties of solids, 2: a family of algorithms based on representation conversion and cellular approximation %J Communications of the ACM %K cacm %V 25 %N 9 %D September 1982 %P 642-649 %A Lubomir Bic %T A protection model and its implementation in a dataflow system %J Communications of the ACM %K cacm %V 25 %N 9 %D September 1982 %P 650-658 %A Francis Y. Chin %A John Lam %A I-Ngo Chen %T Efficient parallel algorithms for some graph problems %J Communications of the ACM %K cacm %V 25 %N 9 %D September 1982 %P 659-665 %A John F. Isner %T A fortran programming methodology based on data abstraction %J Communications of the ACM %K cacm %V 25 %N 10 %D October 1982 %P 686-698 %A Mark L. Gillenson %T The state of practice of data administration - 1981 %J Communications of the ACM %K cacm %V 25 %N 10 %D October 1982 %P 699-706 %A Lester Lipsky %A Chee-min Henry Lieu %A Abolfazi Tehranipour %A Appie van\ de\ Liefvoort %T On the asymptotic behavior of time-sharing systems %J Communications of the ACM %K cacm %V 25 %N 10 %D October 1982 %P 707-713 %A Leland L. Beck %T A dynamic storage allocation technique based on memory residence time %J Communications of the ACM %K cacm %V 25 %N 10 %D October 1982 %P 714-723 %A Jacques Cohen %T Computer-assisted microanalysis of programs %J Communications of the ACM %K cacm %V 25 %N 10 %D October 1982 %P 724-733 %A William A. Kornfeld %T Combinatorially implosive algorithms %J Communications of the ACM %K cacm %V 25 %N 10 %D October 1982 %P 734-738 %A J. Nievergell %A F.P. Preparata %T Plane-sweep algorithms for intersecting geometric figures %J Communications of the ACM %K cacm %V 25 %N 10 %D October 1982 %P 739-746 %A Philip A. Houle %T Comment on gamma deviate generation %J Communications of the ACM %K cacm %V 25 %N 10 %D October 1982 %P 747-748 %A Thomas L. Wicklund %T Mini-exec: a portable executive for 8-bit microcomputers %J Communications of the ACM %K cacm %V 25 %N 11 %D November 1982 %P 772-779 %A Edward J. Gauss %T The "wolf fence" algorithm for debugging %J Communications of the ACM %K cacm %V 25 %N 11 %D November 1982 %P 780 %E Jay F. Nunamaker,\ Jr. %E J. Daniel Couger %E Gordon B. Davis %T Information systems curriculum recommendations for the 80s: undergraduate and graduate programs - a report of the ACM curriculum committee on information systems %J Communications of the ACM %K cacm %V 25 %N 11 %D November 1982 %P 781-806 %A Thoedor D. Sterling %T Unionization of professionals in data processing: an assessment of recent trends %J Communications of the ACM %K cacm %V 25 %N 11 %D November 1982 %P 807-816 %A B.J. Lageweg %A J.K. Lenstra %A E.W. Lawler %A A.H.G. Rinnooy Kan %T Computer-aided complexity classification of combinatorial problems %J Communications of the ACM %K cacm %V 25 %N 11 %D November 1982 %P 817-822 %A Willie Y-P. Lim %T HIDSL - a structure description language %J Communications of the ACM %K cacm %V 25 %N 11 %D November 1982 %P 823-830 %A A.M. Langer %A A.W. Shum %T The distribution of granule accesses made by database transactions %J Communications of the ACM %K cacm %V 25 %N 11 %D November 1982 %P 831-832 %A K.M. Chandy %A J. Misra %T Distributed computation on graphs: shortest path algorithms %J Communications of the ACM %K cacm %V 25 %N 11 %D November 1982 %P 833-837 %A Margrethe H. Olson %A Henry C. Lucas,\ Jr. %T The impact of office automation on the organization: some implications for research and practice %J Communications of the ACM %K cacm %V 25 %N 11 %D November 1982 %P 838-847 %A Michael Evans %T Software engineering for the cobol environment %J Communications of the ACM %K cacm %V 25 %N 12 %D December 1982 %P 874-882 %A Roger S. Gourd %T Self-assessment procedure X: software project management %J Communications of the ACM %K cacm %V 25 %N 12 %D December 1982 %P 883-887 %A Art Lew %T On the emulation of flowcharts by decision tables %J Communications of the ACM %K cacm %V 25 %N 12 %D December 1982 %P 895-904 %A Irene Gargantini %T An effective way to represent quadtrees %J Communications of the ACM %K cacm %V 25 %N 12 %D December 1982 %P 905-910 %A Jeffrey Scott Vitter %T Implementations for coalesced hashing %J Communications of the ACM %K cacm %V 25 %N 12 %D December 1982 %P 911-926 %A Michael J. O'Donnell %T A critique of the foundations of Hoare-style programming logic %J Communications of the ACM %K cacm %V 25 %N 12 %D December 1982 %P 927-934 %A M. Mor %A A.S. Frankel %T A hash code method for detecting and correcting spelling errors %J Communications of the ACM %K cacm %V 25 %N 12 %D December 1982 %P 935-937 %A C.M. Eastman %T A comment on English neologisms and programming language keywords %J Communications of the ACM %K cacm %V 25 %N 12 %D December 1982 %P 938-940