Search the dblp DataBase
R. A. Bailey :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
R. A. Bailey Orthogonal Partitions in Designed Experiments. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1996, v:8, n:1-2, pp:45-77 [Journal ] Priscila P. Alejandro , R. A. Bailey , Peter J. Cameron Association schemes and permutation groups. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:266, n:1-3, pp:47-67 [Journal ] R. A. Bailey Suprema and infima of association schemes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:248, n:1-3, pp:1-16 [Journal ] R. A. Bailey Balanced colourings of strongly regular graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2005, v:293, n:1-3, pp:73-90 [Journal ] R. A. Bailey , Matthew A. Ollis , Donald A. Preece Round-dance neighbour designs from terraces. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:266, n:1-3, pp:69-86 [Journal ] R. A. Bailey , Peter J. Cameron , Peter Dobcsányi , John P. Morgan , Leonard H. Soicher Designs on the web. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3014-3027 [Journal ] R. A. Bailey Generalized wreath products of association schemes. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2006, v:27, n:3, pp:428-435 [Journal ] R. A. Bailey , Dieter Jungnickel Translation nets and fixed-point-free group automorphisms. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1990, v:55, n:1, pp:1-13 [Journal ] R. A. Bailey , Peter J. Cameron What is a design? How should we classify them? [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2007, v:44, n:1-3, pp:223-238 [Journal ] R. A. Bailey A Howell design admitting A_{5} ^{1} . [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:167, n:, pp:65-71 [Journal ] R. A. Bailey , P. E. Chigbu Enumeration of semi-Latin squares. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:167, n:, pp:73-84 [Journal ] Search in 0.066secs, Finished in 0.066secs