nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula
|
Chen, Zhi-Zhong |
|
1992 |
43 |
4 |
p. 191-193 3 p. |
artikel |
2 |
A new upper bound on the complexity of the all pairs shortest path problem
|
Takaoka, Tadao |
|
1992 |
43 |
4 |
p. 195-199 5 p. |
artikel |
3 |
A relationship between nondeterministic Turing machines and 1-inkdot turing machines with small space
|
Inoue, Katsushi |
|
1992 |
43 |
4 |
p. 225-227 3 p. |
artikel |
4 |
Fast computation of the Euclidian distance maps for binary images
|
Kolountzakis, Mihail N. |
|
1992 |
43 |
4 |
p. 181-184 4 p. |
artikel |
5 |
Highly resilient correctors for polynomials
|
Gemmell, Peter |
|
1992 |
43 |
4 |
p. 169-174 6 p. |
artikel |
6 |
Intersection and union of regular languages and state complexity
|
Birget, Jean-Camille |
|
1992 |
43 |
4 |
p. 185-190 6 p. |
artikel |
7 |
Lazy dynamic-programming can be eager
|
Allison, L. |
|
1992 |
43 |
4 |
p. 207-212 6 p. |
artikel |
8 |
Minimum separation for single-layer channel routing
|
Greenberg, Ronald I. |
|
1992 |
43 |
4 |
p. 201-205 5 p. |
artikel |
9 |
On sorting in the presence of erroneous information
|
Bagchi, A. |
|
1992 |
43 |
4 |
p. 213-215 3 p. |
artikel |
10 |
Safety analysis versus type inference for partial types
|
Palsberg, Jens |
|
1992 |
43 |
4 |
p. 175-180 6 p. |
artikel |
11 |
Voronoi diagrams of rigidly moving sets of points
|
Huttenlocher, Daniel P. |
|
1992 |
43 |
4 |
p. 217-223 7 p. |
artikel |