| 1975 | On the Decision Tree Complexity of the Shortest Path Problems | Michael L. Fredman |
| 1975 | The Exact Time Required to Perform Generalized Addition | Robert W. Floyd |
| 1975 | An O(n^2.5) Algorithm for Maximum Matching in General Graphs | Shimon Even, Oded Kariv |
| 1975 | On the Complexity of Timetable and Multi-Commodity Flow Problems | Shimon Even, Alon Itai, Adi Shamir |
| 1975 | Correct Computation Rules for Recursive Languages (Extended Abstract) | Peter J. Downey, Ravi Sethi |
| 1975 | Fast Parallel Matrix Inversion Algorithms | L. Csanky |
| 1975 | Preserving Order in a Forest in less than Logarithmic Time | Peter van Emde Boas |
| 1975 | An Improvement of Valiant's Decision Procedure for Equivalence of Deterministic Finite-Turn Pushdown Automata | Catriel Beeri |
| 1975 | Flow of Control in the Proof Theory of Structured Programming | J. W. de Bakker |
| 1975 | Parallel Computations in Graph Theory | Eshrat Arjomandi, Derek G. Corneil |
| 1975 | Computational Complexity of Decision Procedures for Polynomials (Extended Abstract) | Leonard M. Adleman, Kenneth L. Manders |
| 1974 | Bounds on Selection Networks | Andrew Chi-Chih Yao |
| 1974 | Ianov Schemas Augmented by a Pushdown Memory | Nobuki Tokura, Tadao Kasami, Shukichi Furuta |
| 1974 | P-Complete Problems and Approximate Solutions | Sartaj Sahni, Teofilo F. Gonzalez |
| 1974 | Approximate Algorithms for the Traveling Salesperson Problem | Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II |
| 1974 | On Self-Organizing Sequential Search Heuristics | Ronald L. Rivest |
| 1974 | On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract) | Ronald L. Rivest |
| 1974 | The Equivalence Problem for Regular Expressions over one Letter Is Elementary | Jos Lucas Rangel |
| 1974 | A Comparative Study of Models of Parallel Computation | Richard J. Lipton, Lawrence Snyder, Yechezkel Zalcstein |
| 1974 | Combinational Complexity of Some Monotone Functions | Edmund A. Lamagna, John E. Savage |
| 1974 | On the Computational Complexity of Finding the Maxima of a Set of Vectors | H. T. Kung |
| 1974 | On Boolean Functions Having Maximal Number of Subfunction Classes | Pawel Kerntopf |
| 1974 | Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract) | Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman |
| 1974 | Axiomatic Equivalence of Programs with Structured Variables | Christoph M. Hoffmann, Lawrence H. Landweber |
| 1974 | Minimization of Fanout in Switching Networks | John P. Hayes |