nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A counterexample to the algorithms for determining opaque minimal forests
|
Shermer, Thomas |
|
1991 |
40 |
1 |
p. 41-42 2 p. |
artikel |
2 |
A note on the approximation of the max clique problem
|
Crescenzi, P. |
|
1991 |
40 |
1 |
p. 1-5 5 p. |
artikel |
3 |
A note on the space complexity of some decision problems for finite automata
|
Jiang, Tao |
|
1991 |
40 |
1 |
p. 25-31 7 p. |
artikel |
4 |
Complexity of the repeaters allocating problem
|
Huang, Nen-Fu |
|
1991 |
40 |
1 |
p. 13-20 8 p. |
artikel |
5 |
Editorial Board
|
|
|
1991 |
40 |
1 |
p. CO2- 1 p. |
artikel |
6 |
Lower and upper power domain constructions commute on all cpos
|
Heckmann, Reinhold |
|
1991 |
40 |
1 |
p. 7-11 5 p. |
artikel |
7 |
On “inherently context-sensitive” languages — An application of complexity cores
|
Diekert, Volker |
|
1991 |
40 |
1 |
p. 21-23 3 p. |
artikel |
8 |
Parallel priority queues
|
Pinotti, Maria Cristina |
|
1991 |
40 |
1 |
p. 33-40 8 p. |
artikel |
9 |
Repetitions, known or unknown?
|
Hesselink, Wim H. |
|
1991 |
40 |
1 |
p. 51-57 7 p. |
artikel |
10 |
The benefits of external wires in single row routing
|
Blair, Jean R.S. |
|
1991 |
40 |
1 |
p. 43-49 7 p. |
artikel |