Lawrence T. Kou

According to our database, Lawrence T. Kou authored at least 11 papers between 1974 and 1990.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

1990

On Efficient Implementation of an Approximation Algorithm for the Steiner Tree Problem.

Lawrence T. Kou

Acta Informatica, 1990

1988

A visual interface for generic message translation.

Meera Blattner, Lawrence T. Kou, John W. Carlson, Douglas W. Daniel

Proceedings of the IEEE Workshop on Visual Languages, 1988

1983

On Sets of Boolean <i> n </i> -Projections Surjective.

Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks

Acta Informatica, 1983

1982

Minimum Variance Huffman Codes.

Lawrence T. Kou

SIAM J. Comput., 1982

1981

A Fast Algorithm for Steiner Trees.

Lawrence T. Kou, George Markowsky, Leonard Berman

Acta Informatica, 1981

1978

Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs.

Lawrence T. Kou, Larry J. Stockmeyer, C. K. Wong

Commun. ACM, 1978

1977

Polynomial Complete Consecutive Information Retrieval Problems.

Lawrence T. Kou

SIAM J. Comput., 1977

On Live-Dead Analysis for Global Data Flow Problems.

Lawrence T. Kou

J. ACM, 1977

Multidimensional Bin Packing Algorithms.

Lawrence T. Kou, George Markowsky

IBM J. Res. Dev., 1977

1975

A Note on the Set Basis Problem Related to the Compaction of Character Sets.

Lawrence T. Kou, C. K. Wong

Commun. ACM, 1975

1974

Multiple-Entry Finite Automata.

Arthur Gill, Lawrence T. Kou

J. Comput. Syst. Sci., 1974