Journals in DBLP

SIAM J. Comput.
1994, volume: 23, number: 5

1. Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal
   Diagnosis of t/(t+1)-Diagnosable Systems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:5, pp:895-905 [Journal]
   
2. Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert Endre Tarjan
   Improved Algorithms for Bipartite Network Flow. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:5, pp:906-933 [Journal]
   
3. Victor Y. Pan
   New Resultant Inequalities and Complex Polynomial Factorization. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:5, pp:934-950 [Journal]
   
4. Jeffery Westbrook
   Randomized Algorithms for Multiprocessor Page Migration. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:5, pp:951-965 [Journal]
   
5. Andrew Chi-Chih Yao
   Near-Optimal Time-Space Tradeoff for Element Distinctness. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:5, pp:966-975 [Journal]
   
6. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
   Existence and Construction of Edge-Disjoint Paths on Expander Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:5, pp:976-989 [Journal]
   
7. Avrim Blum
   Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:5, pp:990-1000 [Journal]
   
8. Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal
   Computing with Noisy Information. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:5, pp:1001-1018 [Journal]
   
9. Ding-Zhu Du, Haesun Park
   On Competitive Group Testing. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:5, pp:1019-1025 [Journal]
   
10. Eric Allender, Vivek Gore
    A Uniform Circuit Lower Bound for the Permanent. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:1026-1049 [Journal]
    
11. William Lew, Hosam M. Mahmoud
    The Joint Distribution of Elastic Buckets in Multiway Search Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:1050-1074 [Journal]
    
12. Richard Cole
    Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:1075-1091 [Journal]