Journals in DBLP

SIAM J. Comput.
2006, volume: 35, number: 6

1. Klaus Weihrauch, Ning Zhong 0002
   An Algorithm for Computing Fundamental Solutions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:35, n:6, pp:1283-1294 [Journal]
   
2. Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe
   Compact Labeling Scheme for Ancestor Queries. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:35, n:6, pp:1295-1309 [Journal]
   
3. Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla
   Quantum Query Complexity of Some Graph Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:35, n:6, pp:1310-1328 [Journal]
   
4. Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
   The Approximability of Three-valued MAX CSP. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:35, n:6, pp:1329-1349 [Journal]
   
5. Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
   Balanced Allocations: The Heavily Loaded Case. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:35, n:6, pp:1350-1385 [Journal]
   
6. Floris Geerts, Bart Kuijpers, Jan Van den Bussche
   Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:35, n:6, pp:1386-1439 [Journal]
   
7. Hua-Huai Chern, Hsien-Kuei Hwang
   Partial Match Queries in Random k-d Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:35, n:6, pp:1440-1466 [Journal]
   
8. Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
   Power from Random Strings. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:35, n:6, pp:1467-1493 [Journal]
   
9. Christian Worm Mortensen
   Fully Dynamic Orthogonal Range Reporting on RAM. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:35, n:6, pp:1494-1525 [Journal]