Journals in DBLP

SIAM J. Comput.
1986, volume: 15, number: 3

1. Philippe Flajolet, Helmut Prodinger
   Register Allocation for Unary-Binary Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:3, pp:629-640 [Journal]
   
2. Joel Friedman
   Constructing O(n log n) Size Monotone Formulae for the k-th Threshold Function of n Boolean Variables. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:3, pp:641-654 [Journal]
   
3. Robert W. Irving, Paul Leather
   The Complexity of Counting Stable Marriages. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:3, pp:655-667 [Journal]
   
4. Claudio Citrini, Stefano Crespi-Reghizzi, Dino Mandrioli
   On Deterministic Multi-Pass Analysis. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:3, pp:668-693 [Journal]
   
5. J. Scott Provan
   The Complexity of Reliability Computations in Planar and Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:3, pp:694-702 [Journal]
   
6. Bernard Chazelle
   Filtering Search: A New Approach to Query-Answering. [Citation Graph (7, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:3, pp:703-724 [Journal]
   
7. Martin E. Dyer
   On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:3, pp:725-738 [Journal]
   
8. José L. Balcázar, Ronald V. Book, Uwe Schöning
   Sparse Sets, Lowness and Highness. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:3, pp:739-747 [Journal]
   
9. Philippe Flajolet, Robert Sedgewick
   Digital Search Trees Revisited. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:3, pp:748-767 [Journal]
   
10. John E. Hopcroft, Gordon T. Wilfong
    Reducing Multiple Object Motion Planning to Graph Searching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:768-785 [Journal]
    
11. Friedrich Otto
    Church-Rosser Thue Systems that Present Free Monoids. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:786-792 [Journal]
    
12. Frank Thomson Leighton, Arnold L. Rosenberg
    Three-Dimensional Circuit Layouts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:793-813 [Journal]
    
13. Justin R. Smith
    Parallel Algorithms for Depth-First Searches I. Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:814-830 [Journal]
    
14. Harry B. Hunt III, Daniel J. Rosenkrantz
    Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:831-850 [Journal]
    
15. Benjamin Arazi
    A Binary Search with a Parallel Recovery of the Bits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:851-855 [Journal]
    
16. Richard Hull
    Relative Information Capacity of Simple Relational Database Schemata. [Citation Graph (38, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:856-886 [Journal]
    
17. Jeffrey H. Kingston
    Analysis of Henriksen's Algorithm for the Simulation Event Set. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:887-902 [Journal]