nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A counter-example to an algorithm for the generalized input-output construct of CSP
|
Kumar, Devendra |
|
1997 |
61 |
6 |
p. 287- 1 p. |
artikel |
2 |
An exact analysis on expected seeks in shadowed disks
|
Vakali, Athena |
|
1997 |
61 |
6 |
p. 323-329 7 p. |
artikel |
3 |
An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
|
Chao, H.S. |
|
1997 |
61 |
6 |
p. 311-316 6 p. |
artikel |
4 |
A note on approximating graph genus
|
Chen, Jianer |
|
1997 |
61 |
6 |
p. 317-322 6 p. |
artikel |
5 |
A simple algorithm for learning O(log n)-term DNF
|
Kushilevitz, Eyal |
|
1997 |
61 |
6 |
p. 289-292 4 p. |
artikel |
6 |
Author index volume 61 (1997)
|
|
|
1997 |
61 |
6 |
p. 341-342 2 p. |
artikel |
7 |
Finding pattern matchings for permutations
|
Ibarra, Louis |
|
1997 |
61 |
6 |
p. 293-295 3 p. |
artikel |
8 |
Minimal sense of direction in regular networks
|
Flocchini, Paola |
|
1997 |
61 |
6 |
p. 331-338 8 p. |
artikel |
9 |
On learning multivariate polynomials under the uniform distribution
|
Bshouty, Nader H. |
|
1997 |
61 |
6 |
p. 303-309 7 p. |
artikel |
10 |
Scheduling chains to minimize mean flow time
|
Dror, Moshe |
|
1997 |
61 |
6 |
p. 297-301 5 p. |
artikel |
11 |
Subject index volume 61 (1997)
|
|
|
1997 |
61 |
6 |
p. 339-340 2 p. |
artikel |