Journals in DBLP

SIAM J. Comput.
1988, volume: 17, number: 1

1. Yehoshua Sagiv
   On Bounded Database Schemes and Bounded Horn-Clause Programs. [Citation Graph (6, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:1, pp:1-22 [Journal]
   
2. Donald K. Friesen, Frederick S. Kuhl
   Analysis of a Hybrid Algorithm for Packing Unequal Bins. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:1, pp:23-40 [Journal]
   
3. Sumio Masuda, Kazuo Nakajima
   An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:1, pp:41-52 [Journal]
   
4. Daniel Bienstock, Clyde L. Monma
   On the Complexity of Covering Vertices by Faces in a Planar Graph. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:1, pp:53-76 [Journal]
   
5. Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen
   Fast Simulation of Turing Machines by Random Access Machines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:1, pp:77-88 [Journal]
   
6. Masanori Fushimi
   Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:1, pp:89-99 [Journal]
   
7. Ulrich Faigle, György Turán
   Sorting and Recognition Problems for Ordered Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:1, pp:100-113 [Journal]
   
8. David M. Nicol
   Expected Performance of m-Solution Backtracking. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:1, pp:114-127 [Journal]
   
9. Richard Cole, Uzi Vishkin
   Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:1, pp:128-142 [Journal]
   
10. Robert Endre Tarjan, Christopher J. Van Wyk
    An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:1, pp:143-178 [Journal]