Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Bonnie Berger The Fourth Moment Method. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:4, pp:1188-1207 [Journal ] 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 ] 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 ]