Uriel Feige On the Complexity of Finite Random Functions. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:6, pp:295-296 [Journal]

Sundar Vishwanathan An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:6, pp:297-302 [Journal]

Adriano Pascoletti An Optimal Algorithm for the Period of a Strongly Connected Digraph. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:6, pp:313-316 [Journal]