|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
13 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | An algorithmic proof of Tutte's f-factor theorem |
Anstee, R.P |
1985 |
6 | 1 |
p. 112-131 20 p. |
artikel |
|
| 2 | A new proof for the first-fit decreasing bin-packing algorithm |
Baker, Brenda S |
1985 |
6 | 1 |
p. 49-70 22 p. |
artikel |
|
| 3 | A “retraction” method for planning the motion of a disc |
Ó'Dúnlaing, Colm |
1985 |
6 | 1 |
p. 104-111 8 p. |
artikel |
|
| 4 | Editorial Board |
1985 |
6 | 1 |
p. i- 1 p. |
artikel |
||
| 5 | Finding approximate patterns in strings |
Ukkonen, Esko |
1985 |
6 | 1 |
p. 132-137 6 p. |
artikel |
|
| 6 | Finding the convex hull facet by facet |
Swart, Garret |
1985 |
6 | 1 |
p. 17-48 32 p. |
artikel |
|
| 7 | NP-completeness for minimizing maximum edge length in grid embeddings |
Miller, Z |
1985 |
6 | 1 |
p. 10-16 7 p. |
artikel |
|
| 8 | On the complexity of some algorithms of matrix multiplication |
Alekseyev, Valery B |
1985 |
6 | 1 |
p. 71-85 15 p. |
artikel |
|
| 9 | Papers to appear in forthcoming issues |
1985 |
6 | 1 |
p. 160-161 2 p. |
artikel |
||
| 10 | Searching ordered structures |
Linial, N |
1985 |
6 | 1 |
p. 86-103 18 p. |
artikel |
|
| 11 | The expected length of the longest probe sequence for bucket searching when the distribution is not uniform |
Devroye, Luc |
1985 |
6 | 1 |
p. 1-9 9 p. |
artikel |
|
| 12 | The NP-completeness column: An ongoing guide |
Johnson, David S |
1985 |
6 | 1 |
p. 145-159 15 p. |
artikel |
|
| 13 | Two levels are as good as any |
Tamminen, Markku |
1985 |
6 | 1 |
p. 138-144 7 p. |
artikel |
13 gevonden resultaten