Journals in DBLP

SIAM J. Comput.
1981, volume: 10, number: 2

1. Lawrence Flon, Norihisa Suzuki
   The Total Correctness of Parallel Programs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:2, pp:227-246 [Journal]
   
2. Naoki Katoh, Toshihide Ibaraki, H. Mine
   An Algorithm for Finding K Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:2, pp:247-255 [Journal]
   
3. M. R. Garey, David S. Johnson, Barbara B. Simons, Robert Endre Tarjan
   Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:2, pp:256-269 [Journal]
   
4. Greg N. Frederickson, Joseph JáJá
   Approximation Algorithm for Several Graph Augmentation Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:2, pp:270-283 [Journal]
   
5. Luc Boasson, Bruno Courcelle, Maurice Nivat
   The Rational Index: A Complexity Measure for Languages. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:2, pp:284-296 [Journal]
   
6. Mihalis Yannakakis
   Edge-Deletion Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:2, pp:297-309 [Journal]
   
7. Mihalis Yannakakis
   Node-Deletion Problems on Bipartite Graphs. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:2, pp:310-327 [Journal]
   
8. Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran
   An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:2, pp:328-337 [Journal]
   
9. George S. Lueker
   Optimization Problems on Graphs with Independent Random Edge Weights. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:2, pp:338-351 [Journal]
   
10. Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman
    Equivalence of Relational Database Schemes. [Citation Graph (24, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:352-370 [Journal]
    
11. Claus-Peter Schnorr
    An Extension of Strassen's Degree Bound. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:371-382 [Journal]
    
12. Juris Hartmanis, Stephen R. Mahaney
    Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:383-390 [Journal]
    
13. Andrzej Proskurowski
    Recursive Graphs, Recursive Labelings and Shortest Paths. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:391-397 [Journal]
    
14. Andrew Chi-Chih Yao
    An Analysis of a Memory Allocation Scheme for Implementing Stacks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:398-403 [Journal]