Information Processing Letters

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

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.

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

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.

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

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.

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

Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
pp. 153-159(7)
Authors: Gordon V.; Kubiak W.