default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClement W. H. Lam
Person information
- affiliation: Concordia University, Montreal, Canada
- award (2006): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2012
[j39]Majid Behbahani, Clement W. H. Lam, Patric R. J. Östergård:
On triple systems and strongly regular graphs. J. Comb. Theory A 119(7): 1414-1426 (2012)- 2011
- [j38]Majid Behbahani, Clement W. H. Lam:
Strongly regular graphs with non-trivial automorphisms. Discret. Math. 311(2-3): 132-144 (2011) - 2010
- [j37]Masaaki Harada, Clement W. H. Lam, Akihiro Munemasa, Vladimir D. Tonchev:
Classification of Generalized Hadamard Matrices H(6,3) and Quaternary Hermitian Self-Dual Codes of Length 18. Electron. J. Comb. 17(1) (2010) - 2005
- [j36]Masaaki Harada, Clement W. H. Lam, Vladimir D. Tonchev
:
Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4. Des. Codes Cryptogr. 34(1): 71-87 (2005) - [j35]Gennian Ge, Clement W. H. Lam, Alan C. H. Ling, Hao Shen:
Resolvable Maximum Packings with Quadruples. Des. Codes Cryptogr. 35(3): 287-302 (2005) - 2004
- [j34]Gennian Ge, Clement W. H. Lam:
Whist tournaments with the three person property. Discret. Appl. Math. 138(3): 265-276 (2004) - 2003
- [j33]Donald L. Kreher, Alan C. H. Ling, Rolf S. Rees, Clement W. H. Lam:
A note on {4}-GDDs of type 210. Discret. Math. 261(1-3): 373-376 (2003) - [j32]Gennian Ge, Clement W. H. Lam:
Resolvable group divisible designs with block size four and group size six. Discret. Math. 268(1-3): 139-151 (2003) - [j31]Gennian Ge, Clement W. H. Lam:
Bhaskar Rao designs with block size four. Discret. Math. 268(1-3): 293-298 (2003) - [j30]Gennian Ge, Clement W. H. Lam:
Some new triplewhist tournaments TWh(v). J. Comb. Theory A 101(1): 153-159 (2003) - [j29]Sheridan 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 Trans. Inf. Theory 49(1): 53-59 (2003) - 2001
- [j28]Clement W. H. Lam, Ying Miao:
Difference Families. Des. Codes Cryptogr. 24(3): 291-304 (2001) - 2000
- [j27]Clement W. H. Lam, Ying Miao:
Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. Discret. Math. 219(1-3): 173-185 (2000) - [j26]Clement W. H. Lam, Sigmund Lam, Vladimir D. Tonchev:
Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices. J. Comb. Theory A 92(2): 186-196 (2000) - 1999
- [j25]Clement W. H. Lam, Ying Miao:
On Cyclically Resolvable Cyclic Steiner 2-Designs. J. Comb. Theory A 85(2): 194-207 (1999) - 1995
- [j24]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 Cryptogr. 5(1): 43-55 (1995) - 1994
- [j23]Donald A. Preece, P. W. Brading, Clement W. H. Lam, Michel Côté:
Balanced 6 × 6 designs for 4 equally replicated treatments. Discret. Math. 125(1-3): 319-327 (1994) - 1991
- [j22]Clement W. H. Lam, Galina Kolesova, Larry H. Thiel:
A computer search for finite projective planes of order 9. Discret. Math. 92(1-3): 187-195 (1991) - 1990
- [j21]Galina Kolesova, Clement W. H. Lam, Larry H. Thiel:
On the number of 8×8 latin squares. J. Comb. Theory A 54(1): 143-148 (1990) - [j20]Clement W. H. Lam, Vera Pless:
There is no (24, 12, 10) self-dual quaternary code. IEEE Trans. Inf. Theory 36(5): 1153-1156 (1990) - 1989
- [j19]Clement W. H. Lam, Larry H. Thiel:
Backtrack Search with Isomorph Rejection and Consistency Check. J. Symb. Comput. 7(5): 473-485 (1989) - [j18]Hon Fung Li, R. Jayakumar, Clement Wing Hong Lam:
Restructuring for Fault-Tolerant Systolic Arrays. IEEE Trans. Computers 38(2): 307-311 (1989) - [j17]Clement Wing Hong Lam, Hon Fung Li, R. Jayakumar:
A Study of Two Approaches for Reconfiguring Fault-Tolerant Systolic Arrays. IEEE Trans. Computers 38(6): 833-844 (1989) - 1986
- [j16]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 A 42(2): 207-214 (1986) - 1985
- [j15]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
- [j14]Aart Blokhuis, Clement W. H. Lam:
More Coverings by Rook Domains. J. Comb. Theory A 36(2): 240-244 (1984) - 1983
- [j13]Clement W. H. Lam:
Non-skew symmetric orthogonal matrices with constant diagonals. Discret. Math. 43(1): 65-78 (1983) - [j12]Clement W. H. Lam, Larry H. Thiel, Stan Swiercz, John McKay:
The nonexistence of ovals in a projective plane of order 10. Discret. Math. 45(2-3): 319-321 (1983) - [j11]Clement W. H. Lam, Siu Lun Ma, M. K. Siu:
The Existence and Nonexistence of Perfect Addition Sets. J. Comb. Theory A 35(1): 67-78 (1983) - 1982
- [j10]Clement W. H. Lam, Leonard H. Soicher:
Three New Combination Algorithms with the Minimal Change Property. Commun. ACM 25(8): 555-559 (1982) - 1980
- [j9]Clement W. H. Lam:
Distance transitive digraphs. Discret. Math. 29(3): 265-274 (1980) - 1978
- [j8]Clement W. H. Lam, Jack H. van Lint:
Directed graphs with unique paths of fixed length. J. Comb. Theory B 24(3): 331-337 (1978) - 1977
- [j7]Clement W. H. Lam:
The distribution of 1-widths of (0, 1)-matrices. Discret. Math. 20: 109-122 (1977) - [j6]Clement W. H. Lam:
Cyclotomy and Addition Sets. J. Comb. Theory A 22(1): 43-60 (1977) - [j5]Clement W. H. Lam:
On Some Solutions of Ak = dl + lambda J. J. Comb. Theory A 23(2): 140-147 (1977) - 1976
- [j4]Clement W. H. Lam:
Nth Power Residue Addition Sets. J. Comb. Theory A 20(1): 20-33 (1976) - 1975
- [j3]Clement W. H. Lam:
A Generalization of Cyclic Difference Sets I. J. Comb. Theory A 19(1): 51-65 (1975) - [j2]Clement W. H. Lam:
A Generalization of Cyclic Difference Sets II. J. Comb. Theory A 19(2): 177-191 (1975) - 1973
- [j1]Clement Wing Hong Lam, John McKay:
Arithmetic Overa Finite Field [A1] (Algorithm 469). Commun. ACM 16(11): 699 (1973)
Conference and Workshop Papers
- 2000
- [c5]Shawn Delaney, Gregory Butler, Clement W. H. Lam, Larry H. Thiel:
Three Improvements to the BLASTP Search of Genome Databases. SSDBM 2000: 14-24 - 1995
- [c4]Clement W. H. Lam, Hong Jiang, V. Carl Hamacher:
Design and Analysis of Hierarchical Ring Networks for Shared-Memory Multiprocessors. ICPP (1) 1995: 46-50 - 1994
- [c3]Gregory Butler, Clement W. H. Lam:
The Preliminary Design of an Object-Oriented Framework for Combinatorial Enumeration. COODBSE 1994: 134-144 - 1991
- [c2]Clement W. H. Lam:
Application of Group Theory to Combinatorial Searches. Groups And Computation 1991: 133-138 - 1982
- [c1]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
Parts in Books or Collections
- 2011
- [p1]Clement W. H. Lam:
Finding error-correcting codes using computers. Information Security, Coding Theory and Related Combinatorics 2011: 278-284
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
