nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on computational indistinguishability
|
Goldreich, Oded |
|
1990 |
34 |
6 |
p. 277-281 5 p. |
artikel |
2 |
A parallel algorithm for eliminating cycles in undirected graphs
|
Klein, Philip |
|
1990 |
34 |
6 |
p. 307-312 6 p. |
artikel |
3 |
Author index volume 34 (1990)
|
|
|
1990 |
34 |
6 |
p. 329-330 2 p. |
artikel |
4 |
Covering a set with arithmetic progressions is np-complete
|
Health, Lenwood S. |
|
1990 |
34 |
6 |
p. 293-298 6 p. |
artikel |
5 |
Deadlock-free routing in k-ary hypercube network in presence of processor failures
|
Sengupta, A. |
|
1990 |
34 |
6 |
p. 323-328 6 p. |
artikel |
6 |
Distributing A B +-tree in a loosely coupled environment
|
Matsliach, Gabriel |
|
1990 |
34 |
6 |
p. 313-321 9 p. |
artikel |
7 |
Generalized Closed World Assumption is II 0 2-Complete
|
Chomicki, Jan |
|
1990 |
34 |
6 |
p. 289-291 3 p. |
artikel |
8 |
Isomorphism testing of k-trees is in NC, for fixed k
|
Chandrasekharan, N. |
|
1990 |
34 |
6 |
p. 283-287 5 p. |
artikel |
9 |
Toward a definition of fault analysis for petri nets models
|
Zargham, M.R. |
|
1990 |
34 |
6 |
p. 299-305 7 p. |
artikel |