default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Edwin Clark
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j18]William Edwin Clark, Xiang-dong Hou:
Galkin Quandles, Pointed Abelian Groups, and Sequence A000712. Electron. J. Comb. 20(1): 45 (2013)
2000 – 2009
- 2007
- [j17]William Edwin Clark, Xiang-dong Hou, Alec Mihailovs:
The affinity of a permutation of a finite vector space. Finite Fields Their Appl. 13(1): 80-112 (2007) - 2003
- [j16]William Edwin Clark, Mourad E. H. Ismail, Stephen Suen:
Application of Upper and Lower Bounds for the Domination Number to Vizing's Conjecture. Ars Comb. 69 (2003) - 2000
- [j15]William Edwin Clark, Larry A. Dunning, Stephen Suen:
Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II. Electron. J. Comb. 7 (2000) - [j14]William Edwin Clark, Stephen Suen:
Inequality Related to Vizing's Conjecture. Electron. J. Comb. 7 (2000)
1990 – 1999
- 1997
- [j13]William Edwin Clark, Larry A. Dunning:
Tight Upper Bounds for the Domination Numbers of Graphs With Given Order and Minimum Degree. Electron. J. Comb. 4(1) (1997) - 1996
- [j12]William Edwin Clark, Mourad E. H. Ismail:
Binomial and Q-Binomial Coefficient Inequalities Related to the Hamiltonicity of the Kneser Graphs and Their Q-Analogues. J. Comb. Theory A 76(1): 83-98 (1996) - 1993
- [j11]Tony Yu Chang, William Edwin Clark:
The domination numbers of the 5 × n and 6 × n grid graphs. J. Graph Theory 17(1): 81-107 (1993) - 1992
- [j10]William Edwin Clark, John Pedersen:
Sum-Free Sets in Vector Spaces over GF(2). J. Comb. Theory A 61(2): 222-229 (1992) - [j9]William Edwin Clark, Gregory L. McColm, W. Richard Stark:
On the Complexity of Deadlock-Free Programs on a Ring of Processors. J. Parallel Distributed Comput. 16(1): 67-71 (1992) - 1991
- [j8]William Edwin Clark:
Blocking sets in finite projective spaces and uneven binary codes. Discret. Math. 94(1): 65-68 (1991) - 1990
- [j7]William Edwin Clark, Larry A. Dunning, Douglas G. Rogers:
Binary set functions and parity check matrices. Discret. Math. 80(3): 249-265 (1990)
1980 – 1989
- 1989
- [j6]William Edwin Clark, Larry A. Dunning, Douglas G. Rogers:
The construction of some bit and byte error control codes using partial Steiner systems. IEEE Trans. Inf. Theory 35(6): 1305-1310 (1989) - 1986
- [j5]William Edwin Clark:
Cyclic codes over GF(q) with simple orbit structure. Discret. Math. 61(2-3): 151-164 (1986) - [j4]William Edwin Clark, Joseph J. Liang:
Equidistant binary arithmetic codes. IEEE Trans. Inf. Theory 32(1): 106-108 (1986)
1970 – 1979
- 1977
- [j3]William Edwin Clark:
Equidistant cyclic codes over GF(q). Discret. Math. 17(2): 139-141 (1977) - 1974
- [j2]William Edwin Clark, Joseph J. Liang:
On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.). IEEE Trans. Inf. Theory 20(6): 767-770 (1974) - 1973
- [j1]William Edwin Clark, Joseph J. Liang:
On arithmetic weight for a general radix representation of integers (Corresp.). IEEE Trans. Inf. Theory 19(6): 823-826 (1973)
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 20:31 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:
