Journals in DBLP
Zvi Galil , Kunsoo Park An Improved Algorithm for Approximate String Matching. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:989-999 [Journal ] George S. Lueker , Nimrod Megiddo , Vijaya Ramachandran Linear Programming with Two Variables per Inequality in Poly-Log Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:1000-1010 [Journal ] Cynthia Dwork , Larry J. Stockmeyer A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:1011-1023 [Journal ] Kazuo Sugihara , Ichiro Suzuki , Masafumi Yamashita The Searchlight Scheduling Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:1024-1040 [Journal ] D. T. Lee , Majid Sarrafzadeh , Ying-Fung Wu Minimum Cuts for Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:1041-1050 [Journal ] Dany Breslauer , Zvi Galil An Optimal O(log log n) Time Parallel String Matching Algorithm. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:1051-1058 [Journal ] Dima Grigoriev , Marek Karpinski , Michael F. Singer Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:1059-1063 [Journal ] Noga Alon , Mauricio Karchmer , Avi Wigderson Linear Circuits over GF(2). [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:1064-1067 [Journal ] Joel Friedman Random Polynomials and Approximate Zeros of Newton's Method. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:1068-1099 [Journal ] Jack H. Lutz Category and Measure in Complexity Classes. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:1100-1131 [Journal ] Kazuo Murota Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:6, pp:1132-1161 [Journal ]