Volume 18; Issue 2

SIAM Journal on Computing

Volume 18; Issue 2
1

Partitioning Space for Range Queries

Year:
1989
Language:
english
File:
PDF, 1.51 MB
english, 1989
2

CNF-Satisfiability Test by Counting and Polynomial Average Time

Year:
1989
Language:
english
File:
PDF, 658 KB
english, 1989
4

Relativized Polynomial Time Hierarchies Having Exactly K Levels

Year:
1989
Language:
english
File:
PDF, 2.20 MB
english, 1989
6

Exponential Average Time for the Pure Literal Rule

Year:
1989
Language:
english
File:
PDF, 1.05 MB
english, 1989
7

The Token Distribution Problem

Year:
1989
Language:
english
File:
PDF, 1.98 MB
english, 1989
8

A New Parallel Algorithm for the Maximal Independent Set Problem

Year:
1989
Language:
english
File:
PDF, 1.05 MB
english, 1989
10

Finding an Approximate Maximum

Year:
1989
Language:
english
File:
PDF, 1.23 MB
english, 1989
11

Bounds on Universal Sequences

Year:
1989
Language:
english
File:
PDF, 1.29 MB
english, 1989
12

Optimal Parallel 5-Colouring of Planar Graphs

Year:
1989
Language:
english
File:
PDF, 1.52 MB
english, 1989
13

Nonblocking Multirate Networks

Year:
1989
Language:
english
File:
PDF, 1.50 MB
english, 1989
14

Minimizing Schedule Length Subject to Minimum Flow Time

Year:
1989
Language:
english
File:
PDF, 1.45 MB
english, 1989
15

Fast Parallel Algorithms for Chordal Graphs

Year:
1989
Language:
english
File:
PDF, 3.05 MB
english, 1989
16

On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials

Year:
1989
Language:
english
File:
PDF, 2.11 MB
english, 1989