Journals in DBLP

SIAM J. Comput.
1981, volume: 10, number: 3

1. Alfred V. Aho, Yehoshua Sagiv, Thomas G. Szymanski, Jeffrey D. Ullman
   Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. [Citation Graph (3, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:3, pp:405-421 [Journal]
   
2. L. Gotlieb
   Optimal Multi-Way Search Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:3, pp:422-433 [Journal]
   
3. Arnold Schönhage
   Partial and Total Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:3, pp:434-455 [Journal]
   
4. Richard Schroeppel, Adi Shamir
   A T=O(2^(n/2)), S=O(2^(n/4)) Algorithm for Certain NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:3, pp:456-464 [Journal]
   
5. Roland Häggkvist, Pavol Hell
   Parallel Sorting with Constant Time for Comparisons. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:3, pp:465-472 [Journal]
   
6. Franco P. Preparata
   A New Approach to Planar Point Location. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:3, pp:473-482 [Journal]
   
7. Hermann A. Maurer, Arto Salomaa, Derick Wood
   Uniform Interpretations of Grammar Forms. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:3, pp:483-502 [Journal]
   
8. Brian H. Mayoh
   Attribute Grammars and Mathematical Semantics. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:3, pp:503-518 [Journal]
   
9. Amir Pnueli, Giora Slutzki
   Automatic Programming of Finite State Linear Programs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:3, pp:519-535 [Journal]
   
10. Andrzej Ehrenfeucht, Rohit Parikh, Grzegorz Rozenberg
    Pumping Lemmas for Regular Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:536-541 [Journal]
    
11. Christos H. Papadimitriou
    Worst-Case and Probabilistic Analysis of a Geometric Location Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:542-557 [Journal]
    
12. James R. Bitner, Shou-Hsuan Stephen Huang
    Key Comparison Optimal 2-3 Trees with Maximum Utilization. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:558-570 [Journal]
    
13. Igal Golan
    Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:571-582 [Journal]
    
14. Cynthia A. Brown, Paul Walton Purdom Jr.
    An Average Time Analysis of Backtracking. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:583-593 [Journal]
    
15. Sam Toueg, Jeffrey D. Ullman
    Deadlock-Free Packet Switching Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:594-611 [Journal]
    
16. Stephen A. Cook
    Corrigendum: Soundness and Completeness of an Axiom System for Program Verification. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:612- [Journal]
    
17. Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda
    Exegesis of Self-Organizing Linear Search. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:613-637 [Journal]
    
18. Peter J. Downey, Benton L. Leong, Ravi Sethi
    Computing Sequences with Addition Chains. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:638-646 [Journal]
    
19. Catriel Beeri, Peter Honeyman
    Preserving Functional Dependencies. [Citation Graph (9, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:647-656 [Journal]