Journals in DBLP

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

1. Géraud Sénizergues
   The Bisimulation Problem for Equational Graphs of Finite Out-Degree. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:34, n:5, pp:1025-1106 [Journal]
   
2. Jeffrey C. Jackson, Rocco A. Servedio
   Learning Random Log-Depth Decision Trees under Uniform Distribution. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:34, n:5, pp:1107-1128 [Journal]
   
3. Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
   A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:34, n:5, pp:1129-1146 [Journal]
   
4. Eldar Fischer
   The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:34, n:5, pp:1147-1158 [Journal]
   
5. Kousha Etessami, Thomas Wilke, Rebecca A. Schuller
   Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:34, n:5, pp:1159-1175 [Journal]
   
6. Arfst Nickelsen, Till Tantau
   The Complexity of Finding Paths in Graphs with Bounded Independence Number. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:34, n:5, pp:1176-1195 [Journal]
   
7. Amos Beimel, Enav Weinreb
   Separating the Power of Monotone Span Programs over Different Fields. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:34, n:5, pp:1196-1215 [Journal]
   
8. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
   Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:34, n:5, pp:1216-1252 [Journal]
   
9. Annalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro
   Optimal Two-Stage Algorithms for Group Testing Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:34, n:5, pp:1253-1270 [Journal]
   
10. Frank Kwang-Ming Hwang, Yong He, Yang Wang
    Strictly Nonblocking Multirate log_d(N, m, p) Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:5, pp:1271-1278 [Journal]