Journals in DBLP

SIAM J. Comput.
1978, volume: 7, number: 4

1. John L. Bruno, Peter J. Downey
   Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1978, v:7, n:4, pp:393-404 [Journal]
   
2. Daniel J. Rosenkrantz, Harry B. Hunt III
   Polynomial Algorithms for Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1978, v:7, n:4, pp:405-412 [Journal]
   
3. Alon Itai, Michael Rodeh
   Finding a Minimum Circuit in a Graph. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1978, v:7, n:4, pp:413-423 [Journal]
   
4. Frank Ruskey
   Generating t-ary Trees Lexicographically. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1978, v:7, n:4, pp:424-439 [Journal]
   
5. Alan L. Selman
   Polynomial Time Enumeration Reducibility. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1978, v:7, n:4, pp:440-457 [Journal]
   
6. David A. Plaisted
   Some Polynomial and Integer Divisibility problems are NP-Hard. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1978, v:7, n:4, pp:458-464 [Journal]
   
7. Arnold L. Rosenberg, Lawrence Snyder
   Minimal-Comparison 2, 3-Trees. [Citation Graph (6, 0)][DBLP]
   SIAM J. Comput., 1978, v:7, n:4, pp:465-480 [Journal]
   
8. Paul Walton Purdom Jr.
   Tree Size by Partial Backtracking. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1978, v:7, n:4, pp:481-491 [Journal]
   
9. Anthony E. Trojanowski
   Ranking and Listing Algorithms for k-ary Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1978, v:7, n:4, pp:492-509 [Journal]
   
10. Nicholas Pippenger
    Generalized Connectors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:4, pp:510-514 [Journal]
    
11. Andrew Chi-Chih Yao
    On the Loop Switching Addressing Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:4, pp:515-523 [Journal]
    
12. Oscar H. Ibarra
    The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:4, pp:524-532 [Journal]
    
13. Theodore P. Baker
    A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:4, pp:533-541 [Journal]