| 310 | -- | 0 | Norman E. Gibbs. Generation of All the Cycles of a Graph from a Set of Basic Cycles [H] (Algorithm 492) |
| 318 | -- | 322 | Vincent Y. Lum, Michael E. Senko, C. P. Wang, H. Ling. A Cost Oriented Algorithm for Data Set Allocation in Storage Hierarchies |
| 323 | -- | 329 | Alan F. Babich, John Grason, David Lorge Parnas. Significant Event Simulation |
| 330 | -- | 331 | Robert B. K. Dewar. Indirect Threaded Code |
| 331 | -- | 332 | Ben Cranston, Rick Thomas. A Simplified Recombination Scheme for the Fibonacci Buddy System |
| 333 | -- | 340 | Alfred V. Aho, Margaret J. Corasick. Efficient String Matching: An Aid to Bibliographic Search |
| 341 | -- | 343 | Daniel S. Hirschberg. A Linear Space Algorithm for Computing Maximal Common Subsequences |
| 344 | -- | 346 | Stephen Soule. Addition in an Arbitrary Base Without Radix Conversion |
| 347 | -- | 349 | L. H. Harper, Thomas H. Payne, John E. Savage, E. Straus. Sorting X + Y |
| 350 | -- | 353 | F. Paul Wyman. Improved Event-Scanning Mechanisms for Discrete Event Simulation |