Journals in DBLP

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

1. Paul M. B. Vitányi
   An Optimal Simulation of Counter Machines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:1, pp:1-33 [Journal]
   
2. Paul M. B. Vitányi
   An Optimal Simulation of Counter Machines: The ACM Case. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:1, pp:34-40 [Journal]
   
3. Ker-I Ko, Uwe Schöning
   On Circuit-Size Complexity and the Low Hierarchy in NP. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:1, pp:41-51 [Journal]
   
4. Paris C. Kanellakis, Christos H. Papadimitriou
   The Complexity of Distributed Concurrency Control. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:1, pp:52-74 [Journal]
   
5. John H. Reif, Paul G. Spirakis
   Unbounded Speed Variability in Distributed Communications Systems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:1, pp:75-92 [Journal]
   
6. Hiroshi Imai, Masao Iri, Kazuo Murota
   Voronoi Diagram in the Laguerre Geometry and its Applications. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:1, pp:93-105 [Journal]
   
7. Charles M. Fiduccia
   An Efficient Formula for Linear Recurrences. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:1, pp:106-112 [Journal]
   
8. Stuart A. Kurtz
   Sparse Sets in NP - P: Relativizations. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:1, pp:113-119 [Journal]
   
9. Andrew Chi-Chih Yao, F. Frances Yao
   On Fault-Tolerant Networks for Sorting. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1985, v:14, n:1, pp:120-128 [Journal]
   
10. Andrew Chi-Chih Yao
    On the Expected Performance of Path Compression Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:129-133 [Journal]
    
11. James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas
    Finding Extremal Polygons. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:134-147 [Journal]
    
12. José L. Balcázar
    Simplicity, Relativizations and Nondeterminism. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:148-157 [Journal]
    
13. Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner
    Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:158-177 [Journal]
    
14. Jean-Jacques Risler
    Additive Complexity and Zeros of Real Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:178-183 [Journal]
    
15. Susan Landau
    Factoring Polynomials Over Algebraic Number Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:184-195 [Journal]
    
16. J. C. Lagarias
    The Computational Complexity of Simultaneous Diophantine Approximation Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:196-209 [Journal]
    
17. Norishige Chiba, Takao Nishizeki
    Arboricity and Subgraph Listing Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:210-223 [Journal]
    
18. Wen-Lian Hsu
    Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:224-231 [Journal]
    
19. Dan E. Willard
    New Data Structures for Orthogonal Range Queries. [Citation Graph (4, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:232-253 [Journal]
    
20. Robert Endre Tarjan, Mihalis Yannakakis
    Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:254-255 [Journal]