|
Journals in DBLP
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
|