Journals in DBLP

SIAM J. Comput.
2003, volume: 32, number: 5

1. David Fernández-Baca, Jens Lagergren
   A Polynomial-Time Algorithm for Near-Perfect Phylogeny. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:5, pp:1115-1127 [Journal]
   
2. Martin Kochol, Vadim V. Lozin, Bert Randerath
   The 3-Colorability Problem on Graphs with Maximum Degree Four. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:5, pp:1128-1139 [Journal]
   
3. Scott Aaronson
   Algorithms for Boolean Function Query Properties. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:5, pp:1140-1157 [Journal]
   
4. Michal Parnas, Dana Ron, Ronitt Rubinfeld
   On Testing Convexity and Submodularity. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:5, pp:1158-1184 [Journal]
   
5. Amir Shpilka
   Lower Bounds for Matrix Product. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:5, pp:1185-1200 [Journal]
   
6. Jian Shen, Li Sheng, Jie Wu
   Searching for Sorted Sequences of Kings in Tournaments. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:5, pp:1201-1209 [Journal]
   
7. Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma
   An Optimal Algorithm for Checking Regularity. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:5, pp:1210-1235 [Journal]
   
8. Jack H. Lutz
   Dimension in Complexity Classes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:5, pp:1236-1259 [Journal]
   
9. Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg
   The Natural Work-Stealing Algorithm is Stable. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2003, v:32, n:5, pp:1260-1279 [Journal]
   
10. Markus Püschel, José M. F. Moura
    The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1280-1316 [Journal]
    
11. Sanjeev Arora, George Karakostas
    Approximation Schemes for Minimum Latency Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1317-1337 [Journal]
    
12. Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick
    Reachability and Distance Queries via 2-Hop Labels. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1338-1355 [Journal]
    
13. Ran Raz
    On the Complexity of Matrix Product. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1356-1369 [Journal]
    
14. Joseph Y.-T. Leung, Michael Pinedo
    Minimizing Total Completion Time on Parallel Machines with Deadline Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1370-1388 [Journal]
    
15. Oliver Glier
    Kolmogorov Complexity and Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1389-1394 [Journal]