Journals in DBLP

SIAM J. Comput.
1994, volume: 23, number: 3

1. Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
   Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:3, pp:449-465 [Journal]
   
2. Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos
   Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:3, pp:466-487 [Journal]
   
3. Ming-Jye Sheu, Timothy J. Long
   The Extended Low Hierarchy is an Infinite Hierarchy. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:3, pp:488-509 [Journal]
   
4. Donald B. Johnson, Larry Raab
   Complexity of Network Reliability and Optimal Resource Placement Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:3, pp:510-519 [Journal]
   
5. Jitender S. Deogun, George Steiner
   Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:3, pp:520-552 [Journal]
   
6. Victor Pestien, Subramanian Ramakrishnan, Dilip Sarkar
   Packet Transmission in a Noisy-Channel Ring Network. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:3, pp:553-562 [Journal]
   
7. Jin-yi Cai, Richard J. Lipton
   Subquadratic Simulations of Balanced Formulae by Branching Programs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:3, pp:563-572 [Journal]
   
8. Etienne Grandjean
   Linear Time Algorithms and NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:3, pp:573-597 [Journal]
   
9. Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
   Digital Search Trees Again Revisited: The Internal Path Length Perspective. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1994, v:23, n:3, pp:598-616 [Journal]
   
10. David B. Shmoys, Clifford Stein, Joel Wein
    Improved Approximation Algorithms for Shop Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:617-632 [Journal]
    
11. John H. Reif, Sandeep Sen
    Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:633-651 [Journal]
    
12. Paul Beame, Martin Tompa, Peiyuan Yan
    Communication-Space Tradeoffs for Unrestricted Protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:652-661 [Journal]
    
13. Bertrand Braschi, Denis Trystram
    A New Insight into the Coffman-Graham Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:662-669 [Journal]