Publisher: Elsevier

Related content
Volume 81, Number 3, 14 February 2002

< previous issue | all issues | next issue >

Favourites:Add to Favourites
Favourites:Add to Favourites

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

Favourites:Add to Favourites

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

Favourites:Add to Favourites

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

Favourites:Add to Favourites

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

Favourites:Add to Favourites

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

Favourites:Add to Favourites

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

Favourites:Add to Favourites

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

Share Content

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
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