Journals in DBLP

SIAM J. Comput.
1985, volume: 14, number: 4

1. Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
   Scheduling File Transfers. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:4, pp:743-780 [Journal]
   
2. Greg N. Frederickson
   Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:4, pp:781-798 [Journal]
   
3. J. Mark Keil
   Decomposing a Polygon into Simpler Components. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:4, pp:799-817 [Journal]
   
4. Appajosyula Satyanarayana, R. Kevin Wood
   A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:4, pp:818-832 [Journal]
   
5. Stephen A. Cook, H. James Hoover
   A Depth-Universal Circuit. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:4, pp:833-839 [Journal]
   
6. Helmut Alt, Kurt Mehlhorn
   Searching Semisorted Tables. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:4, pp:840-848 [Journal]
   
7. Larry J. Stockmeyer
   On Approximation Algorithms for #P. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:4, pp:849-861 [Journal]
   
8. Robert Endre Tarjan, Uzi Vishkin
   An Efficient Parallel Biconnectivity Algorithm. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:4, pp:862-874 [Journal]
   
9. Jeffrey M. Jaffe
   Distributed Multi-Destination Routing: The Constraints of Local Information. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:4, pp:875-888 [Journal]
   
10. Henk Alblas
    Finding Minimal Pass Sequences for Atttibute Grammars. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:889-914 [Journal]
    
11. Ehab S. El-Mallah, Charles J. Colbourn
    Optimum Communication Spanning Trees in Series-Parallel Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:915-925 [Journal]
    
12. Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart
    A Linear Recognition Algorithm for Cographs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:926-934 [Journal]
    
13. Rohit Parikh, Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer
    Equations Between Regular Terms and an Application to Process Logic. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:935-942 [Journal]
    
14. Paul Walton Purdom Jr., Cynthia A. Brown
    The Pure Literal Rule and Polynomial Average Time. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:943-953 [Journal]
    
15. Ulrich Faigle, Gerhard Gierz, Rainer Schrader
    Algorithmic approaches to setup minimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:954-965 [Journal]
    
16. Michael F. Singer, B. David Saunders, B. F. Caviness
    An Extension of Liouville's Theorem on Integration in Finite Terms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:966-990 [Journal]
    
17. Sergiu Hart, Micha Sharir
    Concurrent Probabilistic Programs, Or: How to Schedule if You Must. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:991-1012 [Journal]
    
18. Dan E. Willard
    Searching Unindexed and Nonuniformly Generated Files in log log N Time. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:1013-1029 [Journal]
    
19. Debasis Mitra
    Probabilistic Models and Asymptotic Results for Concurrent Processing with Exclusive and Non-Exclusive Locks. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:1030-1051 [Journal]
    
20. Deepak Kapur, Paliath Narendran
    The Knuth-Bendix Completion Procedure and Thue Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:1052-1072 [Journal]