The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
2005, volume: 35, number: 2

  1. Petr Hlinený
    A Parametrized Algorithm for Matroid Branch-Width. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:259-277 [Journal]
  2. Susanne Albers, Markus Schmidt
    On the Performance of Greedy Algorithms in Packet Buffering. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:278-304 [Journal]
  3. Costas Busch, Srikanta Tirthapura
    Analysis of Link Reversal Routing Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:305-326 [Journal]
  4. Ketan Dalal, Luc Devroye, Ebrahim Malalla, Erin McLeis
    Two-Way Chaining with Reassignment. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:327-340 [Journal]
  5. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Cache-Oblivious B-Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:341-358 [Journal]
  6. Gyung-Ok Lee, Kwang-Moo Choe
    A Powerful LL(k) Covering Transformation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:359-377 [Journal]
  7. Roberto Grossi, Jeffrey Scott Vitter
    Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:378-407 [Journal]
  8. Joel Friedman, Andreas Goerdt, Michael Krivelevich
    Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:408-430 [Journal]
  9. Leah Epstein, Rob van Stee
    Optimal Online Algorithms for Multidimensional Packing Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:431-448 [Journal]
  10. April Rasala Lehman, Gordon T. Wilfong
    http: //epubs.siam.org/SICOMP/volume-35/art_43425.html. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:449-485 [Journal]
  11. Leslie Ann Goldberg, Russell A. Martin, Mike Paterson
    Strong Spatial Mixing with Fewer Colors for Lattice Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:486-517 [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