Multiple-Entry Finite Automata. - Arthur Gill; Lawrence T. Kou (J. Comput. Syst. Sci., 1974)

A Note on the Set Basis Problem Related to the Compaction of Character Sets. - Lawrence T. Kou; C. K. Wong (Commun. ACM, 1975)

Multidimensional Bin Packing Algorithms. - Lawrence T. Kou; George Markowsky (IBM J. Res. Dev., 1977)

On Live-Dead Analysis for Global Data Flow Problems. - Lawrence T. Kou (J. ACM, 1977)

Polynomial Complete Consecutive Information Retrieval Problems. - Lawrence T. Kou (SIAM J. Comput., 1977)

Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs. - Lawrence T. Kou; Larry J. Stockmeyer; C. K. Wong (Commun. ACM, 1978)

A Fast Algorithm for Steiner Trees. - Lawrence T. Kou; George Markowsky; Leonard Berman (Acta Informatica, 1981)

Minimum Variance Huffman Codes. - Lawrence T. Kou (SIAM J. Comput., 1982)

On Sets of Boolean n -Projections Surjective. - Ashok K. Chandra; Lawrence T. Kou; George Markowsky; Shmuel Zaks (Acta Informatica, 1983)

A visual interface for generic message translation. - Meera Blattner; Lawrence T. Kou; John W. Carlson; Douglas W. Daniel (VL, 1988)

On Efficient Implementation of an Approximation Algorithm for the Steiner Tree Problem. - Lawrence T. Kou (Acta Informatica, 1990)