The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
2005, volume: 34, number: 4

  1. Alon Efrat
    The Complexity of the Union of (alpha, beta)-Covered Objects. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:775-787 [Journal]
  2. Martin Skutella, Marc Uetz
    Stochastic Machine Scheduling with Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:788-802 [Journal]
  3. Moses Charikar, Sudipto Guha
    Improved Combinatorial Algorithms for Facility Location Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:803-824 [Journal]
  4. Derek G. Corneil, Udi Rotics
    On the Relationship Between Clique-Width and Treewidth. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:825-847 [Journal]
  5. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:848-862 [Journal]
  6. Vladlen Koltun, Micha Sharir
    Curve-Sensitive Cuttings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:863-878 [Journal]
  7. Timothy M. Chan
    Low-Dimensional Linear Programming with Violations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:879-893 [Journal]
  8. Richard Cole, Ramesh Hariharan
    Dynamic LCA Queries on Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:894-923 [Journal]
  9. Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu
    Orderly Spanning Trees with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:924-945 [Journal]
  10. Anna Gál, Adi Rosén
    Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:946-959 [Journal]
  11. Michael Kaminski
    A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:960-992 [Journal]
  12. Grzegorz Malewicz
    A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:993-1024 [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