Journals in DBLP

SIAM J. Comput.
1989, volume: 18, number: 3

1. Edward P. F. Chan
   A Design Theory for Solving the Anomalies Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:3, pp:429-448 [Journal]
   
2. Shouwen Tang, Osamu Watanabe
   On Tally Relativizations of BP-Complexity Classes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:3, pp:449-462 [Journal]
   
3. Shuo-Yen Robert Li
   Dynamic Programming by Exchangeability. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:3, pp:463-472 [Journal]
   
4. Wansoo T. Rhee, Michel Talagrand
   Optimal Bin Packing with Items of Random Sizes III. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:3, pp:473-486 [Journal]
   
5. Wansoo T. Rhee, Michel Talagrand
   Optimal Bin Covering with Items of Random Size. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:3, pp:487-498 [Journal]
   
6. Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
   Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:3, pp:499-532 [Journal]
   
7. H. Venkateswaran, Martin Tompa
   A New Pebble Game That Characterizes Parallel Complexity Classes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:3, pp:533-549 [Journal]
   
8. Merrick L. Furst, Ravi Kannan
   Succinct Certificates for Almost All Subset Sum Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:3, pp:550-558 [Journal]
   
9. Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
   Two Applications of Inductive Counting for Complementation Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:3, pp:559-578 [Journal]
   
10. Francisco Barahona, Éva Tardos
    Note on Weintraub's Minimum-Cost Circulation Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:579-583 [Journal]
    
11. Michael Clausen
    Fast Fourier Transforms for Metabelian Groups. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:584-593 [Journal]
    
12. Sanguthevar Rajasekaran, John H. Reif
    Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:594-607 [Journal]
    
13. Graham H. Norton
    Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for GF(q)[x]. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:608-624 [Journal]
    
14. Neil Immerman
    Expressibility and Parallel Complexity. [Citation Graph (6, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:625-638 [Journal]