The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Richard M. Wilson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Heeralal Janwa, Richard M. Wilson
    Hyperplane Sections of Fermat Varieties in P3 in Char.2 and Some Applications to Cyclic Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1993, pp:180-194 [Conf]
  2. Fan R. K. Chung, Ronald L. Graham, Richard M. Wilson
    Quasi-random graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:345-362 [Journal]
  3. Peter Frankl, Richard M. Wilson
    Intersection theorems with geometric consequences. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:4, pp:357-368 [Journal]
  4. Richard M. Wilson
    The exact bound in the Erdös - Ko - Rado theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:247-257 [Journal]
  5. Esther R. Lamken, W. H. Mills, Richard M. Wilson
    Four Pairwise Balanced Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1991, v:1, n:1, pp:63-68 [Journal]
  6. Richard M. Wilson
    Signed Hypergraph Designs and Diagonal Forms for Some Incidence Matrices. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:17, n:1-3, pp:289-297 [Journal]
  7. Haim Hanani, Dwijendra K. Ray-Chaudhuri, Richard M. Wilson
    On resolvable designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:876-885 [Journal]
  8. Richard M. Wilson
    A lemma on polynomials modulo pm and applications to coding theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3154-3165 [Journal]
  9. Paul Erdös, Joel C. Fowler, Vera T. Sós, Richard M. Wilson
    On 2-Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:38, n:2, pp:131-142 [Journal]
  10. Peter Frankl, Vojtech Rödl, Richard M. Wilson
    The number of submatrices of a given type in a Hadamard matrix and related results. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:3, pp:317-328 [Journal]
  11. Peter Frankl, Richard M. Wilson
    The Erdös-Ko-Rado theorem for vector spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:2, pp:228-236 [Journal]
  12. Esther R. Lamken, Richard M. Wilson
    Decompositions of Edge-Colored Complete Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:2, pp:149-200 [Journal]
  13. Richard M. Wilson
    An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1972, v:13, n:2, pp:220-245 [Journal]
  14. Richard M. Wilson
    An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1972, v:13, n:2, pp:246-273 [Journal]
  15. Richard M. Wilson
    An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1975, v:18, n:1, pp:71-79 [Journal]
  16. Richard M. Wilson
    Inequalities for t Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:34, n:3, pp:313-324 [Journal]
  17. Richard M. Wilson, Qing Xiang
    Constructions of Hadamard Difference Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:77, n:1, pp:148-160 [Journal]
  18. R. D. Baker, Jacobus H. van Lint, Richard M. Wilson
    On the Preparata and Goethals codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:342-344 [Journal]
  19. Richard A. Brualdi, Vera Pless, Richard M. Wilson
    Short codes with a given coveting radius. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:1, pp:99-109 [Journal]
  20. Jacobus H. van Lint, Richard M. Wilson
    On the minimum distance of cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:1, pp:23-40 [Journal]
  21. Jacobus H. van Lint, Richard M. Wilson
    Binary cyclic codes generated by mira7. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:2, pp:283-0 [Journal]

  22. More on decompositions of edge-colored complete graphs. [Citation Graph (, )][DBLP]


  23. On set systems with restricted intersections modulo p and p-ary t-designs. [Citation Graph (, )][DBLP]


  24. The cone condition and t-designs. [Citation Graph (, )][DBLP]


Search in 0.051secs, Finished in 0.052secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002