Search the dblp DataBase

Publications of Author

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