The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1984, volume: 13, number: 1

  1. Arie de Bruin
    On the Existence of Cook Semantics. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:1-13 [Journal]
  2. Greg N. Frederickson, Donald B. Johnson
    Generalized Selection and Ranking: Sorted Matrices. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:14-30 [Journal]
  3. Martin E. Dyer
    Linear Time Algorithms for Two- and Three-Variable Linear Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:31-45 [Journal]
  4. John H. Reif
    On Synchronous Parallel Computations with Independent Probabilistic Choice. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:46-56 [Journal]
  5. Norman J. Pullman
    Clique Covering of Graphs IV. Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:57-75 [Journal]
  6. Catriel Beeri, Moshe Y. Vardi
    Formal Systems for Tuple and Equality Generating Dependencies. [Citation Graph (20, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:76-98 [Journal]
  7. Stavros S. Cosmadakis, Christos H. Papadimitriou
    The Traveling Salesman Problem with Many Visits to Few Cities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:99-108 [Journal]
  8. Udi Manber, Martin Tompa
    The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:109-115 [Journal]
  9. Dah-Ming W. Chiu, Philip A. Bernstein, Yu-Chi Ho
    Optimizing Chain Queries in a Distributed Database System. [Citation Graph (17, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:116-134 [Journal]
  10. Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer
    Alternating Pushdown and Stack Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:135-155 [Journal]
  11. Maria M. Klawe
    Limitations on Explicit Constructions of Expanding Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:156-166 [Journal]
  12. Prakash V. Ramanan
    Pushdown Permuter Characterization Theorem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:167-169 [Journal]
  13. Donald K. Friesen
    Tighter Bounds for the Multifit Processor Scheduling Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:170-181 [Journal]
  14. Nimrod Megiddo, Kenneth J. Supowit
    On the Complexity of Some Common Geometric Location Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:182-196 [Journal]
  15. Thomas Ottmann, Douglas Stott Parker Jr., Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
    Minimal-Cost Brother Trees. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:197-217 [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