Journals in DBLP

SIAM J. Comput.
1990, volume: 19, number: 3

1. Burkhard Molzan
   Expressibility and Nonuniform Complexity Classes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1990, v:19, n:3, pp:411-423 [Journal]
   
2. Helmut Seidl
   Deciding Equivalence of Finite Tree Automata. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1990, v:19, n:3, pp:424-437 [Journal]
   
3. Etienne Grandjean
   A Nontrivial Lower Bound for an NP Problem on Automata. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1990, v:19, n:3, pp:438-451 [Journal]
   
4. Nader H. Bshouty, Michael Kaminski
   Multiplication of Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1990, v:19, n:3, pp:452-456 [Journal]
   
5. Yinyu Ye
   A Class of Projective Transformations for Linear Programming. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1990, v:19, n:3, pp:457-466 [Journal]
   
6. Nader H. Bshouty
   Maximal Rank of m x n x (mn - k) Tensors. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1990, v:19, n:3, pp:467-471 [Journal]
   
7. Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer
   Flipping Persuasively in Constant Time. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1990, v:19, n:3, pp:472-499 [Journal]
   
8. David Eppstein
   Reset Sequences for Monotonic Automata. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1990, v:19, n:3, pp:500-510 [Journal]
   
9. Maciej Liskiewicz, Krzysztof Lorys
   Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1990, v:19, n:3, pp:511-521 [Journal]
   
10. Richard Beigel
    Unbounded Searching Slgorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:522-537 [Journal]
    
11. Takis Sakkalis
    The Euclidean Algorithm and the Degree of the Gauss Map. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:538-543 [Journal]
    
12. Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg
    Group Action Graphs and Parallel Architectures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:544-569 [Journal]
    
13. Alan Wagner, Derek G. Corneil
    Embedding Trees in a Hypercube is NP-Complete. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:570-590 [Journal]
    
14. Vijay K. Vaishnavi
    Erratum: Weighted Leaf AVL-Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:591- [Journal]