nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An algorithm for string matching with a sequence of don't cares
|
Manber, Udi |
|
1991 |
37 |
3 |
p. 133-136 4 p. |
artikel |
2 |
An optimization problem related to neural networks
|
Janssen, A.J.E.M. |
|
1991 |
37 |
3 |
p. 155-157 3 p. |
artikel |
3 |
An oracle separating ΘP from PPPH
|
Green, Frederic |
|
1991 |
37 |
3 |
p. 149-153 5 p. |
artikel |
4 |
A simple algorithm for computing the smallest enclosing circle
|
Skyum, Sven |
|
1991 |
37 |
3 |
p. 121-125 5 p. |
artikel |
5 |
On starvation and some related issues
|
Turski, Wladyslaw M. |
|
1991 |
37 |
3 |
p. 171-174 4 p. |
artikel |
6 |
On the optimality of the counter scheme for dynamic linear lists
|
Hofri, Micha |
|
1991 |
37 |
3 |
p. 175-179 5 p. |
artikel |
7 |
Searching with a forbidden lie pattern in responses
|
Czyzowicz, Jurek |
|
1991 |
37 |
3 |
p. 127-132 6 p. |
artikel |
8 |
Semelectivity is not sufficient
|
Ďuriš, Pavol |
|
1991 |
37 |
3 |
p. 137-141 5 p. |
artikel |
9 |
The effective entropies of some extensions of context-free languages
|
Huynh, Dung T. |
|
1991 |
37 |
3 |
p. 165-169 5 p. |
artikel |
10 |
The effect of the density of states on the Metropolis algorithm
|
Sasaki, Galen |
|
1991 |
37 |
3 |
p. 159-163 5 p. |
artikel |
11 |
Traversing graphs in a paging environment, BFS or DFS?
|
Jiang, Bin |
|
1991 |
37 |
3 |
p. 143-147 5 p. |
artikel |