nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A deficiency of natural deduction
|
Wiltink, J.G. |
|
1987 |
25 |
4 |
p. 233-234 2 p. |
artikel |
2 |
A log log n data structure for three-sided range queries
|
Fries, O. |
|
1987 |
25 |
4 |
p. 269-273 5 p. |
artikel |
3 |
An ω(√n) lower bound for the nonoptimality of the greedy triangulation
|
Levcopoulos, Christos |
|
1987 |
25 |
4 |
p. 247-251 5 p. |
artikel |
4 |
A note on the number of leftist trees
|
Kemp, Rainer |
|
1987 |
25 |
4 |
p. 227-232 6 p. |
artikel |
5 |
A simplified solution of the N queens' problem
|
Reichling, Matthias |
|
1987 |
25 |
4 |
p. 253-255 3 p. |
artikel |
6 |
Garbage collection can be faster than stack allocation
|
Appel, Andrew W. |
|
1987 |
25 |
4 |
p. 275-279 5 p. |
artikel |
7 |
Horner's rule and the computation of linear recurrences
|
Gries, David |
|
1987 |
25 |
4 |
p. 237-240 4 p. |
artikel |
8 |
Inevitability in concurrent systems
|
Ochmański, Edward |
|
1987 |
25 |
4 |
p. 221-225 5 p. |
artikel |
9 |
Multiprocessor automata
|
Buda, Anatoli O. |
|
1987 |
25 |
4 |
p. 257-261 5 p. |
artikel |
10 |
Parallel (Δ + 1)-coloring of constant-degree graphs
|
Goldberg, Andrew V. |
|
1987 |
25 |
4 |
p. 241-245 5 p. |
artikel |
11 |
Prefixes of infinite words and ambiguous context-free languages
|
Autebert, Jean-Michel |
|
1987 |
25 |
4 |
p. 211-216 6 p. |
artikel |
12 |
Remark on the HSUDU new algorithm for the longest common subsequence problem
|
Apostolico, Alberto |
|
1987 |
25 |
4 |
p. 235-236 2 p. |
artikel |
13 |
The complexity of minimizing wire lengths in VLSI layouts
|
Bhatt, Sandeep N. |
|
1987 |
25 |
4 |
p. 263-267 5 p. |
artikel |
14 |
The complexity of symmetric functions in bounded-depth circuits
|
Brustmann, Bettina |
|
1987 |
25 |
4 |
p. 217-219 3 p. |
artikel |