| 2008 |
| 24 | EE | Anna Draganova,
Yukiyasu Mutoh,
Richard M. Wilson:
More on decompositions of edge-colored complete graphs.
Discrete Mathematics 308(14): 2926-2943 (2008) |
| 2007 |
| 23 | EE | Peter Dukes,
Richard M. Wilson:
The cone condition and t-designs.
Eur. J. Comb. 28(6): 1610-1625 (2007) |
| 2006 |
| 22 | EE | Haim Hanani,
Dwijendra K. Ray-Chaudhuri,
Richard M. Wilson:
On resolvable designs.
Discrete Mathematics 306(10-11): 876-885 (2006) |
| 21 | EE | Richard M. Wilson:
A lemma on polynomials modulo pm and applications to coding theory.
Discrete Mathematics 306(23): 3154-3165 (2006) |
| 20 | EE | Peter Keevash,
Dhruv Mubayi,
Richard M. Wilson:
Set Systems with No Singleton Intersection.
SIAM J. Discrete Math. 20(4): 1031-1041 (2006) |
| 2000 |
| 19 | EE | Esther R. Lamken,
Richard M. Wilson:
Decompositions of Edge-Colored Complete Graphs.
J. Comb. Theory, Ser. A 89(2): 149-200 (2000) |
| 1999 |
| 18 | | Richard M. Wilson:
Signed Hypergraph Designs and Diagonal Forms for Some Incidence Matrices.
Des. Codes Cryptography 17(1-3): 289-297 (1999) |
| 1997 |
| 17 | EE | Richard M. Wilson,
Qing Xiang:
Constructions of Hadamard Difference Sets.
J. Comb. Theory, Ser. A 77(1): 148-160 (1997) |
| 1993 |
| 16 | | 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 |
| 1991 |
| 15 | | Esther R. Lamken,
W. H. Mills,
Richard M. Wilson:
Four Pairwise Balanced Designs.
Des. Codes Cryptography 1(1): 63-68 (1991) |
| 1989 |
| 14 | | Fan R. K. Chung,
Ronald L. Graham,
Richard M. Wilson:
Quasi-random graphs.
Combinatorica 9(4): 345-362 (1989) |
| 13 | | Richard A. Brualdi,
Vera Pless,
Richard M. Wilson:
Short codes with a given coveting radius.
IEEE Transactions on Information Theory 35(1): 99-109 (1989) |
| 1988 |
| 12 | EE | 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, Ser. B 44(3): 317-328 (1988) |
| 1986 |
| 11 | | Jacobus H. van Lint,
Richard M. Wilson:
On the minimum distance of cyclic codes.
IEEE Transactions on Information Theory 32(1): 23-40 (1986) |
| 10 | | Jacobus H. van Lint,
Richard M. Wilson:
Binary cyclic codes generated by mira7.
IEEE Transactions on Information Theory 32(2): 283- (1986) |
| 9 | EE | Peter Frankl,
Richard M. Wilson:
The Erdös-Ko-Rado theorem for vector spaces.
J. Comb. Theory, Ser. A 43(2): 228-236 (1986) |
| 1985 |
| 8 | | Paul Erdös,
Joel C. Fowler,
Vera T. Sós,
Richard M. Wilson:
On 2-Designs.
J. Comb. Theory, Ser. A 38(2): 131-142 (1985) |
| 1984 |
| 7 | | Richard M. Wilson:
The exact bound in the Erdös - Ko - Rado theorem.
Combinatorica 4(2): 247-257 (1984) |
| 1983 |
| 6 | | R. D. Baker,
Jacobus H. van Lint,
Richard M. Wilson:
On the Preparata and Goethals codes.
IEEE Transactions on Information Theory 29(3): 342-344 (1983) |
| 5 | | Richard M. Wilson:
Inequalities for t Designs.
J. Comb. Theory, Ser. A 34(3): 313-324 (1983) |
| 1981 |
| 4 | | Peter Frankl,
Richard M. Wilson:
Intersection theorems with geometric consequences.
Combinatorica 1(4): 357-368 (1981) |
| 1975 |
| 3 | | Richard M. Wilson:
An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures.
J. Comb. Theory, Ser. A 18(1): 71-79 (1975) |
| 1972 |
| 2 | | Richard M. Wilson:
An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms.
J. Comb. Theory, Ser. A 13(2): 220-245 (1972) |
| 1 | | Richard M. Wilson:
An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures.
J. Comb. Theory, Ser. A 13(2): 246-273 (1972) |