Journals in DBLP

SIAM J. Comput.
1974, volume: 3, number: 1

1. George E. Collins
   The Computing Time of the Euclidean Algorithm. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1974, v:3, n:1, pp:1-10 [Journal]
   
2. Richard R. Muntz, Holger Opderbeck
   Stack Replacement Algorithms for Two-Level Directly Addressable Paged Memories. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1974, v:3, n:1, pp:11-22 [Journal]
   
3. R. E. Osteen, P. P. Lin
   Picture Skeletons Based on Eccentricities of Points of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1974, v:3, n:1, pp:23-41 [Journal]
   
4. Jay P. Fillmore, S. G. Williamson
   On Backtracking: A Combinatorial Description of the Algorithm. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1974, v:3, n:1, pp:42-55 [Journal]
   
5. Jean Francois Pacault
   Computing the Weak Components of a Directed Graph. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1974, v:3, n:1, pp:56-61 [Journal]
   
6. Robert Endre Tarjan
   Finding Dominators in Directed Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1974, v:3, n:1, pp:62-89 [Journal]
   
7. Curtis R. Cook
   Order Graph Grammars. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1974, v:3, n:1, pp:90-99 [Journal]