Arithmetic Overa Finite Field [A1] (Algorithm 469). - Clement Wing Hong Lam; John McKay 001 (Commun. ACM, 1973)

A Generalization of Cyclic Difference Sets I. - Clement W. H. Lam (J. Comb. Theory A, 1975)

A Generalization of Cyclic Difference Sets II. - Clement W. H. Lam (J. Comb. Theory A, 1975)

Nth Power Residue Addition Sets. - Clement W. H. Lam (J. Comb. Theory A, 1976)

The distribution of 1-widths of (0, 1)-matrices. - Clement W. H. Lam (Discret. Math., 1977)

On Some Solutions of Ak = dl + lambda J. - Clement W. H. Lam (J. Comb. Theory A, 1977)

Cyclotomy and Addition Sets. - Clement W. H. Lam (J. Comb. Theory A, 1977)

Directed graphs with unique paths of fixed length. - Clement W. H. Lam; Jack H. van Lint (J. Comb. Theory B, 1978)

Distance transitive digraphs. - Clement W. H. Lam (Discret. Math., 1980)

NOVAC: a non-tree variable tree for combinatorial computing. - Bipin C. Desai; Clement Wing Hong Lam; J. William Atwood; Jaroslav Opatrny; Peter Grogono; S. Cabilio (ICPP, 1982)

Three New Combination Algorithms with the Minimal Change Property. - Clement W. H. Lam; Leonard H. Soicher (Commun. ACM, 1982)

Non-skew symmetric orthogonal matrices with constant diagonals. - Clement W. H. Lam (Discret. Math., 1983)

The nonexistence of ovals in a projective plane of order 10. - Clement W. H. Lam; Larry H. Thiel; Stan Swiercz; John McKay 001 (Discret. Math., 1983)

The Existence and Nonexistence of Perfect Addition Sets. - Clement W. H. Lam; Siu Lun Ma; M. K. Siu (J. Comb. Theory A, 1983)

More Coverings by Rook Domains. - Aart Blokhuis; Clement W. H. Lam (J. Comb. Theory A, 1984)

A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects. - Gregory Butler; Clement W. H. Lam (J. Symb. Comput., 1985)

The nonexistence of code words of weight 16 in a projective plane of order 10. - Clement W. H. Lam; Larry H. Thiel; Stan Swiercz (J. Comb. Theory A, 1986)

Backtrack Search with Isomorph Rejection and Consistency Check. - Clement W. H. Lam; Larry H. Thiel (J. Symb. Comput., 1989)

A Study of Two Approaches for Reconfiguring Fault-Tolerant Systolic Arrays. - Clement Wing Hong Lam; Hon Fung Li; R. Jayakumar (IEEE Trans. Computers, 1989)

Restructuring for Fault-Tolerant Systolic Arrays. - Hon Fung Li; R. Jayakumar; Clement Wing Hong Lam (IEEE Trans. Computers, 1989)

On the number of 8×8 latin squares. - Galina Kolesova; Clement W. H. Lam; Larry H. Thiel (J. Comb. Theory A, 1990)

There is no (24, 12, 10) self-dual quaternary code. - Clement W. H. Lam; Vera Pless (IEEE Trans. Inf. Theory, 1990)

Application of Group Theory to Combinatorial Searches. - Clement W. H. Lam (Groups And Computation, 1991)

A computer search for finite projective planes of order 9. - Clement W. H. Lam; Galina Kolesova; Larry H. Thiel (Discret. Math., 1991)

The Preliminary Design of an Object-Oriented Framework for Combinatorial Enumeration. - Gregory Butler; Clement W. H. Lam (COODBSE, 1994)

Balanced 6 × 6 designs for 4 equally replicated treatments. - Donald A. Preece; P. W. Brading; Clement W. H. Lam; Michel Côté (Discret. Math., 1994)

Design and Analysis of Hierarchical Ring Networks for Shared-Memory Multiprocessors. - Clement W. H. Lam; Hong Jiang; V. Carl Hamacher (ICPP (1), 1995)

On Quasi-Symmetric 2-(28, 12, 11) and 2-(36, 16, 12) Designs. - Clement W. H. Lam; Larry H. Thiel; Vladimir D. Tonchev (Des. Codes Cryptogr., 1995)

On Cyclically Resolvable Cyclic Steiner 2-Designs. - Clement W. H. Lam; Ying Miao 001 (J. Comb. Theory A, 1999)

Three Improvements to the BLASTP Search of Genome Databases. - Shawn Delaney; Gregory Butler; Clement W. H. Lam; Larry H. Thiel (SSDBM, 2000)

Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. - Clement W. H. Lam; Ying Miao 001 (Discret. Math., 2000)

Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices. - Clement W. H. Lam; Sigmund Lam; Vladimir D. Tonchev (J. Comb. Theory A, 2000)

Difference Families. - Clement W. H. Lam; Ying Miao 001 (Des. Codes Cryptogr., 2001)

Resolvable group divisible designs with block size four and group size six. - Gennian Ge; Clement W. H. Lam (Discret. Math., 2003)

Bhaskar Rao designs with block size four. - Gennian Ge; Clement W. H. Lam (Discret. Math., 2003)

A note on {4}-GDDs of type 210. - Donald L. Kreher; Alan C. H. Ling; Rolf S. Rees; Clement W. H. Lam (Discret. Math., 2003)

Some new triplewhist tournaments TWh(v). - Gennian Ge; Clement W. H. Lam (J. Comb. Theory A, 2003)

The extended quadratic residue code is the only (48, 24, 12) self-dual doubly-even code. - Sheridan K. Houghten; Clement W. H. Lam; Larry H. Thiel; J. A. Parker (IEEE Trans. Inf. Theory, 2003)

Whist tournaments with the three person property. - Gennian Ge; Clement W. H. Lam (Discret. Appl. Math., 2004)

Resolvable Maximum Packings with Quadruples. - Gennian Ge; Clement W. H. Lam; Alan C. H. Ling; Hao Shen (Des. Codes Cryptogr., 2005)

Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4. - Masaaki Harada; Clement W. H. Lam; Vladimir D. Tonchev (Des. Codes Cryptogr., 2005)

Classification of Generalized Hadamard Matrices H(6,3) and Quaternary Hermitian Self-Dual Codes of Length 18. - Masaaki Harada; Clement W. H. Lam; Akihiro Munemasa; Vladimir D. Tonchev (Electron. J. Comb., 2010)

Strongly regular graphs with non-trivial automorphisms. - Majid Behbahani; Clement W. H. Lam (Discret. Math., 2011)

Finding error-correcting codes using computers. - Clement W. H. Lam (Information Security, Coding Theory and Related Combinatorics, 2011)

On triple systems and strongly regular graphs. - Majid Behbahani; Clement W. H. Lam; Patric R. J. Östergård (J. Comb. Theory A, 2012)