Journals in DBLP

SIAM J. Comput.
1973, volume: 2, number: 1

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