Communications of the ACM (CACM), Volume 22, 1979

Volume 22, Number 1, January 1979

• John W. Boyse: Interference Detection Among Solids and Surfaces. 3-9

• Kent W. Colton: The Impact and Use of Computer Technology by the Police. 10-20

• Gian Carlo Bongiovanni, Fabrizio Luccio: Permutation of Data Blocks in a Bubble Memory. 21-25

• Charles H. Sauer, K. Mani Chandy: The Impact of Distributions and Disciplines on Multiple Processor Systems. 25-34

• Jean-Pierre Banâtre, Jean-Paul Routeau, Laurent Trilling: An Event-Driven Compiling Technique. 34-42
• Jacques J. Arsac: Syntactic Source to Source Transforms and Program Manipulation. 43-54

Volume 22, Number 2, February 1979

• Orrin E. Taulbee, Samuel D. Conte: Production and Employment of Ph.D.'s in Computer Science - 1977 and 1978. 75-76
• Richard E. Fairley: Employment Characteristics of Doctoral Level Computer Scientists. 77-78

• W. E. Gull, Michael A. Jenkins: Recursive Data Structures in APL. 79-96
• Etienne Morel, Claude Renvoise: Global Optimization by Suppression of Partial Redundancies. 96-103
• M. R. Anderson, M. G. Anderson: Comments on Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets. 104 , Corrigendum: CACM 22(10): 553 (1979)

• David R. Cheriton, Michael A. Malcolm, Lawrence S. Melen, Gary R. Sager: Thoth, a Portable Real-Time Operating System. 105-115
• David P. Reed, Rajendra K. Kanodia: Synchronization with Eventcounts and Sequences. 115-123
• Haim Mendelson, Joseph S. Pliskin, Uri Yechiali: Optimal Storage Allocation for Serial Files. 124-130

Volume 22, Number 3, March 1979

• Richard H. Austing, Bruce H. Barnes, Della T. Bonnette, Gerald L. Engel, Gordon Stokes: Curriculum '78: Recommendations for the Undergraduate Program in Computer Science - A Report of the ACM Curriculum Committee on Computer Science. 147-166

• Albert D. Edgar, Samuel C. Lee: FOCUS Microcomputer Number System. 166-177

• James R. Slagle: Experiments with Some Algorithms that Find Central Solutions for Pattern Classification. 178-18
• Amaryllis Deliyanni, Robert A. Kowalski: Logic and Semantic Networks. 184-192
• Dalia Motzkin: The Use of Normal Multiplication Tables for Information Storage and Retrieval. 193-207

Volume 22, Number 4, April 1979

• Arthur M. Lesk: Detection of Three-Dimensional Patterns of Atoms in Chemical Structures. 219-224

• Edward G. Cale Jr., Lee L. Gremillion, J. L. McKenney: Price/Performance Patterns of U.S. Computer Systems. 225-232
• Giacomo Bucci, Donald N. Streeter: A Methodology for the Design of Distributed Information Systems. 233-245

• Richard J. Hanson, John A. Wisniewski: A Mathematical Programming Updating Method Using Modified Givens Transformations and Applied to LP Problems. 245-251
• Daniel Brélaz: New Methods to Color Vertices of a Graph. 251-256 , Correction: Commun. ACM 26(8): 595-597(1983)

Volume 22, Number 5, May 1979

• Richard A. DeMillo, Richard J. Lipton, Alan J. Perlis: Social Processes and Proofs of Theorems and Programs. 271-280

• Ernest J. H. Chang, Rosemary Roberts: An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processes. 281-283

• Theodor D. Sterling: Consumer Difficulties With Computerized Transactions: An Empirical Investigation. 283-289

• John C. Reynolds: Reasoning About Arrays. 290-299

• Michael J. Manthey: A Model for and Discussion of Multi-Interpreter Systems. 299-309

Volume 22, Number 6, June 1979

• Ronald S. Lemos: An Implementation of Structured Walk-Throughs in Teaching Cobol Programming. 335-340
• Stavros N. Busenberg, Wing C. Tam: An Academic Program Providing Realistic Training in Software Engineering. 341-345

• Steven Alter: A Model for Automating File and Program Design in Business Application Systems. 345-353

• Jerome A. Feldman: High Level Programming for Distributed Computing. 353-368

• Ruth Shapira, Herbert Freeman: The Cyclic Order Property of Vertices as an Aid in Scene Analysis. 368-375

Volume 22, Number 7, July 1979

• Terry Winograd: Beyond Programming Languages. 391-401

• Franco P. Preparata: An Optimal Real-Time Algorithm for Planar Convex Hulls. 402-405
• Patrick C. Fischer, Robert L. Probert: Storage Reorganization Techniques for Matrix Computation in a Paging Environment. 405-415

• J. H. Hine, Isi Mitrani, Shalom Tsur: The Control of Response Times in Multi-Class Systems by Memory Allocation. 415-424

• Robert A. Kowalski: Algorithm = Logic + Control. 424-436

Volume 22, Number 8, August 1979

• J. W. Wong, G. Scott Graham: Self-Assessment Procedure VI: A Self-Assessment Procedure Dealing with Queueing Network Models of Computer Systems. 449-454

• Robert W. Floyd: The Paradigms of Programming. 455-460

• Daniel S. Hirschberg, Ashok K. Chandra, Dilip V. Sarwate: Computing Connected Components on Parallel Computers. 461-464
• Nachum Dershowitz, Zohar Manna: Proving Termination with Multiset Orderings. 465-476

• Dorothy E. Denning: Secure Personal Computing in an Insecure Network. 476-482

• Lloyd S. Nelson: Further Remark on Stably Updating Mean and Standard Deviation Estimates. 483

Volume 22, Number 9, September 1979

• Jerome A. Feldman, William R. Sutherland: Rejuvenating Experimental Computer Science - A Report to the National Science Foundation and Others. 497-502

• Daniel D. McCracken, Peter J. Denning, David H. Brandin: An ACM Executive Committee Position on the Crisis in Experimental Computer Science. 503-504

• Zvi Galil: On Improving the Worse Case Running Time of the Boyer-Moore String Matching Algorithm. 505-508
• Kari-Jouko Räihä, Stuart H. Zweben: An Optimal Insertion Algorithm for One-Sided Height-Balanced Binary Search Trees. 508-512
• Wilfred J. Hansen: Progressive Acyclic Digraphs - A Tool for Database Integrity. 513-518

• George Nagy, Sharad Wagle: Approximation of Polygonal Maps by Cellular Maps. 518-525
• Tony F. Chan, John Gregg Lewis: Computing Standard Deviations: Accuracy. 526-531
• D. H. D. West: Updating Mean and Variance Estimates: An Improved Method. 532-535

Volume 22, Number 10, October 1979

• Philip D. Laird: Comment on: "An Optimal Evaluation of Boolean Expressions in an Online Query System". 549-550 , ->Commun. ACM 20(5): 344-347(1977)
• Ehud Gudes, Anthony Hoffman: A Note on: "An Optimal Evaluation of Boolean Expressions in an Online Query System". 550-553

• Leslie Lamport: On the Proof of Correctness of a Calendar Program. 554-556
• Paul Klint: Line Numbers Made Cheap. 557-559

• Tomás Lozano-Pérez, Michael A. Wesley: An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles. 560-570

Volume 22, Number 11, November 1979

• Richard E. Mayer: A Psychology of Learning BASIC. 589-593

• Robert Morris, Ken Thompson: Password Security - A Case History. 594-597

• Shmuel Peleg, Azriel Rosenfeld: Breaking Substitution Ciphers Using a Relaxation Algorithm. 598-605

• Robert Endre Tarjan, Andrew Chi-Chih Yao: Storing a Sparse Table. 606-611
• Adi Shamir: How to Share a Secret. 612-613

Volume 22, Number 12, December 1979

• Rob Kling: Introduction to the EFT Symposium. 639-640
• Kenneth L. Kraemer, Kent W. Colton: Overview of the EFT Symposium. 641-643
• Allen H. Lipis: Costs of the Current U.S. Payments System. 644-647
• Robert H. Long: Public Protection and Education with EFT. 648-654
• Donn B. Parker: Vulnerabilities of EFTs to Intentionally Caused Losses. 654-660
• Kenneth L. Kraemer, Kent W. Colton: Policy, Values, and EFT Research: Anatomy of a Research Agenda. 660-671

• M. van der Nat: On Interpolation Search. 681