SIAM Journal on Computing, Volume 2

Volume 2, Number 1, March 1973

E. A. Akkoyunlu: The Enumeration of Maximal Cliques of Large Graphs. 1-6 BibTeX
Chin-Liang Chang, Richard C. T. Lee, John K. Dixon: The Specialization of Programs by Theorem Proving. 7-15 BibTeX
S. E. Goodman, Stephen T. Hedetniemi: Eulerian Walks in Graphs. 16-27 BibTeX
Philip M. Spira: A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n² log²n). 28-32 BibTeX
Jürg Nievergelt, Edward M. Reingold: Binary Search Trees of Bounded Balance. 33-43 BibTeX
S. G. Williamson: Isomorph Rejection and a Theorem of De Bruijn. 44-59 BibTeX
Mike Paterson, Larry J. Stockmeyer: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials. 60-66 BibTeX

J. Robert Jump, P. S. Thiagarajan: On the Equivalence of Asynchronous Control Structures. 67-87 BibTeX
John H. Holland: Genetic Algorithms and the Optimal Allocation of Trials. 88-105 BibTeX , Erratum: SIAM J. Comput. 3(4): 326(1974) BibTeX
Alfred V. Aho, Jeffrey D. Ullman: A Technique for Speeding up LR(k) Parsers. 106-127 BibTeX
Philip J. Chase: Transposition Graphs. 128-133 BibTeX

John E. Hopcroft, Robert Endre Tarjan: Dividing a Graph into Triconnected Components. 135-158 BibTeX
John E. Hopcroft, J. Musinski: Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms. 159-173 BibTeX
Walter J. Savitch: How to Make Arbitrary Grammars Look Like Context-Free Grammars. 174-182 BibTeX
Donald P. Gaver, Gerald S. Shedler: Approximate Models for Processor Utilization in Multiprogrammed Computer Systems. 183-192 BibTeX
Toshihide Ibaraki: Finite State Representations of Discrete Optimization Problems. 193-210 BibTeX
Robert Endre Tarjan: Enumeration of the Elementary Circuits of a Directed Graph. 211-216 BibTeX

Loren Haskins, Donald J. Rose: Toward Characterization of Perfect Elimination Digraphs. 217-224 BibTeX
John E. Hopcroft, Richard M. Karp: An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs. 225-231 BibTeX
Stephen S. Lavenberg: Queueing Analysis of a Multiprogrammed Computer System Having a Multilevel Storage Hierarchy. 232-252 BibTeX
J. C. Dunn: Continuous Group Averaging and Pattern Classification Problems. 253-272 BibTeX
Leonard J. Bass: On Optimal Processor Scheduling for Multiprogramming. 273-280 BibTeX , Errata: SIAM J. Comput. 5(4): 758(1976) BibTeX
Walter B. McRae, Ernest R. Davidson: An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral Cone. 281-293 BibTeX
John E. Hopcroft, Jeffrey D. Ullman: Set Merging Algorithms. 294-303 BibTeX
Sheila A. Greibach: The Hardest Context-Free Language. 304-310 BibTeX
Derek G. Corneil, Bruce Graham: An Algorithm for Determining the Chromatic Number of a Graph. 311-318 BibTeX