Skip to main content

Publisher: Elsevier

Volume 81, Number 3, 14 February 2002

Favourites:
ADD

A fast correlation attack on LILI-128
pp. 127-132(6)
Authors: Jonsson, F.; Johansson, T.

Favourites:
ADD

Kolmogorov random graphs only have trivial stable colorings
pp. 133-136(4)
Authors: Cheng, Q.; Fang, F.

Favourites:
ADD

Lower bounds for approximate polygon decomposition and minimum gap
pp. 137-141(5)
Authors: Gudmundsson, J.; Husfeldt, T.; Levcopoulos, C.

Favourites:
ADD

Approximation algorithms for general parallel task scheduling
pp. 143-150(8)
Authors: Kwon O.-H.; Chwa, K.

Favourites:
ADD

The NP-completeness of (1,r)-subcolorability of cubic graphs
pp. 157-162(6)
Authors: Le, H.; Le, V.B.

Favourites:
ADD

Perfect Code is W[1]-complete
pp. 163-168(6)
Author: Cesati, M.

Favourites:
ADD

Comparison of two code scalability tests
pp. 169-174(6)
Author: Lyon, G.

Favourites:
ADD

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more