nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Randomized Approximation Scheme for Metric MAX-CUT
|
Fernandez de la Vega, W. |
|
2001 |
63 |
4 |
p. 531-541 11 p. |
artikel |
2 |
Author Index for Volume 63
|
|
|
2001 |
63 |
4 |
p. 690- 1 p. |
artikel |
3 |
GUEST EDITOR'S FOREWORD
|
Motwani, Rajeev |
|
2001 |
63 |
4 |
p. 511- 1 p. |
artikel |
4 |
Heuristics for Semirandom Graph Problems
|
Feige, Uriel |
|
2001 |
63 |
4 |
p. 639-671 33 p. |
artikel |
5 |
On Approximate Nearest Neighbors under l ∞ Norm
|
Indyk, Piotr |
|
2001 |
63 |
4 |
p. 627-638 12 p. |
artikel |
6 |
Papers to Appear in Forthcoming Issues
|
|
|
2001 |
63 |
4 |
p. 689- 1 p. |
artikel |
7 |
Perfect Information Leader Election in log* n+O(1) Rounds
|
Russell, Alexander |
|
2001 |
63 |
4 |
p. 612-626 15 p. |
artikel |
8 |
Protocols for Asymmetric Communication Channels
|
Adler, Micah |
|
2001 |
63 |
4 |
p. 573-596 24 p. |
artikel |
9 |
Randomness vs Time: Derandomization under a Uniform Assumption
|
Impagliazzo, Russell |
|
2001 |
63 |
4 |
p. 672-688 17 p. |
artikel |
10 |
The Minimum Equivalent DNF Problem and Shortest Implicants
|
Umans, Christopher |
|
2001 |
63 |
4 |
p. 597-611 15 p. |
artikel |
11 |
Time–Space Tradeoffs for Branching Programs
|
Beame, Paul |
|
2001 |
63 |
4 |
p. 542-572 31 p. |
artikel |
12 |
Which Problems Have Strongly Exponential Complexity?
|
Impagliazzo, Russell |
|
2001 |
63 |
4 |
p. 512-530 19 p. |
artikel |