Journals in DBLP

SIAM J. Comput.
1989, volume: 18, number: 2

1. Thomas Lickteig
   A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:2, pp:209-215 [Journal]
   
2. Gianfranco Bilardi, Alexandru Nicolau
   Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:2, pp:216-228 [Journal]
   
3. David Peleg, Eli Upfal
   The Token Distribution Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:2, pp:229-243 [Journal]
   
4. Jing-Jang Hwang, Yuan-Chieh Chow, Frank D. Anger, Chung-Yee Lee
   Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:2, pp:244-257 [Journal]
   
5. Noga Alon, Yossi Azar
   Finding an Approximate Maximum. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:2, pp:258-267 [Journal]
   
6. Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman
   Bounds on Universal Sequences. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:2, pp:268-277 [Journal]
   
7. J. Michael Steele, Timothy Law Snyder
   Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:2, pp:278-287 [Journal]
   
8. Torben Hagerup, Marek Chrobak, Krzysztof Diks
   Optimal Parallel 5-Colouring of Planar Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:2, pp:288-300 [Journal]
   
9. Riccardo Melen, Jonathan S. Turner
   Nonblocking Multirate Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1989, v:18, n:2, pp:301-313 [Journal]
   
10. Joseph Y.-T. Leung, Gilbert H. Young
    Minimizing Schedule Length Subject to Minimum Flow Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:314-326 [Journal]
    
11. Joseph Naor, Moni Naor, Alejandro A. Schäffer
    Fast Parallel Algorithms for Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:327-349 [Journal]
    
12. James Renegar
    On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:350-370 [Journal]
    
13. F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson
    Partitioning Space for Range Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:371-384 [Journal]
    
14. Kazuo Iwama
    CNF Satisfiability Test by Counting and Polynomial Average Time. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:385-391 [Journal]
    
15. Ker-I Ko
    Relativized Polynomial Time Hierarchies Having Exactly K Levels. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:392-408 [Journal]
    
16. Khaled M. Bugrara, Youfang Pan, Paul Walton Purdom Jr.
    Exponential Average Time for the Pure Literal Rule. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:409-418 [Journal]
    
17. Mark K. Goldberg, Thomas H. Spencer
    A New Parallel Algorithm for the Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:419-427 [Journal]