Journals in DBLP

SIAM J. Comput.
1996, volume: 25, number: 6

1. Martin Kummer
   Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1996, v:25, n:6, pp:1123-1143 [Journal]
   
2. Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn
   An o(n³)-Time Algorithm Maximum-Flow Algorithm. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1996, v:25, n:6, pp:1144-1170 [Journal]
   
3. Miklós Ajtai, Nimrod Megiddo
   A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1996, v:25, n:6, pp:1171-1195 [Journal]
   
4. Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk
   Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1996, v:25, n:6, pp:1196-123 [Journal]
   
5. Jürgen Sellen
   Lower Bounds for Geometrical and Physical Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1996, v:25, n:6, pp:1231-1253 [Journal]
   
6. Nechama Allenberg-Navony, Alon Itai, Shlomo Moran
   Average and Randomized Complexity of Distributed Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1996, v:25, n:6, pp:1254-1267 [Journal]
   
7. Francesco Bergadano, Stefano Varricchio
   Learning Behaviors of Automata from Multiplicity and Equivalence Queries. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1996, v:25, n:6, pp:1268-1280 [Journal]
   
8. Mordecai J. Golin, Neal E. Young
   Prefix Codes: Equiprobable Words, Unequal Letter Costs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1996, v:25, n:6, pp:1281-1292 [Journal]
   
9. David Zuckerman
   On Unapproximable Versions of NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1996, v:25, n:6, pp:1293-1304 [Journal]
   
10. Hans L. Bodlaender
    A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1305-1317 [Journal]
    
11. Alberto Apostolico, Dany Breslauer
    An Optimal O(log log N)-Time Parallel Algorithm for Detecting All Squares in a String. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1318-1331 [Journal]
    
12. Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld
    The Wakeup Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1331-1332 [Journal]
    
13. Dario Bini, Luca Gemignani
    Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1358- [Journal]