The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1979, volume: 8, number: 4

  1. James R. Bitner, C. K. Wong
    Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:479-498 [Journal]
  2. Ravindran Kannan, Achim Bachem
    Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:499-507 [Journal]
  3. Lutz Priese
    Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:508-523 [Journal]
  4. A. Bagchi, J. K. Roy
    On V-Optimal Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:524-541 [Journal]
  5. Franco P. Preparata
    A Note on Locating a Set of Points in a Planar Subdivision. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:542-545 [Journal]
  6. James E. Donahue
    On the Semantics of "Data Type". [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:546-560 [Journal]
  7. Richard M. Karp
    A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:561-573 [Journal]
  8. Takumi Kasai, Akeo Adachi, Shigeki Iwata
    Classes of Pebble Games and Complete Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:574-586 [Journal]
  9. Elaine J. Weyuker
    Translatability and Decidability Questions for Restricted Classes of Program Schemas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:587-598 [Journal]
  10. David Maier
    An Efficient Method for Storing Ancestor Information in Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:599-618 [Journal]
  11. Mukkai S. Krishnamoorthy, Narsingh Deo
    Node-Deletion NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:619-625 [Journal]
  12. David K. Probst, Vangalur S. Alagar
    A Family of Algorithms for Powering Sparse Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:626-644 [Journal]
  13. Adi Shamir
    A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:645-655 [Journal]
  14. Teruo Hikita, Akihiro Nozaki
    Corrigenda: A Completeness Criterion for Spectra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:656- [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002