nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fast Voronoi-diagram algorithm with quaternary tree bucketing
|
Ohya, Takao |
|
1984 |
18 |
4 |
p. 227-231 5 p. |
artikel |
2 |
A new combination of input and unit deductions for Horn sentences
|
Yamasaki, Susumu |
|
1984 |
18 |
4 |
p. 209-213 5 p. |
artikel |
3 |
A 4n-lower bound on the monotone network complexity of a one-output boolean function
|
Tiekenheinrich, Jürgen |
|
1984 |
18 |
4 |
p. 201-202 2 p. |
artikel |
4 |
A priority queue for the all pairs shortest path problem
|
Moffat, Alistair |
|
1984 |
18 |
4 |
p. 189-193 5 p. |
artikel |
5 |
A simple linear-time algorithm for in situ merging
|
Mannila, Heikki |
|
1984 |
18 |
4 |
p. 203-208 6 p. |
artikel |
6 |
Fairness and conspiracies
|
Best, Eike |
|
1984 |
18 |
4 |
p. 215-220 6 p. |
artikel |
7 |
Functional dependencies in relations with null values
|
Atzeni, Paolo |
|
1984 |
18 |
4 |
p. 233-238 6 p. |
artikel |
8 |
On verification of programs with goto statements
|
Lifschitz, Vladimir |
|
1984 |
18 |
4 |
p. 221-225 5 p. |
artikel |
9 |
Programmed deallocation without dangling reference
|
Cioni, Gianna |
|
1984 |
18 |
4 |
p. 179-187 9 p. |
artikel |
10 |
The L1 traveling salesman problem
|
Allison, Donald C.S. |
|
1984 |
18 |
4 |
p. 195-199 5 p. |
artikel |