Information Processing Letters

Optimal availability quorum systems: Theory and practice
pp. 223-228(6)
Authors: Amir Y.; Wool A.

A 1312 approximation algorithm for bin packing with extendable bins
pp. 229-233(5)
Authors: Mamou M.; Vasseur P.; Bilgen E.; Dell'Olmo P.; Kellerer H.; Speranza M.G.; Tuza Z.

Shifts and loopless generation of k-ary trees
pp. 235-240(6)
Authors: Breitholtz C.; Leckner B.; Korsh J.F.; Lipschutz S.

Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study
pp. 241-245(5)
Authors: Wang S.-P.; Wang G.-X.; Matthys E.F.; Frank J.; Gent I.P.; Walsh T.

Starvation-free secure multiversion concurrency control
pp. 247-253(7)
Authors: Young T.J.; Vafai K.; Kim H.-T.; Myoung H.K.

An optimal message routing algorithm for double-loop networks
pp. 255-260(6)
Authors: Schlosser P.M.; Godo M.N.; Fornes T.D.; Hubal E.C.; Guan D.J.

Test sequence generation from the protocol data portion based on the Selecting Chinese Postman algorithm
pp. 261-268(8)
Authors: Hrenya C.; Miller S.; Mallo T.; Sinclair J.; Chen W.-h.

Maintaining visibility of a polygon with a moving point of view
pp. 269-275(7)
Authors: Bril A.I.; Kabashnikov V.P.; Kuzmina N.V.; Popov V.M.; Chen D.Z.; Daescu O.

Pattern matching for permutations
pp. 277-283(7)
Authors: Fabbri G.; Bose P.; Buss J.F.; Lubiw A.