nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An approximation algorithm for the maximum traveling salesman problem
|
Hassin, Refael |
|
1998 |
67 |
3 |
p. 125-130 6 p. |
artikel |
2 |
An optimal parallel algorithm for sorting multisets
|
Rajasekaran, Sanguthevar |
|
1998 |
67 |
3 |
p. 141-143 3 p. |
artikel |
3 |
Automata and forbidden words
|
Crochemore, M. |
|
1998 |
67 |
3 |
p. 111-117 7 p. |
artikel |
4 |
Finding shortest paths in distributed loop networks
|
Chalamaiah, Nimmagadda |
|
1998 |
67 |
3 |
p. 157-161 5 p. |
artikel |
5 |
On the time complexity of minimum and maximum global snapshot problems
|
Chen, Loon-Been |
|
1998 |
67 |
3 |
p. 151-156 6 p. |
artikel |
6 |
Optimal alphabetic trees for binary search
|
Hu, T.C. |
|
1998 |
67 |
3 |
p. 137-140 4 p. |
artikel |
7 |
Randomized group testing for mutually obscuring defectives
|
Damaschke, Peter |
|
1998 |
67 |
3 |
p. 131-135 5 p. |
artikel |
8 |
Transition systems from event structures revisited
|
Majster-Cederbaum, Mila |
|
1998 |
67 |
3 |
p. 119-124 6 p. |
artikel |
9 |
Weakest preconditions for pure Prolog programs
|
Pedreschi, Dino |
|
1998 |
67 |
3 |
p. 145-150 6 p. |
artikel |