Journals in DBLP

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

1. Eliezer Dekel, David Nassimi, Sartaj Sahni
   Parallel Matrix and Graph Algorithms. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:4, pp:657-675 [Journal]
   
2. Edward M. Reingold, Robert Endre Tarjan
   On a Greedy Heuristic for Complete Matching. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:4, pp:676-681 [Journal]
   
3. Carla D. Savage, Joseph JáJá
   Fast, Efficient Parallel Algorithms for Some Graph Problems. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:4, pp:682-691 [Journal]
   
4. Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi
   Information Dissemination in Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:4, pp:692-701 [Journal]
   
5. Sam Toueg, Kenneth Steiglitz
   Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:4, pp:702-712 [Journal]
   
6. Ian Holyer
   The NP-Completeness of Some Edge-Partition Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:4, pp:713-717 [Journal]
   
7. Ian Holyer
   The NP-Completeness of Edge-Coloring. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:4, pp:718-720 [Journal]
   
8. Azad Bolour
   Optimal Retrieval Algorithms for Small Region Queries. [Citation Graph (3, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:4, pp:721-741 [Journal]
   
9. Charles Rackoff, Joel I. Seiferas
   Limitations on Separating Nondeterministic Complexity Classes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:4, pp:742-745 [Journal]
   
10. Alon Itai, Richard J. Lipton, Christos H. Papadimitriou, Michael Rodeh
    Covering Graphs by Simple Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:746-750 [Journal]
    
11. Philip A. Bernstein, Nathan Goodman
    Power of Natural Semijoins. [Citation Graph (34, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:751-771 [Journal]
    
12. Kari-Jouko Räihä, Esko Ukkonen
    Minimizing the Number of Evaluation Passes for Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:772-786 [Journal]
    
13. Ker-I Ko, Daniel J. Moore
    Completeness, Approximation and Density. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:787-796 [Journal]
    
14. Maciej M. Syslo
    An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:797-808 [Journal]
    
15. Amnon Barak, Peter J. Downey
    Distributed Processor Scheduling and User Countermeasures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:809-819 [Journal]