The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Christos H. Papadimitriou
    Concurrency Control by Locking. [Citation Graph (7, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:215-226 [Journal]
  2. Edward G. Coffman Jr., M. R. Garey, David S. Johnson
    Dynamic Bin Packing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:227-258 [Journal]
  3. Patrick C. Fischer, Don-Min Tsou
    Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-Hard. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:259-266 [Journal]
  4. Avra Cohn
    The Equivalence of Two Semantic Definitions: A Case Study in LCF. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:267-285 [Journal]
  5. Rüdiger Loos
    Computing Rational Zeros of Integral Polynomials by p-adic Expansion. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:286-293 [Journal]
  6. Barbara Simons
    Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:294-299 [Journal]
  7. Christian Choffrut, Karel Culik II
    Properties of Finite and Pushdown Transducers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:300-315 [Journal]
  8. Yehoshua Sagiv
    Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions. [Citation Graph (8, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:316-328 [Journal]
  9. Vladimir Lifschitz, Boris Pittel
    The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:329-346 [Journal]
  10. Nimrod Megiddo
    Towards a Genuinely Polynomial Algorithm for Linear Programming. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:347-353 [Journal]
  11. Susanne E. Hambrusch
    VLSI Algorithms for the Connected Component Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:354-365 [Journal]
  12. Jan A. Bergstra, J. V. Tucker
    Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:366-387 [Journal]
  13. Oscar H. Ibarra, Shlomo Moran
    Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:388-394 [Journal]
  14. Markus Lauer
    Generalized p-adic Constructions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:395-410 [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