Volume 31; Issue 3

SIAM Journal on Computing

Volume 31; Issue 3
1

Resource-Bounded Kolmogorov Complexity Revisited

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

Separation of NP-Completeness Notions

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

Algorithms for Capacitated Vehicle Routing

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

Approximation Algorithms for Single-Source Unsplittable Flow

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

The Compactness of Interval Routing for Almost All Graphs

Year:
2001
Language:
english
File:
PDF, 202 KB
english, 2001
6

Corrigendum: Proximity in Arrangements of Algebraic Sets

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

Topological Lower Bounds on Algebraic Random Access Machines

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

Corrigendum: Edge-Disjoint Paths in Expander Graphs

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

Succinct Representation of Balanced Parentheses and Static Trees

Year:
2001
Language:
english
File:
PDF, 163 KB
english, 2001
11

Parallel Quantum Computation and Quantum Codes

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

Analysis of Timing-Based Mutual Exclusion with Random Times

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

A Characterization of Eventual Byzantine Agreement

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

Evasiveness of Subgraph Containment and Related Properties

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

Optimal Sampling Strategies in Quicksort and Quickselect

Year:
2001
Language:
english
File:
PDF, 246 KB
english, 2001
16

Compressibility and Resource Bounded Measure

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

Proof Techniques for Cryptographic Processes

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