Communications of the ACM (CACM), Volume 20, 1977

Volume 20, Number 1, January 1977

Reports and Articles

• 
  Allen Van Gelder:
  Structured Programming in Cobol: An Approach for Application Programmers. 2-12
• 
  Richard H. Austing, Bruce H. Barnes, Gerald L. Engel:
  A Survey of the Literature in Computer Science Education Since Curriculum '68. 13-21

Management Applications

• 
  Jair M. Babad:
  A Record and File Partitioning Model. 22-31

Programming Techniques

• 
  Albert L. Zobrist, Frederick R. Carlson Jr.:
  Detection of Combined Occurrences. 31-35

Computing Systems

• 
  Alan P. Batson, Robert E. Brundage:
  Segment Sizes and Lifetimes in Algol 60 Programs. 36-44

Volume 20, Number 2, February 1977

Scientific Applications

• 
  Mervin E. Muller:
  An Approach to Multidimensional Data Array Processing by Computer. 63-77

Programming Techniques

• 
  Douglas W. Clark, C. Cordell Green:
  An Empirical Study of List Structure in Lisp. 78-87
• 
  Franco P. Preparata, S. J. Hong:
  Convex Hulls of Finite Sets of Poin ts in Two and Three Dimensions. 87-93

Computer Systems

• 
  Malcolm C. Easton, Brian T. Bennett:
  Transient-Free Working-Set Statistics. 93-99

Graphics and Image Processing

• 
  Jack Bresenham:
  A Linear Algorithm for Incremental Digital Display of Circular Arcs. 100-106

Management Science / Operations Research

• 
  Thoddi C. T. Kotiah, David I. Steinberg:
  Occurrences of Cycling and Other Phenomena Arising in a Class of Linear Programming Models. 107-112

Short Communications: Programming Techniques

• 
  Gary D. Knott:
  A Numbering System for Binary Trees. 113-115

Volume 20, Number 3, March 1977

Artificial Intelligence / Language Processing

• 
  Philip Clapson:
  Improving the Access Time for Random Access Files. 127-135
• 
  Clement T. Yu, Gerard Salton:
  Effective Information Retrieval Using Term Accuracy. 135-142

Computing Systems

• 
  Åmund Lunde:
  Empirical Evaluation of Some Features of Instruction Set Processor Architectures. 143-153
• 
  R. M. Brown, James C. Browne, K. Mani Chandy:
  Memory Management and Response Time. 153-165

Graphics and Image Processing

• 
  Warren Burton:
  Representation of Many-Sided Polygons and Polygonal Lines for Rapid Processing. 166-171

Programming Techniques

• 
  Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
  Operations on Sparse Relations. 171-176

Management Applications

• 
  Richard L. Nolan:
  Effects of Chargeout on User/Manager Attitudes. 177-185
• 
  Israel Borovits, Phillip Ein-Dor:
  Cost/Utilization: A Measure of System Performance. 185-191

Short Communications: Operating Systems

• 
  Carter Bays:
  A Comparison of Next-fit, First-fit, and Best-fit. 191-192

Short Communications: Programming Languages

• 
  Eberhard Bertsch:
  The Storage Requirement in Precedence Parsing. 192-194

Volume 20, Number 4, April 1977

Programming Languages

• 
  James H. Morris Jr., Ben Wegbreit:
  Subgoal Induction. 209-222

Graphics and Image Processing

• 
  Steven L. Tanimoto, Theodosios Pavlidis:
  The Editing of Picture Segmentations Using Local Analysis of Graphs. 223-229

Scientific Applications

• 
  Nicholas V. Findler:
  Studies in Machine Cognition Using the Game of Poker. 230-245

Management Applications

• 
  K. Maruyama, Stephen E. Smith:
  Analysis of Design Alternatives for Virtual Memory Indexes. 245-254
• 
  Henry C. Lucas Jr., Jimmy A. Sutton:
  The Stage Hypothesis and the S-Curve: Some Contradictory Evidence. 254-259

Short Communications

• 
  S. Bing Yao:
  Approximating the Number of Accesses in Database Organizations. 260-261
• 
  Clifford R. Hollander:
  Remark on Uniform Insertion in Structured Data Structures. 261-262
• 
  S. K. Bandyopadhyay:
  Comment on Weighted Increment Linear Search for Scatter Tables. 262-263

Programming Techniques

• 
  Clark D. Thompson, H. T. Kung:
  Sorting on a Mesh-Connected Parallel Computer. 263-271
• 
  Lawrence Robinson, Karl N. Levitt:
  Proof Techniques for Hierarchically Structured Programs. 271-283

Volume 20, Number 5, May 1977

Reports and Articles

• 
  Richard C. Holt, David B. Wortman, David T. Barnard, James R. Cordy:
  SP/k: A System for Teaching Computer Programming. 301-309

Management Science / Operations Research

• 
  George S. Fishman:
  Achieving Specific Accuracy in Simulation Output Analysis. 310-315
• 
  Howard L. Morgan, K. Dan Levin:
  Optimal Program and Data Locations in Computer Networks. 315-322

Artificial Intelligence / Language Processing

• 
  Jean-Loup Baer, B. Schwab:
  A Comparison of Tree-Balancing Algorithms. 322-330
• 
  Neil J. Stillman, P. Bruce Berra:
  A Comparison of Hardware and Software Associative Memories in the Context of Computer Graphics. 331-339
• 
  Marvin B. Shapiro:
  The Choice of Reference Points in Best-Match File Searching. 339-343

Short Communications

• 
  Michael Z. Hanani:
  An Optimal Evaluation of Boolean Expressions in an Online Query System. 344-347
• 
  Y. Milman:
  An Approach to Optimal Design of Storage Parameters in Databases. 347-350

Programming Techniques

• 
  James W. Hunt, Thomas G. Szymanski:
  A Fast Algorithm for Computing Longest Subsequences. 350-353

Volume 20, Number 6, June 1977

Reports and Articles

• 
  Orrin E. Taulbee, Samuel D. Conte:
  Production and Employment of Ph.D.'s in Computer Science - 1976. 370-372
• 
  Ben Shneiderman, Richard E. Mayer, Don McKay, Peter Heller:
  Experimental Investigations of the Utility of Detailed Flowcharts in Programming. 373-381

Programming Languages: Selected Papers from the Conference on Data: Abstraction, Definition, and Structure, March 22-24, 1976

• 
  Henry F. Ledgard, Robert W. Taylor:
  Two Views of Data Abstraction - Introduction to the Special Section. 382-384
• 
  Moshé M. Zloof, S. Peter de Jong:
  The System for Business Automation (SBA): Programming Language. 385-396
• 
  John V. Guttag:
  Abstract Data Type and the Development of Data Structures. 396-404
• 
  John Miles Smith, Diane C. P. Smith:
  Database Abstractions: Aggregation. 405-413
• 
  David Gries, Narain H. Gehani:
  Some Ideas on Data Types in High-Level Languages. 414-420

Operating Systems

• 
  James L. Peterson, Theodore A. Norman:
  Buddy Systems. 421-431

Programming techniques

• 
  J. M. Robson:
  A Bounded Storage Algorithm for Copying Cyclic Structures. 431-433
• 
  Richard S. Bird:
  Notes on Recursion Elimination. 434-439

Short Communications

• 
  Henry S. Warren Jr.:
  Functions Realizable with Word-Parallel Logical and Two's-Complement Addition Instructions. 439-441

Volume 20, Number 7, July 1977

Computer Systems

• 
  Sandra A. Mamrak:
  Dynamic Response Time Prediction for Computer Networks. 461-468
• 
  Manfred Ruschitzka, Robert S. Fabry:
  A Unifying Approach to Scheduling. 469-477
• 
  William D. Tajibnapis:
  A Correctness Proof of a Topology Information Maintenance Protocol for a Distributed Computer Network. 477-485
• 
  Paul G. Heckel, Butler W. Lampson:
  A Terminal-Oriented Communication System. 486-494

Artificial Intelligence / Language Processing

• 
  Ben Ross Schneider Jr., Reid M. Watts:
  SITAR: An Interactive Text Processing System for Small Computers. 495-499

Operating Systems

• 
  Joep L. W. Kessels:
  An Alternative to Event Queues for Synchronization in Monitors. 500-503
• 
  Dorothy E. Denning, Peter J. Denning:
  Certification of Programs for Secure Information Flow. 504-513

Programming Languages

• 
  Jeffrey M. Barth:
  Shifting Garbage Collection Overhead to Compile Time. 513-518
• 
  Edward A. Ashcroft, William W. Wadge:
  Lucid, a Nonprocedural Language with Iteration. 519-526

Short Communications

• 
  Nevil Brownlee:
  An Algol-Based Implementation of SNOBOL4 Patterns. 527-529

Volume 20, Number 8, August 1977

Programming Languages: Selected Papers from the ACM Conference on Language Design for Reliable Software, March 28-30, 1977

• 
  James J. Horning:
  Selected Papers from the ACM Conference on Language Design for Reliable Software - Introduction. Commun. ACM 20(8): 539 (1977)
• 
  Charles M. Geschke, James H. Morris Jr., Edwin H. Satterthwaite:
  Early Experience with Mesa. 540-553
• 
  Mary Shaw, William A. Wulf, Ralph L. London:
  Abstraction and Verification in Alphard: Defining and Specifying Iteration and Generators. 553-564
• 
  Barbara H. Liskov, Alan Snyder, Russell R. Atkinson, Craig Schaffert:
  Abstraction Mechanisms in CLU. 564-576
• 
  Niklaus Wirth:
  Toward a Discipline of Real-Time Programming. 577-583

Management Science / Operations Research

• 
  John D. Gannon:
  An Experimental Evaluation of Data Type Conventions. 584-595
• 
  William R. Franta, Kurt Maly:
  An Efficient Data Structure for the Simulation Event Set. 596-602

Corrigendum

• 
  Orrin E. Taulbee, Samuel D. Conte:
  Corrigendum: Production and Employment of Ph.D.'s in Computer Science - 1976. Commun. ACM 20(8): 602 (1977)

Short Communications

• 
  Eugene L. Lawler:
  Comment on Computing the k Shortest Paths in a Graph. 603-604
• 
  Nissim Francez:
  Another Advantage of Keyword Notation for Parameter Communication with Subprograms. Commun. ACM 20(8): 604-605 (1977)

Volume 20, Number 9, September 1977

1976 ACM Turing Award Lectures

• 
  Michael O. Rabin:
  Complexity of Computations. 625-633
• 
  Dana S. Scott:
  Logic and Programming Languages. 634-641

Reports and Articles

• 
  Richard H. Austing:
  The GRE Advanced Test in Computer Science. 642-645

Student Award Papers

• 
  Robert Scheifler:
  An Analysis of Inline Substitution for a Structured Programming Language. 647-654
• 
  David K. Gifford:
  Hardware Estimation of Process' Primary Memory Requirements. 655-663
• 
  Harry G. Mairson:
  Some New Upper Bounds on the Generation of Prime Numbers. 664-669

Programming Techniques

• 
  Edward M. McCreight:
  Pagination of B*-Trees with Variable-Length Records. 670-674

Volume 20, Number 10, October 1977

Selected Papers from SIGGRAPH 77

• 
  Henry Fuchs, Zvi M. Kedem, Samuel P. Uselton:
  Optimal Surface Reconstruction from Planar Contours. 693-702
• 
  Sheng-Chuan Wu, John F. Abel, Donald P. Greenberg:
  An Interactive Computer Graphics Approach to Surface Representation. 703-712

Programming Languages

• 
  Barry K. Rosen:
  High-Level Data Flow Analysis. 712-724
• 
  Carlo Montangero, Giuliano Pacini, Franco Turini:
  Two-Level Control Structure for Nondeterministic Programming. 725-730
• 
  Wilf R. LaLonde:
  Regular Right Part Grammars and Their Parsers. 731-741

Computer Systems

• 
  Raymond Devillers:
  Game Interpretation of the Deadlock Avoidance Problem. 741-745
• 
  Evan L. Ivie:
  The Programmer's Workbench - A Machine for Software Development. 746-753
• 
  Alan Jay Smith:
  Multiprocessor Memory Organization and Memory Interference. 754-761

Corrigendum

• 
  Ben Ross Schneider Jr., Reid M. Watts:
  Corrigendum: SITAR: An Interactive Text Processing System for Small Computers. Commun. ACM 20(10): 761 (1977)

Programming Techniques

• 
  Robert S. Boyer, J Strother Moore:
  A Fast String Searching Algorithm. 762-772

Volume 20, Number 11, November 1977

Reports and Articles

• 
  John A. N. Lee:
  Considerations for Future Programming Language Standards Activities. 788-794

Computer Systems

• 
  Rollins Turner, William D. Strecker:
  Use of the LRU Stack Depth Distribution for Simulation of Paging Behavior. 795-798

Graphics and Image Processing

• 
  Franklin C. Crow:
  The Aliasing Problem in Computer-Generated Shaded Images. 799-805

Operating Systems

• 
  Leslie Lamport:
  Concurrent Reading and Writing. 806-811
• 
  John E. Shore:
  Anomalous Behaviour of the Fifty-Percent Rule in Dynamic Memory Allocation. 812-820

Short Communications

• 
  George C. Stockman, Ashok K. Agrawala:
  Equivalence of Hough Curve Detection to Template Matching. 820-822
• 
  Niklaus Wirth:
  What Can We Do about the Unnecessary Diversity of Notation for Syntactic Definitions? 822-823
• 
  Mohit Kumar Roy:
  A Note On Refection-Free Permutation Enumeration. 823

Programming Languages

• 
  Zohar Manna, Adi Shamir:
  The Optimal Approach to Recursive Programs. 824-831
• 
  Michael Hammer, W. Gerry Howe, Vincent J. Kruskal, Irving Wladawsky:
  A Very High Level Programming Language for Data Processing Applications. 832-840

Programming Techniques

• 
  Renzo Sprugnoli:
  Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets. 841-850
• 
  John Cocke, Ken Kennedy:
  An Algorithm for Reduction of Operator Strength. 850-856
• 
  Richard S. Bird:
  Improving Programs by the Introduction of Recursion. 856-863
• 
  Norman R. Nielsen:
  Dynamic Memory Allocation in Computer Simulation. 864-873

Management Applications

• 
  Mike W. Blasgen, Richard G. Casey, Kapali P. Eswaran:
  An Encoding Method for Multifield Sorting and Indexing. 874-878

Management Science / Operations Research

• 
  Enrique Grapa, Geneva G. Belford:
  Some Theorems to Aid in Solving the File Allocation Problem. 878-882

Volume 20, Number 12, December 1977

Reports and Articles

• 
  A. A. Lopez, Robert Raymond, Robert Tardiff:
  A Survey of Computer Science Offerings In Small Liberal Arts Colleges. 902-906

Programming Languages

• 
  Joep L. W. Kessels:
  A Conceptual Framework for a Nonprocedural Programming Language. 906-913
• 
  Larry Carter:
  A Case Study of a New Code Generation Technique for Compilers. 914-920
• 
  David Gries:
  An Exercise in Proving Parallel Programs Correct. 921-930
• 
  Irene Greif:
  A Language for Formal Problem Specification. 931-935

Computer Systems

• 
  Marshall D. Abrams, Siegfried Treu:
  A Methodology for Interactive Computer Service Measurement. 936-944

Social Impacts of Computing

• 
  James N. Danziger, William H. Dutton:
  Computers as an American Local Governments. 945-956