Information Processing Letters

On inferring linear single-tree languages
pp. 1-3(3)
Author: Makinen E.

On the Day-Tripathi orientation of the star graphs: Connectivity
pp. 5-10(6)
Authors: Cheng E.; Lipman M.J.

PACS, simple-PAC and query learning
pp. 11-16(6)
Authors: Castro J.; Guijarro D.

Performance guarantees for the TSP with a parameterized triangle inequality
pp. 17-21(5)
Authors: Bender M.A.; Chekuri C.

An ergodic theorem for read-once non-uniform deterministic finite automata
pp. 23-28(6)
Authors: Goldmann M.; Russell A.; Therien D.

Low discrepancy sets yield approximate min-wise independent permutation families
pp. 29-32(4)
Authors: Saks M.; Srinivasan A.; Zhou S.; Zuckerman D.

Placing two disks in a convex polygon
pp. 33-39(7)
Authors: Kim S.K.; Shin C.-S.; Yang T.-C.

Error-detecting codes and fault-containing self-stabilization
pp. 41-46(6)
Authors: Herman T.; Pemmaraju S.

On the geometry of similarity search: Dimensionality curse and concentration of measure
pp. 47-51(5)
Author: Pestov V.

A uniform framework for term and graph rewriting applied to combined systems
pp. 53-59(7)
Author: Ohlebusch E.

On-line scheduling with setup costs
pp. 61-68(8)
Authors: Gambosi G.; Nicosia G.

Finding OR in a noisy broadcast network
pp. 69-75(7)
Authors: Feige U.; Kilian J.