The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1977, volume: 6, number: 3

  1. Bruce D. Russell
    Implementation Correctness Involving a Language with goto Statements. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:403-415 [Journal]
  2. M. R. Garey, David S. Johnson
    Two-Processor Scheduling with Start-Times and Deadlines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:416-426 [Journal]
  3. Wolfgang J. Paul
    A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:427-443 [Journal]
  4. Zvi Galil
    On Resolution with Clauses of Bounded Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:444-459 [Journal]
  5. Yoshihide Igarashi
    The Tape Complexity of Some Classes of Szilard Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:460-466 [Journal]
  6. Richard E. Ladner
    The Computational Complexity of Provability in Systems of Modal Propositional Logic. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:467-480 [Journal]
  7. Donald L. Adolphson, G. N. Thomas
    A Linear Time Algorithm for a 2 × n Transportation Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:481-486 [Journal]
  8. Joel I. Seiferas
    Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:487-504 [Journal]
  9. Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi, Isao Shirakawa
    A New Algorithm for Generating All the Maximal Independent Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:505-517 [Journal]
  10. Shui Lam, Ravi Sethi
    Worst Case Analysis of Two Scheduling Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:518-536 [Journal]
  11. Robert Endre Tarjan, Anthony E. Trojanowski
    Finding a Maximum Independent Set. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:537-546 [Journal]
  12. Erik Meineche Schmidt, Thomas G. Szymanski
    Succinctness of Descriptions of Unambiguous Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:547-553 [Journal]
  13. Francis Y. L. Chin
    The Partial Fraction Expansion Problem and Its Inverse. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:554-562 [Journal]
  14. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
    An Analysis of Several Heuristics for the Traveling Salesman Problem. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:563-581 [Journal]
  15. H. T. Kung, D. M. Tong
    Fast Algorithms for Partial Fraction Decomposition. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:582-593 [Journal]
  16. D. T. Lee, Franco P. Preparata
    Location of a Point in a Planar Subdivision and Its Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:594-606 [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