Journals in DBLP

SIAM J. Comput.
1998, volume: 27, number: 5

1. Edward G. Coffman Jr., Nabil Kahale, Frank Thomson Leighton
   Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:27, n:5, pp:1221-1236 [Journal]
   
2. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
   Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:27, n:5, pp:1237-1261 [Journal]
   
3. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
   Approximately Counting Hamilton Paths and Cycles in Dense Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:27, n:5, pp:1262-1272 [Journal]
   
4. Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
   A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:27, n:5, pp:1273-1282 [Journal]
   
5. Mikael Goldmann, Johan Håstad
   Monotone Circuits for Connectivity Have Depth (log n)^2-o(1). [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:27, n:5, pp:1283-1294 [Journal]
   
6. Christian Heckler, Lothar Thiele
   Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:27, n:5, pp:1295-1302 [Journal]
   
7. Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman
   On the Fault Tolerance of Some Popular Bounded-Degree Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:27, n:5, pp:1303-1333 [Journal]
   
8. Robert Beals, Tetsuro Nishino, Keisuke Tanaka
   On the Complexity of Negation-Limited Boolean Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:27, n:5, pp:1334-1347 [Journal]
   
9. Joseph Gil, Yossi Matias
   Simple Fast Parallel Hashing by Oblivious Execution. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:27, n:5, pp:1348-1375 [Journal]
   
10. Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno
    A Filter Model for Concurrent lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1376-1419 [Journal]
    
11. Richard Beigel, Judy Goldsmith
    Downward Separation Fails Catastrophically for Limited Nondeterminism Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1420-1429 [Journal]
    
12. Mitsunori Ogihara
    The PL Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1430-1437 [Journal]
    
13. Guy Kortsarz, David Peleg
    Generating Low-Degree 2-Spanners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1438-1456 [Journal]
    
14. Cynthia Dwork, Joseph Y. Halpern, Orli Waarts
    Performing Work Efficiently in the Presence of Faults. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1457-1491 [Journal]
    
15. Jeff Edmonds
    Time-Space Tradeoffs For Undirected st-Connectivity on a Graph Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1492-1513 [Journal]