default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard M. Wilson 0001
Person information
- affiliation: California Institute of Technology, Pasadena, CA, USA
- affiliation (PhD 1969): Ohio State University, Columbus, OH, USA
Other persons with the same name
- Richard M. Wilson 0002 — New Hampshire University, Durham, NH, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j31]Richard M. Wilson, Tony W. H. Wong
:
Diagonal forms of incidence matrices associated with tt-uniform hypergraphs. Eur. J. Comb. 35: 490-508 (2014)- 2013
- [j30]Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling, Richard M. Wilson:
Covering and packing for pairs. J. Comb. Theory A 120(7): 1440-1449 (2013) - 2011
- [j29]Richard M. Wilson, Tony W. H. Wong:
Diagonal forms for incidence matrices and zero-sum Ramsey theory. Electron. Notes Discret. Math. 38: 825-828 (2011) - [p1]Richard M. Wilson:
Codes and modules associated with designs and t-uniform hypergraphs. Information Security, Coding Theory and Related Combinatorics 2011: 404-436
2000 – 2009
- 2009
- [j28]Richard M. Wilson:
On set systems with restricted intersections modulo p and p-ary t-designs. Discret. Math. 309(3): 606-612 (2009) - 2008
- [j27]Anna Draganova, Yukiyasu Mutoh, Richard M. Wilson:
More on decompositions of edge-colored complete graphs. Discret. Math. 308(14): 2926-2943 (2008) - 2007
- [j26]Peter Dukes, Richard M. Wilson:
The cone condition and t-designs. Eur. J. Comb. 28(6): 1610-1625 (2007) - 2006
- [j25]Haim Hanani, Dwijendra K. Ray-Chaudhuri, Richard M. Wilson:
On resolvable designs. Discret. Math. 306(10-11): 876-885 (2006) - [j24]Richard M. Wilson:
A lemma on polynomials modulo pm and applications to coding theory. Discret. Math. 306(23): 3154-3165 (2006) - [j23]Peter Keevash, Dhruv Mubayi, Richard M. Wilson:
Set Systems with No Singleton Intersection. SIAM J. Discret. Math. 20(4): 1031-1041 (2006) - 2000
- [j22]Esther R. Lamken, Richard M. Wilson:
Decompositions of Edge-Colored Complete Graphs. J. Comb. Theory A 89(2): 149-200 (2000)
1990 – 1999
- 1999
- [j21]Richard M. Wilson:
Signed Hypergraph Designs and Diagonal Forms for Some Incidence Matrices. Des. Codes Cryptogr. 17(1-3): 289-297 (1999) - 1997
- [j20]Richard M. Wilson, Qing Xiang:
Constructions of Hadamard Difference Sets. J. Comb. Theory A 77(1): 148-160 (1997) - 1993
- [c1]Heeralal Janwa, Richard M. Wilson:
Hyperplane Sections of Fermat Varieties in P3 in Char.2 and Some Applications to Cyclic Codes. AAECC 1993: 180-194 - 1992
- [b1]Jacobus H. van Lint, Richard M. Wilson:
A course in combinatorics. Cambridge University Press 1992, ISBN 978-0-521-41057-1, pp. I-XII, 1-530 - 1991
- [j19]Esther R. Lamken, W. H. Mills, Richard M. Wilson:
Four Pairwise Balanced Designs. Des. Codes Cryptogr. 1(1): 63-68 (1991) - 1990
- [j18]Richard M. Wilson:
A Diagonal Form for the Incidence Matrices of t-Subsets vs.k-Subsets. Eur. J. Comb. 11(6): 609-615 (1990)
1980 – 1989
- 1989
- [j17]Fan R. K. Chung, Ronald L. Graham, Richard M. Wilson:
Quasi-random graphs. Comb. 9(4): 345-362 (1989) - [j16]Richard A. Brualdi, Vera Pless, Richard M. Wilson:
Short codes with a given coveting radius. IEEE Trans. Inf. Theory 35(1): 99-109 (1989) - 1988
- [j15]Peter Frankl, Vojtech Rödl, Richard M. Wilson:
The number of submatrices of a given type in a Hadamard matrix and related results. J. Comb. Theory B 44(3): 317-328 (1988) - 1986
- [j14]Peter Frankl, Richard M. Wilson:
The Erdös-Ko-Rado theorem for vector spaces. J. Comb. Theory A 43(2): 228-236 (1986) - [j13]Jacobus H. van Lint, Richard M. Wilson:
On the minimum distance of cyclic codes. IEEE Trans. Inf. Theory 32(1): 23-40 (1986) - [j12]Jacobus H. van Lint, Richard M. Wilson:
Binary cyclic codes generated by mira7. IEEE Trans. Inf. Theory 32(2): 283- (1986) - 1985
- [j11]Paul Erdös, Joel C. Fowler, Vera T. Sós, Richard M. Wilson:
On 2-Designs. J. Comb. Theory A 38(2): 131-142 (1985) - 1984
- [j10]Richard M. Wilson:
The exact bound in the Erdös - Ko - Rado theorem. Comb. 4(2): 247-257 (1984) - 1983
- [j9]Richard M. Wilson:
Inequalities for t Designs. J. Comb. Theory A 34(3): 313-324 (1983) - [j8]Ronald D. Baker, Jacobus H. van Lint, Richard M. Wilson:
On the Preparata and Goethals codes. IEEE Trans. Inf. Theory 29(3): 342-344 (1983) - 1981
- [j7]Peter Frankl, Richard M. Wilson:
Intersection theorems with geometric consequences. Comb. 1(4): 357-368 (1981)
1970 – 1979
- 1975
- [j6]Richard M. Wilson:
An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures. J. Comb. Theory A 18(1): 71-79 (1975) - 1974
- [j5]Richard M. Wilson:
Concerning the number of mutually orthogonal latin squares. Discret. Math. 9(2): 181-198 (1974) - 1973
- [j4]Jean Doyen, Richard M. Wilson:
Embeddings of Steiner triple systems. Discret. Math. 5(3): 229-239 (1973) - 1972
- [j3]Haim Hanani, Dwijendra K. Ray-Chaudhuri, Richard M. Wilson:
On resolvable designs. Discret. Math. 3(4): 343-357 (1972) - [j2]Richard M. Wilson:
An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms. J. Comb. Theory A 13(2): 220-245 (1972) - [j1]Richard M. Wilson:
An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures. J. Comb. Theory A 13(2): 246-273 (1972)
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:26 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:
