Journals in DBLP

SIAM J. Comput.
1993, volume: 22, number: 6

1. Tao Jiang, Bala Ravikumar
   Minimal NFA Problems are Hard. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1993, v:22, n:6, pp:1117-1141 [Journal]
   
2. Jiazhen Cai, Xiaofeng Han, Robert Endre Tarjan
   An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1993, v:22, n:6, pp:1142-1162 [Journal]
   
3. Oded Goldreich, Hugo Krawczyk, Michael Luby
   On the Existence of Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1993, v:22, n:6, pp:1163-1175 [Journal]
   
4. Wojciech Szpankowski
   A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1993, v:22, n:6, pp:1176-1198 [Journal]
   
5. David R. Karger, Daphne Koller, Steven J. Phillips
   Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1993, v:22, n:6, pp:1199-1217 [Journal]
   
6. Xin He
   On Finding the Rectangular Duals of Planar Triangular Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1993, v:22, n:6, pp:1218-1226 [Journal]
   
7. Victor Y. Pan, John H. Reif
   Fast and Efficient Parallel Solution of Sparse Linear Systems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1993, v:22, n:6, pp:1227-1250 [Journal]
   
8. Wansoo T. Rhee, Michel Talagrand
   On-Line Bin Packing of Items of Random Sizes, II. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1993, v:22, n:6, pp:1251-1256 [Journal]
   
9. Ricard Gavaldà, Osamu Watanabe
   On the Computational Complexity of Small Descriptions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1993, v:22, n:6, pp:1257-1275 [Journal]
   
10. Marek Karpinski, Thorsten Werther
    VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1276-1285 [Journal]
    
11. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
    Computing a Face in an Arrangement of Line Segments and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1286-1302 [Journal]
    
12. Bo Chen
    A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1303-1318 [Journal]
    
13. Jiang-Hsing Chu, Gary D. Knott
    A New Method for Computing Page-Fault Rates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1319-1330 [Journal]
    
14. Eyal Kushilevitz, Yishay Mansour
    Learning Decision Trees Using the Fourier Spectrum. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1331-1348 [Journal]
    
15. Richard Cole
    Correction: Parallel Merge Sort. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1349- [Journal]