nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Editorial Board
|
|
|
1983 |
4 |
1 |
p. i- 1 p. |
artikel |
2 |
Finding kth paths and p-centers by generating and searching good data structures
|
Frederickson, Greg N |
|
1983 |
4 |
1 |
p. 61-80 20 p. |
artikel |
3 |
Implementation of simultaneous memory address access in models that forbid it
|
Vishkin, Uzi |
|
1983 |
4 |
1 |
p. 45-50 6 p. |
artikel |
4 |
Minimal algorithms for bilinear forms may have divisions
|
Feig, Ephraim |
|
1983 |
4 |
1 |
p. 81-84 4 p. |
artikel |
5 |
NP completeness of finding the chromatic index of regular graphs
|
Leven, Daniel |
|
1983 |
4 |
1 |
p. 35-44 10 p. |
artikel |
6 |
Problems
|
Guibas, Leo J |
|
1983 |
4 |
1 |
p. 85-86 2 p. |
artikel |
7 |
Ranking and unranking of B-trees
|
Gupta, U.I |
|
1983 |
4 |
1 |
p. 51-60 10 p. |
artikel |
8 |
The additive and logical complexities of linear and bilinear arithmetic algorithms
|
Pan, V.Ya |
|
1983 |
4 |
1 |
p. 1-34 34 p. |
artikel |
9 |
The NP-completeness column: An ongoing guide
|
Johnson, David S |
|
1983 |
4 |
1 |
p. 87-100 14 p. |
artikel |