The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nguyen Huong Lam: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nguyen Huong Lam
    Finite Completion of Comma-Free Codes. Part I. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:357-368 [Conf]
  2. Nguyen Huong Lam, Do Long Van
    On Strict Codes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:308-317 [Conf]
  3. Nguyen Huong Lam
    On Codes Having no Finite Completion. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:691-698 [Conf]
  4. Nguyen Huong Lam, Do Long Van
    On Strict Codes. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1991, v:10, n:1-2, pp:25-34 [Journal]
  5. Nguyen Huong Lam, Do Long Van
    Measure of Infinitary Codes. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1994, v:11, n:3, pp:127-138 [Journal]
  6. Do Long Van, Nguyen Huong Lam, Phan Trung Huy
    On Codes of Bi-Infinite Words. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1993, v:11, n:1-2, pp:97-110 [Journal]
  7. Nguyen Huong Lam
    A Note on Codes Having no Finite Completions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:4, pp:185-188 [Journal]
  8. Nguyen Huong Lam
    On Codes Having no Finite Completion. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:2, pp:145-155 [Journal]
  9. Nguyen Huong Lam
    On Codes Having no Finite Completion. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:6, pp:483-493 [Journal]
  10. Phan Trung Huy, Nguyen Huong Lam
    Unavoidable set: extension and reduction. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:3, pp:213-226 [Journal]
  11. Nguyen Huong Lam, Do Long Van
    On a class of infiinitary codes. [Citation Graph (0, 0)][DBLP]
    ITA, 1990, v:24, n:, pp:441-458 [Journal]
  12. Helmut Jürgensen, Stavros Konstantinidis, Nguyen Huong Lam
    Asymptotically Optimal Low-Cost Solid Codes. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2004, v:9, n:1, pp:81-102 [Journal]
  13. Nguyen Huong Lam
    Finite maximal solid codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:333-347 [Journal]
  14. Nguyen Huong Lam
    Completing comma-free codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:399-415 [Journal]
  15. Nguyen Huong Lam
    Hajós Factorizations and Completion of Codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:182, n:1-2, pp:245-256 [Journal]

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002