Journals in DBLP

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

1. Herbert Edelsbrunner, Leonidas J. Guibas, Jorge Stolfi
   Optimal Point Location in a Monotone Subdivision. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:2, pp:317-340 [Journal]
   
2. Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel
   Constructing Arrangements of Lines and Hyperplanes with Applications. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:2, pp:341-363 [Journal]
   
3. Lenore Blum, Manuel Blum, Mike Shub
   A Simple Unpredictable Pseudo-Random Number Generator. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:2, pp:364-383 [Journal]
   
4. Lenore Blum, Mike Shub
   Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:2, pp:384-398 [Journal]
   
5. Pekka Orponen, David A. Russo, Uwe Schöning
   Optimal Approximations and Polynomially Levelable Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:2, pp:399-408 [Journal]
   
6. John L. Bruno, Peter J. Downey
   Probabilistic Bounds on the Performance of List Scheduling. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:2, pp:409-417 [Journal]
   
7. Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà
   Minimal Representation of Directed Hypergraphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:2, pp:418-431 [Journal]
   
8. Joachim von zur Gathen
   Representations and Parallel Computations for Rational Functions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:2, pp:432-452 [Journal]
   
9. Wolfgang Maass
   On the Complexity of Nonconvex Covering. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1986, v:15, n:2, pp:453-467 [Journal]
   
10. Dan E. Willard
    Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:468-477 [Journal]
    
11. Hiroshi Imai, Takao Asano
    Efficient Algorithms for Geometric Graph Search Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:478-494 [Journal]
    
12. Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito
    Planar Multicommodity Flows, Maximum Matchings and Negative Cycles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:495-510 [Journal]
    
13. John G. Geske, Joachim Grollmann
    Relativizations of Unambiguous and Random Polynomial Time Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:511-519 [Journal]
    
14. Carl Langenhop, William E. Wright
    Probabilities Related to Father-Son Distances in Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:520-530 [Journal]
    
15. Leslie G. Valiant
    Negation is Powerless for Boolean Slice Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:531-535 [Journal]
    
16. Alan M. Frieze
    On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:536-539 [Journal]
    
17. Robert Alan Wright, L. Bruce Richmond, Andrew M. Odlyzko, Brendan D. McKay
    Constant Time Generation of Free Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:540-548 [Journal]
    
18. Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul
    Bounds for Width Two Branching Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:549-560 [Journal]
    
19. Jonathan S. Turner
    On the Probable Performance of Heuristics for Bandwidth Minimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:561-580 [Journal]
    
20. Dung T. Huynh
    The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:581-594 [Journal]
    
21. Rodney W. Johnson, Aileen M. McLoughlin
    Noncommutative Bilinear Algorithms for 3 x 3 Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:595-603 [Journal]
    
22. Francine Berman, Mary Ellen Bock, Eric Dittert, Michael J. O'Donnell, Darrell Plank
    Collections of Functions for Perfect Hashing. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:604-618 [Journal]
    
23. Joan Feigenbaum, Alejandro A. Schäffer
    Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:619-627 [Journal]