Skip to main content

Publisher: Elsevier

Volume 68, Number 3, 15 November 1998

Robust vector space secret sharing schemes
pp. 107-111(5)
Authors: Islam, M.A.; Monde, M.; Hasan, M.Z.; Mitsutake, Y.; Padro, C.

Favourites:
ADD

On the loopless generation of binary tree sequences
pp. 113-117(5)
Authors: Matos, A.d.; Pinho, F.A.A.; Silveira-Neto, A.; Vajnovszki, V.

Favourites:
ADD

Deciding the winner in parity games is in UP ? co-UP
pp. 119-124(6)
Authors: Nishio, S.; Kim, Y.; Jurdzinnski, M.

Favourites:
ADD

Efficient special cases of Pattern Matching with Swaps
pp. 125-132(8)
Authors: Thamire, C.; Wright, N.T.; Amir, A.; Landau, G.M.; Lewenstein, M.; Lewenstein, N.

Favourites:
ADD

A complete axiomatization of full acyclic join dependencies
pp. 133-139(7)
Author: Malvestuto, F.M.

Favourites:
ADD

A polynomial time solvable instance of the feasible minimum cover problem
pp. 141-146(6)
Authors: Gershuni, G.Z.; Kolesnikov, A.K.; Legros, J.C.; Myznikova, B.I.; Low C.-P.

Favourites:
ADD

An undecidable fragment of the theory of set constraints
pp. 147-151(5)
Authors: Siegel, R.; Charatonik, W.

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