| 2005 |
|---|
| 37 | EE | Masaaki Harada,
Clement W. H. Lam,
Vladimir D. Tonchev:
Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4.
Des. Codes Cryptography 34(1): 71-87 (2005) |
| 36 | EE | Gennian Ge,
Clement W. H. Lam,
Alan C. H. Ling,
Hao Shen:
Resolvable Maximum Packings with Quadruples.
Des. Codes Cryptography 35(3): 287-302 (2005) |
| 2004 |
|---|
| 35 | EE | Gennian Ge,
Clement W. H. Lam:
Whist tournaments with the three person property.
Discrete Applied Mathematics 138(3): 265-276 (2004) |
| 2003 |
|---|
| 34 | EE | Donald L. Kreher,
Alan C. H. Ling,
Rolf S. Rees,
Clement W. H. Lam:
A note on {4}-GDDs of type 210.
Discrete Mathematics 261(1-3): 373-376 (2003) |
| 33 | EE | Gennian Ge,
Clement W. H. Lam:
Resolvable group divisible designs with block size four and group size six.
Discrete Mathematics 268(1-3): 139-151 (2003) |
| 32 | EE | Gennian Ge,
Clement W. H. Lam:
Bhaskar Rao designs with block size four.
Discrete Mathematics 268(1-3): 293-298 (2003) |
| 31 | | S. K. Houghten,
Clement W. H. Lam,
Larry H. Thiel,
J. A. Parker:
The extended quadratic residue code is the only (48, 24, 12) self-dual doubly-even code.
IEEE Transactions on Information Theory 49(1): 53-59 (2003) |
| 30 | EE | Gennian Ge,
Clement W. H. Lam:
Some new triplewhist tournaments TWh(v).
J. Comb. Theory, Ser. A 101(1): 153-159 (2003) |
| 2001 |
|---|
| 29 | | Clement W. H. Lam,
Ying Miao:
Difference Families.
Des. Codes Cryptography 24(3): 291-304 (2001) |
| 2000 |
|---|
| 28 | EE | Shawn Delaney,
Gregory Butler,
Clement W. H. Lam,
Larry H. Thiel:
Three Improvements to the BLASTP Search of Genome Databases.
SSDBM 2000: 14-24 |
| 27 | EE | Clement W. H. Lam,
Ying Miao:
Cyclically resolvable cyclic Steiner triple systems of order 21 and 39.
Discrete Mathematics 219(1-3): 173-185 (2000) |
| 26 | EE | Clement W. H. Lam,
Sigmund Lam,
Vladimir D. Tonchev:
Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices.
J. Comb. Theory, Ser. A 92(2): 186-196 (2000) |
| 1999 |
|---|
| 25 | EE | Clement W. H. Lam,
Ying Miao:
On Cyclically Resolvable Cyclic Steiner 2-Designs.
J. Comb. Theory, Ser. A 85(2): 194-207 (1999) |
| 1995 |
|---|
| 24 | | Clement W. H. Lam,
Larry H. Thiel,
Vladimir D. Tonchev:
On Quasi-Symmetric 2-(28, 12, 11) and 2-(36, 16, 12) Designs.
Des. Codes Cryptography 5(1): 43-55 (1995) |
| 1994 |
|---|
| 23 | | Gregory Butler,
Clement W. H. Lam:
The Preliminary Design of an Object-Oriented Framework for Combinatorial Enumeration.
COODBSE 1994: 134-144 |
| 22 | EE | D. A. Preece,
P. W. Brading,
Clement W. H. Lam,
M. Côté:
Balanced 6 × 6 designs for 4 equally replicated treatments.
Discrete Mathematics 125(1-3): 319-327 (1994) |
| 1991 |
|---|
| 21 | EE | Clement W. H. Lam,
Galina Kolesova,
Larry H. Thiel:
A computer search for finite projective planes of order 9.
Discrete Mathematics 92(1-3): 187-195 (1991) |
| 1990 |
|---|
| 20 | | Clement W. H. Lam,
Vera Pless:
There is no (24, 12, 10) self-dual quaternary code.
IEEE Transactions on Information Theory 36(5): 1153- (1990) |
| 19 | EE | Galina Kolesova,
Clement W. H. Lam,
Larry H. Thiel:
On the number of 8×8 latin squares.
J. Comb. Theory, Ser. A 54(1): 143-148 (1990) |
| 1989 |
|---|
| 18 | | Hon F. Li,
R. Jayakumar,
Clement Wing Hong Lam:
Restructuring for Fault-Tolerant Systolic Arrays.
IEEE Trans. Computers 38(2): 307-311 (1989) |
| 17 | | Clement Wing Hong Lam,
Hon F. Li,
R. Jayakumar:
A Study of Two Approaches for Reconfiguring Fault-Tolerant Systolic Arrays.
IEEE Trans. Computers 38(6): 833-844 (1989) |
| 16 | | Clement W. H. Lam,
Larry H. Thiel:
Backtrack Search with Isomorph Rejection and Consistency Check.
J. Symb. Comput. 7(5): 473-485 (1989) |
| 1986 |
|---|
| 15 | EE | Clement W. H. Lam,
Larry H. Thiel,
Stan Swiercz:
The nonexistence of code words of weight 16 in a projective plane of order 10.
J. Comb. Theory, Ser. A 42(2): 207-214 (1986) |
| 1985 |
|---|
| 14 | | Gregory Butler,
Clement W. H. Lam:
A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects.
J. Symb. Comput. 1(4): 363-381 (1985) |
| 1984 |
|---|
| 13 | | Aart Blokhuis,
Clement W. H. Lam:
More Coverings by Rook Domains.
J. Comb. Theory, Ser. A 36(2): 240-244 (1984) |
| 1983 |
|---|
| 12 | EE | Clement W. H. Lam:
Non-skew symmetric orthogonal matrices with constant diagonals.
Discrete Mathematics 43(1): 65-78 (1983) |
| 11 | EE | Clement W. H. Lam,
Larry H. Thiel,
Stan Swiercz,
John McKay:
The nonexistence of ovals in a projective plane of order 10.
Discrete Mathematics 45(2-3): 319-321 (1983) |
| 10 | | Clement W. H. Lam,
S. L. Ma,
M. K. Siu:
The Existence and Nonexistence of Perfect Addition Sets.
J. Comb. Theory, Ser. A 35(1): 67-78 (1983) |
| 1982 |
|---|
| 9 | | Bipin C. Desai,
Clement Wing Hong Lam,
J. William Atwood,
Jaroslav Opatrny,
Peter Grogono,
S. Cabilio:
NOVAC: a non-tree variable tree for combinatorial computing.
ICPP 1982: 193-195 |
| 8 | | Clement W. H. Lam,
Leonard H. Soicher:
Three New Combination Algorithms with the Minimal Change Property.
Commun. ACM 25(8): 555-559 (1982) |
| 1978 |
|---|
| 7 | EE | Clement W. H. Lam,
Jack H. van Lint:
Directed graphs with unique paths of fixed length.
J. Comb. Theory, Ser. B 24(3): 331-337 (1978) |
| 1977 |
|---|
| 6 | | Clement W. H. Lam:
Cyclotomy and Addition Sets.
J. Comb. Theory, Ser. A 22(1): 43-60 (1977) |
| 5 | | Clement W. H. Lam:
On Some Solutions of Ak = dl + lambda J.
J. Comb. Theory, Ser. A 23(2): 140-147 (1977) |
| 1976 |
|---|
| 4 | | Clement W. H. Lam:
Nth Power Residue Addition Sets.
J. Comb. Theory, Ser. A 20(1): 20-33 (1976) |
| 1975 |
|---|
| 3 | | Clement W. H. Lam:
A Generalization of Cyclic Difference Sets I.
J. Comb. Theory, Ser. A 19(1): 51-65 (1975) |
| 2 | | Clement W. H. Lam:
A Generalization of Cyclic Difference Sets II.
J. Comb. Theory, Ser. A 19(2): 177-191 (1975) |
| 1973 |
|---|
| 1 | | Clement Wing Hong Lam,
John McKay:
Arithmetic Overa Finite Field [A1] (Algorithm 469).
Commun. ACM 16(11): 699 (1973) |
