Information Processing Letters

Linear complexity of the Naor-Reingold pseudo-random function
pp. 95-99(5)
Author: Shparlinski I.E.

A fast addition algorithm for elliptic curve arithmetic in GF(2ⁿ) using projective coordinates
pp. 101-103(3)
Authors: Higuchi A.; Takagi N.

Linear systolic multiplier/squarer for fast exponentiation
pp. 105-111(7)
Authors: Lee K.-J.; Yoo K.-Y.

On the number of spanning trees of a multi-complete/star related graph
pp. 113-119(7)
Authors: Chung K.-L.; Yan W.-M.

Complexity of estimating multi-way join result sizes for area skewed spatial data
pp. 121-129(9)
Authors: Park H.-H.; Chung C.-W.

When does a correct mutual exclusion algorithm guarantee mutual exclusion?
pp. 131-134(4)
Authors: Lamport L.; Perl S.; Weihl W.

Partitioned systolic architecture for modular multiplication in GF(2^m)
pp. 135-139(5)
Authors: Kim H.-S.; Lee S.-W.; Yoo K.-Y.

Recognizing i-triangulated graphs in O(mn) time
pp. 141-147(7)
Authors: Roussel F.; Rusu I.