Journals in DBLP

SIAM J. Comput.
1997, volume: 26, number: 4

1. Pesech Feldman, Silvio Micali
   An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:4, pp:873-933 [Journal]
   
2. James A. Storer, John H. Reif
   Error-Resilient Optimal Data Compression. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:4, pp:934-949 [Journal]
   
3. Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter
   Constant-Time Randomized Parallel String Matching. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:4, pp:950-960 [Journal]
   
4. Ganesh Baliga, Sanjay Jain, Arun Sharma
   Learning from Multiple Sources of Inaccurate Data. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:4, pp:961-990 [Journal]
   
5. Michal Walicki, Sigurd Meldal
   Singular and Plural Nondeterministic Parameters. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:4, pp:991-1005 [Journal]
   
6. Guy Louchard, Claire Kenyon, René Schott
   Data Structures' Maxima. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:4, pp:1006-1042 [Journal]
   
7. Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman
   Oracles that Compute Values. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:4, pp:1043-1065 [Journal]
   
8. James R. Driscoll, Dennis M. Healy Jr., Daniel N. Rockmore
   Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:4, pp:1066-1099 [Journal]
   
9. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
   Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:4, pp:1100-1119 [Journal]
   
10. Leonidas J. Guibas, Rajeev Motwani, Prabhakar Raghavan
    The Robot Localization Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1120-1138 [Journal]
    
11. Dalit Naor, Dan Gusfield, Charles U. Martel
    A Fast Algorithm for Optimally Increasing the Edge Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1139-1165 [Journal]
    
12. Dorit Dor, Michael Tarsi
    Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1166-1187 [Journal]
    
13. Bonnie Berger
    The Fourth Moment Method. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1188-1207 [Journal]
    
14. Phillip B. Gibbons, Ephraim Korach
    Testing Shared Memories. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1208-1244 [Journal]
    
15. Alexander V. Karzanov, S. Thomas McCormick
    Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:1245-1275 [Journal]