Journals in DBLP
Amihood Amir , Yonatan Aumann , Moshe Lewenstein , Ely Porat Function Matching. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1007-1022 [Journal ] Sean Curran , Orlando Lee , Xingxing Yu Finding Four Independent Trees . [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1023-1058 [Journal ] Holger Petersen , John Michael Robson Efficient Simulations by Queue Machines. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1059-1069 [Journal ] Julia Kempe , Alexei Kitaev , Oded Regev The Complexity of the Local Hamiltonian Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1070-1097 [Journal ] Jesper Jansson , Nguyen Bao Nguyen , Wing-Kin Sung Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1098-1121 [Journal ] Karl-Heinz Niggl , Henning Wunderlich Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1122-1147 [Journal ] Sariel Har-Peled , Manor Mendel Fast Construction of Nets in Low-Dimensional Metrics and Their Applications. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1148-1184 [Journal ] Omer Reingold , Ronen Shaltiel , Avi Wigderson Extracting Randomness via Repeated Condensing. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1185-1209 [Journal ] Markus Lohrey Word Problems and Membership Problems on Compressed Words. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1210-1240 [Journal ] Maurice Queyranne , Andreas S. Schulz Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1241-1253 [Journal ] Moni Naor , Benny Pinkas Oblivious Polynomial Evaluation. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2006, v:35, n:5, pp:1254-1281 [Journal ]