nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An Efficient Algorithm for Controller Synthesis under Full Observation
|
Barbeau, M |
|
1997 |
25 |
1 |
p. 144-161 18 p. |
artikel |
2 |
Approximate Set Covering in Uniform Hypergraphs
|
Krivelevich, Michael |
|
1997 |
25 |
1 |
p. 118-143 26 p. |
artikel |
3 |
A Reliable Randomized Algorithm for the Closest-Pair Problem
|
Dietzfelbinger, Martin |
|
1997 |
25 |
1 |
p. 19-51 33 p. |
artikel |
4 |
Coins with Arbitrary Weights
|
Alon, Noga |
|
1997 |
25 |
1 |
p. 162-176 15 p. |
artikel |
5 |
Dictionary Look-Up with One Error
|
Yao, Andrew C. |
|
1997 |
25 |
1 |
p. 194-202 9 p. |
artikel |
6 |
Gray Codes for the Ideals of Interval Orders
|
Habib, Michel |
|
1997 |
25 |
1 |
p. 52-66 15 p. |
artikel |
7 |
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
|
Bhattacharya, Binay K |
|
1997 |
25 |
1 |
p. 177-193 17 p. |
artikel |
8 |
On the Diameter of the Pancake Network
|
Heydari, Mohammad H. |
|
1997 |
25 |
1 |
p. 67-94 28 p. |
artikel |
9 |
Optimal Time–Space Tradeoff for Shared Memory Leader Election
|
Afek, Yehuda |
|
1997 |
25 |
1 |
p. 95-117 23 p. |
artikel |
10 |
Papers to Appear in Forthcoming Issues
|
|
|
1997 |
25 |
1 |
p. 203- 1 p. |
artikel |
11 |
Tight Bounds for the Maximum Acyclic Subgraph Problem
|
Berger, Bonnie |
|
1997 |
25 |
1 |
p. 1-18 18 p. |
artikel |