nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A generalization of the fast LUP matrix decomposition algorithm and applications
|
Ibarra, Oscar H |
|
1982 |
3 |
1 |
p. 45-56 12 p. |
artikel |
2 |
A Gray code for compositions
|
Klingsberg, Paul |
|
1982 |
3 |
1 |
p. 41-44 4 p. |
artikel |
3 |
An O(logn) parallel connectivity algorithm
|
Shiloach, Yossi |
|
1982 |
3 |
1 |
p. 57-67 11 p. |
artikel |
4 |
A nonquadratic minimal algorithm for a system of quadratic forms
|
Tolimieri, R |
|
1982 |
3 |
1 |
p. 31-40 10 p. |
artikel |
5 |
Editorial Board
|
|
|
1982 |
3 |
1 |
p. i- 1 p. |
artikel |
6 |
Lower bounds for algebraic decision trees
|
Michael Steele, J |
|
1982 |
3 |
1 |
p. 1-8 8 p. |
artikel |
7 |
On the average-case complexity of “bucketing” algorithms
|
Akl, Selim G |
|
1982 |
3 |
1 |
p. 9-13 5 p. |
artikel |
8 |
Parallel complexity of sorting problems
|
Aigner, Martin |
|
1982 |
3 |
1 |
p. 79-88 10 p. |
artikel |
9 |
The Byzantine generals strike again
|
Dolev, Danny |
|
1982 |
3 |
1 |
p. 14-30 17 p. |
artikel |
10 |
The complexity of partial match retrieval in a dynamic setting
|
Fredman, Michael L |
|
1982 |
3 |
1 |
p. 68-78 11 p. |
artikel |
11 |
The NP-completeness column: An ongoing guide
|
Johnson, David S |
|
1982 |
3 |
1 |
p. 89-99 11 p. |
artikel |