Journals in DBLP
Pavel Pudlák , Vojtech Rödl , Jiri Sgall Boolean Circuits, Tensor Ranks, and Communication Complexity. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:605-633 [Journal ] Lane A. Hemaspaandra , Jörg Rothe Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:634-653 [Journal ] Shai Mohaban , Micha Sharir Ray Shooting Amidst Spheres in Three Dimensions and Related Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:654-674 [Journal ] Carsten Thomassen On the Complexity of Finding a Minimum Cycle Cover of a Graph. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:675-677 [Journal ] Akiyoshi Shioura , Akihisa Tamura , Takeaki Uno An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:678-692 [Journal ] Russell Impagliazzo , Ramamohan Paturi , Michael E. Saks Size-Depth Tradeoffs for Threshold Circuits. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:693-707 [Journal ] Wolfgang Maass Bounds for the Computational Power and Learning Complexity of Analog Neural Nets. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:708-732 [Journal ] Liming Cai , Jianer Chen On the Amount of Nondeterminism and the Power of Verifying. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:733-750 [Journal ] Hans-Ulrich Simon Bounds on the Number of Examples Needed for Learning Functions. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:751-763 [Journal ] Stefano Varricchio A Pumping Condition for Regular Sets. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:764-771 [Journal ] Gurdip Singh Leader Election in Complete Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:772-785 [Journal ] Xiaotie Deng , Sanjeev Mahajan The Cost of Derandomization: Computability or Competitiveness. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:786-802 [Journal ] Richard Cole , Ramesh Hariharan Tighter Upper Bounds on the Exact Complexity of String Matching. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:803-856 [Journal ] Al Borchers , Ding-Zhu Du The k-Steiner Ratio in Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:857-869 [Journal ] R. Chandrasekaran , Bo Chen , Gábor Galambos , P. R. Narayanan , André van Vliet A Note on ``An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling''. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:870-872 [Journal ]