Volume 31; Issue 1

SIAM Journal on Computing

Volume 31; Issue 1
1

Approximation Techniques for Average Completion Time Scheduling

Year:
2001
Language:
english
File:
PDF, 229 KB
english, 2001
2

Markov Chain Algorithms for Planar Lattice Structures

Year:
2001
Language:
english
File:
PDF, 254 KB
english, 2001
3

There are No Sparse NP w -Hard Sets

Year:
2001
Language:
english
File:
PDF, 125 KB
english, 2001
4

Randomness and Recursive Enumerability

Year:
2001
Language:
english
File:
PDF, 178 KB
english, 2001
5

Treewidth and Minimum Fill-in: Grouping the Minimal Separators

Year:
2001
Language:
english
File:
PDF, 226 KB
english, 2001
7

Generating Bracelets in Constant Amortized Time

Year:
2001
Language:
english
File:
PDF, 132 KB
english, 2001
8

Disjunctions of Horn Theories and Their Cores

Year:
2001
Language:
english
File:
PDF, 244 KB
english, 2001
9

A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling

Year:
2001
Language:
english
File:
PDF, 215 KB
english, 2001
13

Proportion Extend Sort

Year:
2001
Language:
english
File:
PDF, 117 KB
english, 2001
14

Traveling Salesman-Based Curve Reconstruction in Polynomial Time

Year:
2001
Language:
english
File:
PDF, 629 KB
english, 2001
15

Tree Search on an Atomic Model for Message Passing

Year:
2001
Language:
english
File:
PDF, 212 KB
english, 2001
17

Fixed-Parameter Tractability, Definability, and Model-Checking

Year:
2001
Language:
english
File:
PDF, 334 KB
english, 2001