| 1989 |
|---|
| 10 | | Lawrence T. Kou:
On Efficient Implementation of an Approximation Algorithm for the Steiner Tree Problem.
Acta Inf. 27(4): 369-380 (1989) |
| 1983 |
|---|
| 9 | | Ashok K. Chandra,
Lawrence T. Kou,
George Markowsky,
Shmuel Zaks:
On Sets of Boolean n -Projections Surjective.
Acta Inf. 20: 103-111 (1983) |
| 1982 |
|---|
| 8 | | Lawrence T. Kou:
Minimum Variance Huffman Codes.
SIAM J. Comput. 11(1): 138-148 (1982) |
| 1981 |
|---|
| 7 | | Lawrence T. Kou,
George Markowsky,
Leonard Berman:
A Fast Algorithm for Steiner Trees.
Acta Inf. 15: 141-145 (1981) |
| 1978 |
|---|
| 6 | | Lawrence T. Kou,
Larry J. Stockmeyer,
C. K. Wong:
Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs.
Commun. ACM 21(2): 135-139 (1978) |
| 1977 |
|---|
| 5 | | Lawrence T. Kou,
George Markowsky:
Multidimensional Bin Packing Algorithms.
IBM Journal of Research and Development 21(5): 443-448 (1977) |
| 4 | EE | Lawrence T. Kou:
On Live-Dead Analysis for Global Data Flow Problems.
J. ACM 24(3): 473-483 (1977) |
| 3 | | Lawrence T. Kou:
Polynomial Complete Consecutive Information Retrieval Problems.
SIAM J. Comput. 6(1): 67-75 (1977) |
| 1975 |
|---|
| 2 | | Lawrence T. Kou,
C. K. Wong:
A Note on the Set Basis Problem Related to the Compaction of Character Sets.
Commun. ACM 18(11): 656-557 (1975) |
| 1974 |
|---|
| 1 | | Arthur Gill,
Lawrence T. Kou:
Multiple-Entry Finite Automata.
J. Comput. Syst. Sci. 9(1): 1-19 (1974) |
