The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Raimund Seidel, Micha Sharir
    Top-Down Analysis of Path Compression. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:515-525 [Journal]
  2. Pankaj K. Agarwal, Micha Sharir
    Pseudo-Line Arrangements: Duality, Algorithms, and Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:526-552 [Journal]
  3. Vida Dujmovic, Pat Morin, David R. Wood
    Layout of Graphs with Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:553-579 [Journal]
  4. Artur Czumaj, Christian Sohler
    Abstract Combinatorial Programs and Efficient Property Testers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:580-615 [Journal]
  5. Aris Anagnostopoulos, Adam Kirsch, Eli Upfal
    Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:616-639 [Journal]
  6. Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile
    A Second-Order Perceptron Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:640-668 [Journal]
  7. Ho-Leung Chan, Tak Wah Lam, Kar-Keung To
    Nonmigratory Online Deadline Scheduling on Multiprocessors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:669-682 [Journal]
  8. Huaming Zhang, Xin He
    On Even Triangulations of 2-Connected Embedded Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:683-696 [Journal]
  9. Bala Kalyanasundaram, Kirk Pruhs
    Fault-Tolerant Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:697-719 [Journal]
  10. Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin
    Classifying the Complexity of Constraints Using Finite Algebras. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:720-742 [Journal]
  11. Yumei Huo, Joseph Y.-T. Leung
    Online Scheduling of Precedence Constrained Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:743-762 [Journal]
  12. Jochen Könemann, R. Ravi
    Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:763-773 [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