Information Processing Letters

ECFSM-based probabilistic protocol verification
pp. 1-9(9)
Authors: Chung-Ming H.; Jenq-Muh H.; Shiun-Wei L.

Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
pp. 11-16(6)
Authors: Kloks T.; Kratsch D.

Probabilistic analysis of k-dimensional packing algorithms
pp. 17-24(8)
Authors: Hong D.; Leung J.Y.-T.

A fully parallel algorithm for residue to binary conversion
pp. 25-26(2)
Authors: Barsi F.; Perotti M.C.

A note on Mod and generalised Mod classes
pp. 27-31(5)
Authors: Mahajan M.; Vinodchandran N.V.

Fairness and partial order semantics
pp. 33-39(7)
Author: Vogler W.

1-Approximation algorithm for bottleneck disjoint path matching
pp. 41-44(4)
Authors: Borutzky W.; Datta A.K.; Sen R.K.

Fair reconstruction of a secret
pp. 45-47(3)
Authors: Lin H.-Y.; Harn L.

On the generalized twisted cube
pp. 49-52(4)
Author: Chedid F.B.

On generalized twisted cubes
pp. 53-55(3)
Authors: Cull P.; Larson S.M.

Easy verification of behavioural subtyping in common cases
pp. 57-58(2)
Author: Butler G.