Journals in DBLP

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

1. M. D. Atkinson, S. Lloyd
   The Ranks of m * n * (mn-2) Tensors. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:4, pp:611-615 [Journal]
   
2. David S. Johnson, Anthony C. Klug
   Optimizing Conjunctive Queries that Contain Untyped Variables. [Citation Graph (11, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:4, pp:616-640 [Journal]
   
3. Leslie G. Valiant, Sven Skyum, S. Berkowitz, Charles Rackoff
   Fast Parallel Computation of Polynomials Using Few Processors. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:4, pp:641-644 [Journal]
   
4. Timothy J. Hickey, Jacques Cohen
   Uniform Random Generation of Strings in a Context-Free Language. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:4, pp:645-655 [Journal]
   
5. Danny Dolev, H. Raymond Strong
   Authenticated Algorithms for Byzantine Agreement. [Citation Graph (2, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:4, pp:656-666 [Journal]
   
6. Wen-Chin Chen, Jeffrey Scott Vitter
   Analysis of Early-Insertion Standard Coalesced Hashing. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:4, pp:667-676 [Journal]
   
7. Stephen L. Bloom, Ralph Tindell
   Varieties of ``if-then-else''. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:4, pp:677-707 [Journal]
   
8. Tat-hung Chan, Oscar H. Ibarra
   On the Space and Time Complexity of Functions Computable by Simple Programs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:4, pp:708-716 [Journal]
   
9. Paul Walton Purdom Jr., Cynthia A. Brown
   An Analysis of Backtracking with Search Rearrangement. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:4, pp:717-733 [Journal]
   
10. John L. Pfaltz
    Convex Clusters in a Discrete m-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:4, pp:734-750 [Journal]
    
11. Nimrod Megiddo, Arie Tamir
    New Results on the Complexity of p-Center Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:4, pp:751-758 [Journal]
    
12. Nimrod Megiddo
    Linear-Time Algorithms for Linear Programming in R³ and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:4, pp:759-776 [Journal]
    
13. J. Scott Provan, Michael O. Ball
    The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:4, pp:777-788 [Journal]
    
14. Debasis Mitra, John A. Morrison
    Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:4, pp:789-802 [Journal]