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