Journals in DBLP

SIAM J. Comput.
1983, volume: 12, number: 3

1. Yaacov Yesha
   On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:3, pp:411-425 [Journal]
   
2. David M. Choy, C. K. Wong
   Construction of Optimal alpha-beta Leaf Trees with Applications to Prefix Code and Information Retrieval. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:3, pp:426-446 [Journal]
   
3. Charles E. Leiserson, Ron Y. Pinter
   Optimal Placement for River Routing. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:3, pp:447-462 [Journal]
   
4. Michael C. Loui
   Optimal Dynamic Embedding of Trees into Arrays. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:3, pp:463-472 [Journal]
   
5. Erich Kaltofen, David R. Musser, B. David Saunders
   A Generalized Class of Polynomials that are Hard to Factor. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:3, pp:473-483 [Journal]
   
6. Jacob E. Goodman, Richard Pollack
   Multidimensional Sorting. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:3, pp:484-507 [Journal]
   
7. Brenda S. Baker, Jerald S. Schwarz
   Shelf Algorithms for Two-Dimensional Packing Problems. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:3, pp:508-525 [Journal]
   
8. John H. Rowland, Leslie E. Shader
   On the Selection of Test Data for Vector-Valued Recursive Subroutines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:3, pp:526-538 [Journal]
   
9. Hisao Yamada, Masatosi Imori
   One Step Transformation of Periodic Sequences by Cellular Automata. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:3, pp:539-550 [Journal]
   
10. Trevor I. Fenner, George Loizou
    Tree Traversal Related Algorithms for Generating Integer Partitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:551-564 [Journal]
    
11. Alan L. Selman, Xu Mei-Rui, Ronald V. Book
    Positive Relativizations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:565-579 [Journal]
    
12. Esko Ukkonen
    Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:580-587 [Journal]
    
13. Peter A. Bloniarz
    A Shortest-Path Algorithm with Expected Time O(n² log n log* n). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:588-600 [Journal]
    
14. David G. Kirkpatrick, Pavol Hell
    On the Complexity of General Graph Factor Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:601-609 [Journal]