nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An Algorithm for the Determination of the Variance of a Partially Ordered Set
|
Engel, K. |
|
1995 |
19 |
3 |
p. 441-448 8 p. |
artikel |
2 |
A Parallel Algorithm for Computing Minimum Spanning Trees
|
Johnson, D.B. |
|
1995 |
19 |
3 |
p. 383-401 19 p. |
artikel |
3 |
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments
|
Bampis, E. |
|
1995 |
19 |
3 |
p. 432-440 9 p. |
artikel |
4 |
A Polynomial Algorithm for Homomorphisms to Oriented Cycles
|
Zhu, X.D. |
|
1995 |
19 |
3 |
p. 333-345 13 p. |
artikel |
5 |
A Subquadratic Algorithm for Approximate Regular Expression Matching
|
Wu, S. |
|
1995 |
19 |
3 |
p. 346-360 15 p. |
artikel |
6 |
Author Index for Volume 19
|
|
|
1995 |
19 |
3 |
p. 505- 1 p. |
artikel |
7 |
Graph Sandwich Problems
|
Golumbic, M.C. |
|
1995 |
19 |
3 |
p. 449-473 25 p. |
artikel |
8 |
How Many Comparisons Does Quicksort Use?
|
Eddy, W.F. |
|
1995 |
19 |
3 |
p. 402-431 30 p. |
artikel |
9 |
k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
|
Rajasekaran, S. |
|
1995 |
19 |
3 |
p. 361-382 22 p. |
artikel |
10 |
Static and Dynamic Algorithms for k-Point Clustering Problems
|
Datta, A. |
|
1995 |
19 |
3 |
p. 474-503 30 p. |
artikel |