nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
|
Phillips, Jeffrey Mark |
|
1998 |
67 |
2 |
p. 105-110 6 p. |
artikel |
2 |
A lower bound for depth-3 circuits with MOD m gates
|
Grolmusz, Vince |
|
1998 |
67 |
2 |
p. 87-90 4 p. |
artikel |
3 |
Coloring random graphs
|
Krivelevich, Michael |
|
1998 |
67 |
2 |
p. 71-74 4 p. |
artikel |
4 |
Fast nondeterministic recognition of context-free languages using two queues
|
Rosenberg, Burton |
|
1998 |
67 |
2 |
p. 91-93 3 p. |
artikel |
5 |
Improved algorithms for group testing with inhibitors
|
De Bonis, Annalisa |
|
1998 |
67 |
2 |
p. 57-64 8 p. |
artikel |
6 |
Kleene's three-valued logic and process algebra
|
Bergstra, Jan A. |
|
1998 |
67 |
2 |
p. 95-103 9 p. |
artikel |
7 |
Learning nearly monotone k-term DNF
|
Castro, Jorge |
|
1998 |
67 |
2 |
p. 75-79 5 p. |
artikel |
8 |
On fixed priority scheduling, offsets and co-prime task periods
|
Audsley, N.C. |
|
1998 |
67 |
2 |
p. 65-69 5 p. |
artikel |
9 |
On Kolmogorov complexity in the real Turing machine setting
|
MontaƱa, J.L. |
|
1998 |
67 |
2 |
p. 81-86 6 p. |
artikel |